Abstract
Peer-to-peer networks are envisioned to be deployed for a wide range of applications. However, P2P networks evolving in an unorganized manner suffer from serious scalability problems, limiting the number of nodes in the network, creating network overload and pushing search times to unacceptable limits. We address these problems by imposing a deterministic shape on P2P networks: We propose a graph topology which allows for very efficient broadcast and search, and we describe a broadcast algorithm that exploits the topology to reach all nodes in the network with the minimum number of messages possible. We provide an efficient topology construction and maintenance algorithm which, crucial to symmetric peer-to-peer networks, does neither require a central server nor super nodes in the network. Nodes can join and leave the self-organizing network at any time, and the network is resilient against failure. Moreover, we show how our scheme can be made even more efficient by using a global ontology to determine the organization of peers in the graph topology, allowing for efficient concept-based search.
Work done while authors were at Stanford University.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Martin, D., et al.: DAML-S: Semantic Markup for Web Services. (2001) White paper, available at www.daml.org/services/daml-s.
Johnsson, S.L., Ho, C.T.: Optimum Broadcasting and Personalized Communication in Hypercubes. IEEE Transactions on Computers 38 (September 1989) 1249–1268
Schlosser, M., Sintek, M., Decker, S., Nejdl, W.: HyperCuP. (April 2002) Technical Report, Stanford University.
Akers, S.B., Krishnamurty, B.: A group-theoretic model for symmetric interconnection networks. IEEE Transactions on Computers 38 (April 1989) 555–566
Nejdl, W., et al.: EDUTELLA: A P2P Networking Infrastructure based on RDF. In: Proceedings of the 11th World Wide Web Conference. (May 2002)
Uschold, M., Gruninger, M.: Ontologies: Principles, Methods and Applications. Knowledge Engineering Review 11 (1996)
McIlraith, S., Son, T., Zeng: Semantic Web Services. IEEE Intelligent Systems. Special Issue on the Semantic Web 16 (March/April 2001) 46–53
S. Ratnasamy, S. S., Stoica, I.: Routing Algorithms for DHTs: Some Open Questions. In: Proceedings of 1st International Workshop on P2P Systems. (March 2002)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable contentaddressable network. In: Proceedings of ACM SIGCOMM. (August 2001)
Stoica, I., et al.: Chord: A scalable P2P lookup service for internet applications. In: Proceedings of ACM SIGCOMM. (August 2001)
Pandurangan, G., Raghavan, P., Upfal, E.: Building low diameter P2P networks. In: Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science. (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schlosser, M., Sintek, M., Decker, S., Nejdl, W. (2003). HyperCuP — Hypercubes, Ontologies, and Efficient Search on Peer-to-Peer Networks. In: Moro, G., Koubarakis, M. (eds) Agents and Peer-to-Peer Computing. AP2PC 2002. Lecture Notes in Computer Science(), vol 2530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45074-2_11
Download citation
DOI: https://doi.org/10.1007/3-540-45074-2_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40538-2
Online ISBN: 978-3-540-45074-0
eBook Packages: Springer Book Archive