No Access

CONTENT NETWORKS: DISTRIBUTED ROUTING DECISIONS IN PRESENCE OF REPEATED QUERIES

MOJCA CIGLARIČ

Faculty of Computer and Information Science, University of Ljubljana, Ljubljana, 1000, Tržaška 25, Slovenia

https://doi.org/10.1142/S0129054104002601Cited by:1 (Source: Crossref)

Abstract

Content networks are overlay networks, enabling access to distributed contents on centralized servers or individual computers. Since flooding-based routing scheme features poor scalability, we present a modification, which reduces the total network traffic while retaining the original efficiency. In choosy routing, as we call it, each node, while passing an answer, remembers which neighbor it came from. Subsequently repeated queries about the same content are forwarded only to that neighbor. This way, the network learns effective routes. The simulations on several topology types have shown the expected behavior, with up to three-fold reduction in the overall query traffic.

Keywords:

References

L. Adamicet al., Physical Review E 64, 46135 (2001), DOI: 10.1103/PhysRevE.64.046135. Crossref, Web of Science, Google Scholar
T. Bu and D. Towsley , On Distinguishing between Internet Power Law Topology Generators , Proc. INFOCOM 2002 . Google Scholar
A. Crespo and H. Garcia-Molina , Routing Indices For Peer-to-Peer Systems , Proc. Intl. Conf. Distributed Computing Systems, IEEE ICDCS 2002 . Google Scholar
M. Faloutsos, P. Faloutsos and C. Faloutsos, On Power-Law Relationships of the Internet Topology, Proc. Conf. Applications, Technologies, Architecture and Protocols for Computer Communications, ed. L. Chapin (ACM, 1999) pp. 251–262. Google Scholar
Freenet (2002), http://freenetproject.org/cgi-bin/twiki/view/Main/WebHome . Google Scholar
Gnutella (2001), http://gnutella.wego.com . Google Scholar
T. Hong , Peer-to-Peer: Harnessing the Power of Disruptive Technologies , ed. A. Oram ( O'Reilly & Associates , Sebastopol, CA , 2001 ) . Google Scholar
M. A. Jovanovic , F. S. Anexstein and K. A. Berman , Modeling Peer-to-Peer Network Topologies through 'Small-World' Models and Power Laws , Proc. IX. Telecommunications Forum TELFOR 2001 ( 2001 ) . Google Scholar
J. Kubiatowitz et al. , Oceanstore: An Architecture for Global-scale Persistent Storage , Proc. ASPLOS 2002 . Google Scholar
Kung, H. T., Wu, C. H., "Content Networks: Taxonomy and New Approaches", The Internet as a Large-scale Complex System, Kihong Park and Walter Willinger (eds.), to be published in Oxford University Press, Santa Fe Institute Series . Google Scholar
Q. Lv et al. , Search and Replication in Unstructured Peer-to-Peer Networks , Proc. 16th ACM Intl. Conf. Supercomputing, ICS 2002 . Google Scholar
Napster (2001), http://www.napster.com . Google Scholar
A. Oram (ed.) , Peer-to-Peer: Harnessing the Power of Disruptive Technologies ( O'Reilly & Associates , Sebastopol, CA , 2001 ) . Google Scholar
M. Portmann and A. Seneviratne, Computer Communications 26, 1159 (2002). Crossref, Web of Science, Google Scholar
S. Ratnasamy et al. , A Scalable Content-addressable Network , ACM SIGCOMM . Google Scholar
Rohrs, C, "Query Routing for the Gnutella Network", Lime Wire LLC, May 16, 2002, http://www.limewire.com/developer/queryrouting/keyword%20routing.htm . Google Scholar
A. Rowstron and P. Druschel , Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-peer Systems , Proc. Middleware ( 2001 ) . Google Scholar
N. Shiode and M. Batty , Power Law Distributions in Real and Virtual Worlds , Proc. ISOC 2002 . Google Scholar
Sripanidkulchai, K., "The popularity of Gnutella queries and its implications on scalability", available at http://www-2.cs.cmu.edu/kunwadee/research/p2p/gnutella.html . Google Scholar
D. J. Watts and S. H. Strogatz, Nature 393, 440 (1998), DOI: 10.1038/30918. Crossref, Web of Science, Google Scholar
B. Yang and H. Garcia-Molina , Comparing Hybrid Peer-to-Peer Systems , Proc. Very Large Databases VLDB'01 ( 2001 ) . Google Scholar
Yang, B., Garcia-Molina, H., "Efficient Search in Peer-to-peer Networks", Technical Report 2001-47, Stanford University, http://www.db-pubs.stanford.edu . Google Scholar