SNet: skip graph based semantic web services discovery
Proceedings of the 2007 ACM symposium on Applied computing
| Hi-index | 0.00 |
Centralized UDDI currently becomes harder to catch up with the need of Internet-scale service publishing and discovery. Peer-to-Peer technology with its advantages of scalability, fault-tolerance and dynamics is suitable for loose-coupled Web services' distribution in nature and prevailing nowadays. In this paper, we present a distributed, collaborative Peer-to-Peer service overlay suitable for service publishing and discovery based on Skip Graph which could be organized by planar model or tree model according to the scale of services. We propose a prefix-ordered clustering mechanism that congregates the keys within a fixed prefix into the same bucket and make the smallest one appeared as the key in the service overlay which would support prefix, range query and semantic matching onWeb services. We then analyze the performance of our proposed with simulation that validates the effectiveness of the service overlay.