Abstract
Built upon overlay topologies, Peer-to-Peer (P2P) networks behave in an ad-hoc way, conduct application-layer routing, enable user-customized decentralized resources sharing, and thus can be taken as an emerging representative of Active Networks. An important problem in current unstructured P2P networks is that, however, existing searching mechanisms do not scale well because they are either based on the idea of flooding the network with queries or because they know very little about the nature of the network topology. In this paper, we propose the Topology-oriented Active Overlay Network (TAON) which is an efficient, scalable yet simple protocol for improving decentralized resources sharing in P2P networks. TAON consists of three novel components: a Desirable Topology Construction and Adaptation algorithm to guide the evolution of the overlay topology towards a small-world-like graph, a Semantic-based Neighbor Selection Scheme to conduct an online neighbor ranking, and a Topology-aware Intelligent Search mechanism to forward incoming queries to deliberately selected neighbors. We deploy and compare TAON with a number of other distributed search techniques over static and dynamic environments, and the results indicate that TAON outperforms its competitors by achieving higher recall rate while using much less network resources, in both of the above environments.
This research work is supported in part by the the National High Technology Research and Development Program of China (863 Program), under Grant No. 2004AA104270.
Chapter PDF
Similar content being viewed by others
References
David, L., David Sincoskie, W., Wetherall, D.J., Minden, G.J.: A Survey of Active Network Research. IEEE Transactions on Communications (1997)
Bawa, M., et al.: Make it fresh, make it quick searching a network of personal webservers. In: Proc. of 12th WWW (2003)
Joseph, S.: Neurogrid: Semantically routing queries in Peer-to-Peer networks. In: Proc. of Intl. Work. P2P Computing (2002)
Pujol, J., Sangüesa, R., Bermúdez, J.: Porqpine: A distributed and collaborative search engine. In: Proc. of 12th WWW (2003)
Watts, D., Strogatz, S.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)
Puniyani, A.R., Lukose, R.M., Huberman, B.A.: Intentional Walks on Scale Free Small Worlds. LANL archive: cond-mat/0107212 (2001)
Baeza-Yates, R.A., Ribeiro-Neto, B.A.: Modern Information Retrieval. ACM Press Series/Addison Wesley, New York (1999)
Zeinalipour-Yazti, D., Kalogeraki, V., Gunopulos, D.: Exploiting locality for scalable information retrieval in peer-to-peer networks. Information Systems 30(4), 277–298 (2005)
Lv, C., et al.: Search and replication in unstructured peer-to-peer networks. In: Proc. of ACM International Conference on Supercomputing (ICS) (June 2002)
Ripeanu, M., Foster, I., Iamnitchi, A.: Mapping the Gnutella Network: Properties of Large Scale Peer-to-Peer Systems and Implications for System Design. IEEE J. on Internet Computing, Special Issue on Peer-to-peer Networking (2002)
Palmer, C.R., Steffan, J.G.: Generating Network Topologies That Obey Powers. In: Proc. of Globecom 2000, San Francisco (November 2000)
Yang, B., Garcia-Molina, H.: Efficient Search in Peer-to-Peer Networks. In: Proc. of Int. Conf. on Distributed Computing Systems (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 IFIP International Federation for Information Processing
About this paper
Cite this paper
Huang, X., Ma, F., Zhang, W. (2009). TAON: A Topology-Oriented Active Overlay Network Protocol. In: Hutchison, D., Denazis, S., Lefevre, L., Minden, G.J. (eds) Active and Programmable Networks. IWAN 2005. Lecture Notes in Computer Science, vol 4388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00972-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-00972-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00971-6
Online ISBN: 978-3-642-00972-3
eBook Packages: Computer ScienceComputer Science (R0)