A new agent based service discovery mechanism

The efficiency of the services discovery in Internet is attracting increasing attention. To compare with popular services discovery mechanism (UDDI mainly), we propose an agent-based services discovery mechanism in Internet (ABSDM). In this mechanism, we suppose that services information documents are stored in distributed servers, and servers are regarded as independent agents. So a searching-tree creating algorithm (STCA) could be used to join servers into a tree structure. Based on this structure, a recursive searching algorithm could be used to distribute searching request over the whole tree. During above-mentioned process, searching request could be parallel dealt with. Furthermore, searching efficiency of UDDI and ABSDM is evaluated and compared theoretically.