EST-grid: an efficient scalable peer-to-peer infrastructure for web service discovery

Authors:
S. Sioutas;L. Drossos;D. Tsolis;T. S. Papatheodorou
Affiliations:
Computer Engineering and Informatics Department, University of Patras, Rion, Patras, Greece;Technological Institute of Messolongi, Department of Applied Informatics in Administration and Economics, Messolongi, Greece;Computer Engineering and Informatics Department, University of Patras, Rion, Patras, Greece;Computer Engineering and Informatics Department, University of Patras, Rion, Patras, Greece
Venue:
AIC'05 Proceedings of the 5th WSEAS International Conference on Applied Informatics and Communications
Year:
2005

Citing 8
Cited 0

Surpassing the information theoretic bound with fusion trees

Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Dynamic Perfect Hashing: Upper and Lower Bounds

SIAM Journal on Computing
A prototype implementation of archival Intermemory

Proceedings of the fourth ACM conference on Digital libraries
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
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
Wide-area cooperative storage with CFS

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service

HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
The globe distribution network

ATEC '00 Proceedings of the annual conference on USENIX Annual Technical Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Web services are becoming an important enabler of the Semantic Web. In this paper, we present a new P2P infrastructure for Web Services discovery. Peers that store Web Services information, such as data item descriptions, are efficiently located using a scalable and robust data indexing structure for Peer-to-Peer data networks, EST-GRID (Exponential Search Tree). EST-GRID provides support for processing Exact match Queries of the form "given a key, map the key onto a node". EST-GRID adapts efficiently update queries as nodes join and leave the system, and can answer queries even if the system is continuously changing. Results from theoretical analysis show that the communication cost of the query and update operations scaling both in O(√log n) time where n the number of nodes.