面向广域网的服务发现机制

提出了一种新的用转发服务请求方法实现面向广域网的服务发现机制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