Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/ICSMC.2004.1400849 | Systems, Man and Cybernetics, 2004 IEEE International Conference |
Keywords | Field | DocType |
absdm.,tree searching,agent,multi-agent systems,searching-tree creating algorithm,uddi,multi-agent system,Internet,services discovery,recursive searching algorithm,service discovery mechanism | Search algorithm,Computer science,Server,Computer network,Multi-agent system,Artificial intelligence,Tree structure,Service discovery,Recursion,The Internet,World Wide Web,Distributed servers,Machine learning | Conference |
Volume | ISSN | ISBN |
4 | 1062-922X | 0-7803-8566-7 |
Citations | PageRank | References |
3 | 0.46 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Li Shijian | 1 | 3 | 0.46 |
| Congfu Xu | 2 | 131 | 15.71 |
| Zhaohui Wu | 3 | 3121 | 246.32 |
| Yunhe Pan | 4 | 1223 | 84.09 |