A prototype implementation of archival Intermemory
Proceedings of the fourth ACM conference on Digital libraries
Tight(er) worst-case bounds on dynamic searching and priority queues
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Incrementally improving lookup latency in distributed hash table systems
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A Peer-to-Peer Approach to Web Service Discovery
World Wide Web
QoS computation and policing in dynamic web service selection
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
NIPPERS: Network of InterPolated PeERS for Web Service Discovery
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02
Efficient and adaptive discovery techniques of Web Services handling large data sets
Journal of Systems and Software
Web service workflow selection using system and network QoS constraints
International Journal of Web Engineering and Technology
Process-context aware matchmaking for web service composition
Journal of Network and Computer Applications
Dynamic Web Service discovery architecture based on a novel peer based overlay network
Journal of Systems and Software
ICCS 2009 Proceedings of the 9th International Conference on Computational Science
A vEB-tree-based architecture for interactive video on demand services in peer-to-peer networks
Journal of Network and Computer Applications
Super-peer-based coordinated service provision
Journal of Network and Computer Applications
Capacity and load-aware service discovery with service selection in peer-to-peer grids
Future Generation Computer Systems
| Hi-index | 0.00 |
Web Services (WS) constitute an essential factor for the next generation of application integration. An important direction, apart from the optimization of the description mechanism, is the discovery of WS information and WS search engines lookup capabilities. In this paper, we propose a novel decentralized approach for WS discovery based on a new distributed peer-based approach. Our proposed solution builds upon the Domain Name Service decentralized approach majorly enhanced with a novel efficient lookup up system. In particular, we work with peers that store WS information, such as service descriptions, which are efficiently located using a scalable and robust data indexing structure for Peer-to-Peer networks, the Balanced Distributed Tree (BDT). BDT provides support for processing (a) Exact match Queries of the form ''given a key, map the key onto a node'' and (b) Range Queries of the form ''map the nodes whose keys belong to a given range''. BDT adapts efficiently update queries as nodes join and leave the system, and can answer queries even if the system is continuously changing. Results from our theoretical analysis point out that the communication cost of both lookup and update operations scaling in sub-logarithmic (almost double-logarithmic) time complexity on the number of nodes. Furthermore, our system is also robust on failures.