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

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