Abstract
In this work we present a service discovery system that supports flexible queries using partial keywords and wildcards. It is built upon a Chord network and it guarantees that any existing data that match a query is found. The main feature of this service is to use a proxy server layer with a mechanism for data distribution that reduces the number of nodes involved in the searching process.
Chapter PDF
Similar content being viewed by others
References
P. Rowstron and P. Druschel.: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science, 2218, 2001.
A. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: Scalable Peer-To-Peer lookup service for internet applications. In Proc. 2001 ACM SIGCOMM Conference, pages 149–160, 2001.
S. Ratnasamy et al., “A Scalable Content-Addressable Network,” Proc. ACM SIGComm, ACM Press, 2001, pp. 161–172.
C. Plaxton, R. Rajaraman, and A.W. Richa: “Accessing Nearby Copies of Replicated Objects in a Distributed Environment,” Proc. ACM SPAA, ACM Press, 1997, pp. 311–320.
M. Balazinska, H. Balakrishnan, and D. Karger. INS/Twine: A scalable peer-to-peer architecture for intentional resource discovery. In Proceedings of the First International Conference on Pervasive Computing, pages 195–210, Zurich, Switzerland, August 2002. Springer-Verlag. College, February 2002.
D. Spence and T. Harris. Xenosearch: Distributed resource discovery in the xenoserver open platform. In Proc. of HPDC 2003, Seattle, WA.
C. Tang, Z. Xu, and M. Mahalingam, PeerSearch: Efficient Information Retrieval in Peer-to-Peer Networks, tech. report HPL-2002-198, HP Labs, 2002.
C. Schmidt and M. Parashar, Enabling Flexible Queries with Guarantees in P2P Systems,-Internet Computing Journal, Vol. 8, No. 3, May/June 2004
R. Huebsch, J. M. Hellerstein, N. Lanham, B. T. Loo, S. Shenker, and I. Stoica. Querying the internet with pier. In Proc. of the 29th International Conference on Very Large Data Bases, September 2003.
D. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (May 1997), pp. 654–663.
D. Lewin. Consistent hashing and random trees: Algorithms for caching in distributed networks. Master’s thesis, MIT, 1998. Available at the MIT Library, http://thesis.mit.edu.
E. Guttman. Service location protocol: Automatic discovery of IP network services. Internet Computing, July/August 1999.
UPnP Forum: Understanding Universal Plug and Play: A white paper. http://upnp.org/download/UPNP_UnderstandingUPNP.doc(2000)
S. Microsystems. Jini architecture specification, December 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Madruga, M., Batista, T., Guedes, L.A. (2005). A Distributed Proxy Architecture for Service Discovery in Peer-to-Peer Networks. In: Glitho, R., Karmouch, A., Pierre, S. (eds) Intelligence in Communication Systems. INTELLCOMM 2005. IFIP — The International Federation for Information Processing, vol 190. Springer, Boston, MA. https://doi.org/10.1007/0-387-32015-6_19
Download citation
DOI: https://doi.org/10.1007/0-387-32015-6_19
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-29121-5
Online ISBN: 978-0-387-32015-1
eBook Packages: Computer ScienceComputer Science (R0)