提出了一種新的用轉(zhuǎn)發(fā)服務(wù)請求方法實現(xiàn)面向廣域網(wǎng)的服務(wù)發(fā)現(xiàn)機制RFSD。分布在廣域網(wǎng)中的服務(wù)器結(jié)點組成一個樹結(jié)構(gòu)，每個結(jié)點保存其父、兄弟和子等相鄰結(jié)點的地址；服務(wù)請求傳輸報文中附加一定的轉(zhuǎn)發(fā)信息。每個結(jié)點收到服務(wù)請求時，首先對其進行匹配操作，在滿足的情況下響應(yīng)服務(wù)請求，在不滿足的情況下對附加信息進行處理，并將服務(wù)請求轉(zhuǎn)發(fā)到某個相鄰結(jié)點，這種方法可以有效地實現(xiàn)廣域網(wǎng)中的服務(wù)發(fā)現(xiàn)。
關(guān) 鍵 詞 服務(wù)發(fā)現(xiàn); 廣域網(wǎng); 樹結(jié)構(gòu); 附加信息; 請求轉(zhuǎn)發(fā)

Abstract A wide area network oriented service discovery mechanism is described in this paper. Discovery servers in wide area networks are organized into a tree structure with each server node saves the address of its neighbor nodes, namely its father, brothers and children in the tree. The transmission message of service request is appended certain forwarding information. By matching the received service requests with service repository, each node response the service request or deals with the appended information in it and forward it to one of neighbor nodes. Thus, service discovery in wide area networks can be achieved effectively.
Key words service discovery; wide area network; tree structure; appended information; request forward