Abstract
Resource location in unstructured P2P systems is mainly performed by having each node forward each incoming query message to all of its neighbors, a process called flooding. Although this algorithm has excellent response time and is very simple to implement, it creates a large volume of unnecessary traffic in today’s Internet because each node may receive the same query several times through different paths. We propose an innovative technique, the feedback-based approach that aims to improve the scalability of flooding. The main idea behind our algorithm is to monitor the ratio of duplicate messages transmitted over each network connection, and not forward query messages over connections whose ratio exceeds some threshold. Through extensive simulation we show that this algorithm exhibits significant reduction of traffic in random and small-world graphs, the two most common types of graph that have been studied in the context of P2P systems, while conserving network coverage.
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
Y. Chawathe, S. Ratnasamy, and L. Breslau. Making Gnutella-like P2P Systems Scalable. ACM SIGCOMM, 2003.
A. Crespo and H. Garcia-Molina. Routing Indices for Peer-to-Peer Systems. Int. Conf. Distributed Comp. Systems, 2002.
A. Crespo and H. Garcia-Molina. Semantic Overlay Networks for P2P Systems. 2002.
Duncan, J. Watts, and S. H. Strongatz. Collective Dynamics of Small-world Networks. Nature, 393:440–442, 1998.
C. Gkantsidis, M. Mihail, and A. Saberi. Hybrid Search Schemes for Unstructured Peer-to-Peer Networks. IEEE INFOCOM, 2005.
Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and Replication in Unstructured Peer-to-Peer Networks. Int. ACM Conf. Supercomputing, 2002.
R. Manfredi and T. Klingberg. Gnutella 0.6 Specification, http://rfc-gnutella.sourceforge.net/src/rfc-0_6-draft.html
M. Ripenau, I. Foster, A. Iamnitchi, and A. Rogers. UMM: A Dynamically Adaptive, Unstructured, Multicast Overlay. In Service Management and Self-Organization in IP-based Networks, Dagstuhl Seminar Proceedings, 2005.
Sharman Industries. Kazaa, http://www.kazaa.com
K. Sripanidkulchai, B. Maggs, and H. Zhang. Efficient Content Location using Interest-Based Locality in Peer-to-Peer Systems. IEEE INFOCOM, 2003.
D. Tsoumakos and N. Roussopoulos. A Comparison of Peer-to-Peer Search Methods. Int. Workshop on the Web and Databases, 2003.
Z. Zhuang, Y. Liu, L. Xiao, and L.M. Ni. Hybrid Periodical Flooding in Unstructured Peer-to-Peer Networks. Int.l Conf. Parallel Computing, 2003.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Papadakis, C., Fragopoulou, P., Markatos, E.P., Athanasopoulos, E., Dikaiakos, M., Labrinidis, A. (2007). A Feedback-Based Approach to Reduce Duplicate Messages in Unstructured Peer-To-Peer Networks. In: Gorlatch, S., Danelutto, M. (eds) Integrated Research in GRID Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-47658-2_8
Download citation
DOI: https://doi.org/10.1007/978-0-387-47658-2_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-47656-8
Online ISBN: 978-0-387-47658-2
eBook Packages: Computer ScienceComputer Science (R0)