Skip to main content
SpringerLink
Log in

A traffic-efficient message forwarding approach in unstructured P2P networks

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

With more and more peer-to-peer (P2P) applications being utilized, the P2P traffic accounts for the majority in Internet, and thus leading to the network congestion problem. Reducing the redundant propagations of messages is an effective approach for solving such problem in unstructured P2P networks. In this paper, we first define a novel message structure which contains the information of message propagation path, and then three operations, including the inheritance, supplement and collection, on the message transmission paths are proposed, based on which a node could forward the message to the nodes who have not received the message yet purposefully by using the information of the past received messages and the characteristics of space and time of node activities, and thus eliminating the bandwidth consumption problem caused by the flooding-based message propagation approaches. The simulation results show that our strategy could effectively reduce the number of the redundant messages without lowering the message coverage ratio.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Rosas E, Hidalgo N, Marin N, Gil-Costa V (2014) Web search results caching service for structured P2P networks. Futur Gener Comput Syst 30(1):254–264

    Article  Google Scholar 

  2. Xianfu Meng, Xiaoling Chen, Yalin Ding. Using the complementary nature of node joining and leaving to handle churn problem in P2P networks. Comput Electr Eng 39(2):326–337

  3. Ratnasamy S, Francis P, Handley M (2001) A scalable content-addressable network. ACM SIGCOMM 01, San Diego, pp 161–172

    Google Scholar 

  4. Gnutella[EB/OL]. http://zh.wikipedia.org/zh-hans/Gnutella

  5. KazaA[EB/OL]. http://www.kazaa.com

  6. Gkantsidis C, Mihail M, Saberi A (2004) Random walks in peer-to-peer networks. IEEE Infocom, Hong Kong

    Book  Google Scholar 

  7. Lin T, Wang H, Wang J (2004) Search performance analysis and robust search algorithm in unstructured peer-to-peer networks. GP2PC

  8. Kalogeraki V, Gunopulos D, Zeinalipour-Yazti D (2002) A local search mechanism for peer-to-peer networks. In CIKM

  9. Li M, Lee W-C, Sivasubramaniam SSW (2008) A small-world-based overlay for peer-to-peer search. IEEE Trans Parallel Distrib Syst 19(6):735–749

    Article  Google Scholar 

  10. Sozio M, Neumann T, Weikum G (2008) Near-optimal dynamic replication in unstructured peer-to-peer networks. Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. Vancouver, BC, Canada

  11. Hsiao H-C, Hong-Wei S (2012) On optimizing overlay topologies for search in unstructured peer-to-peer networks [J]. IEEE Trans Parallel Distrib Syst 23(5):924–935

    Article  Google Scholar 

  12. Cooper B (2005) An optimal overlay topology for routing peer-to-peer searches. Proceedings of the 6th Int’l middleware 2005. Springer-Verlag, Berlin, Heidelberg pp 82–101

  13. Xie K, Zhang D-F, Xie G-G, Wen J-G (2007) A trace label based consistency maintenance algorithm in unstructured P2P systems. J Softw 18(1):105–116

    Article  MATH  Google Scholar 

  14. Hsu C, Hsu G, Chen S, Chen T (2009) Message transmission techniques for low traffic P2P services. Int J Commun Syst 22:1105–1122

    Article  MathSciNet  Google Scholar 

  15. Shioda S, Ohtsuka K, Sato T (2008) An efficient network-wide broadcasting based on hop-limited shortest-path trees. Comput Netw 52(1):3284–3295

    Article  MATH  Google Scholar 

  16. Andreolini M, Lancellotti R (2009) A flexible and robust lookup algorithm for P2P systems. Proceedings of 14th IEEE Workshop on Dependable Parallel, Distributed and Network-Centric Systems. Rome, Italy

  17. Ghamri-Doudane S, Agoulmine N (2007) Enhanced DHT-based P2P architecture for effective resource discovery and management. J Netw Syst Manag 15(3):335–354

    Article  Google Scholar 

  18. Meng XF, Wang YL, Ding YL (2012) An optimized strategy for update path selection in unstructured P2P networks. Comput Netw 56(17):3744–3755

    Article  Google Scholar 

  19. Sen S, Wang J (2004) Analyzing peer-to-peer traffic across large networks. IEEE/ACM Trans Networking 12(2):219–232

    Article  Google Scholar 

  20. Klemm A, Lindemann C, Vernon M (2004) Characterizing the query behavior in peer-to-peer file sharing systems. Proceedings of ACM Internet Measurement Conference (IMC). ACM, New York

  21. Handurukande S, Kermarrec A, Fessant F (2006) Peer sharing behavior in the eDonkey network, and implications for the design of server-less file sharing systems. Proceedings of the ACM SIGOPS EuroSys Conference. ACM, New York

  22. Tewari S, Kleinrock L (2007) Optimal search performance in unstructured peer-to-peer networks with clustered demands. IEEE J Sel Areas Commun 25(1):84–95

    Article  Google Scholar 

  23. Plissonneau L, Costeux J, Brown P (2005) Analysis of peer-to-peer traffic on ADSL. In: Dovrolis C (ed) Proc. of the PAM 2005. LNCS 3431. Springer-Verlag, Heidelberg, pp 69–82

  24. Saroiu S, Gummadi PK, Gribble SD (2002) A measurement study of peer-to-peer file sharing systems. In: Proceedings of Multimedia Conferencing and Networking. Springer-Verlag, San Jose, pp 18–25

  25. Gummadi KP, Dunn RJ, Saroiu S, et a1 (2003) Measurement, modeling, and analysis of a peer-to-peer file-sharing work load. In: Proceedings of ACM SOSP Network. USA, 314–329

  26. Liu G, Hu MZ, Fang BX, et al (2004) Explaining BitTorrent traffic self-similarity. In: Proceedings of the PDCAT 2004. Heidelberg, Springer-Verlag, pp 839–843

  27. Gao Q, Yang Z, Tian J et al (2007) A hierarchically differential P2P storage architecture. J Softw 18(10):2481–2494

    Article  Google Scholar 

  28. Liu HY, Xiao MZ, Dai YF et al (2006) Impact of availability in P2P file sharing system caused by active peers. J Softw 17(10):2087–2095

    Article  MATH  Google Scholar 

  29. Rafael P, Pedro B, Otto C (2011) A generalized bloom filter to secure distributed network applications. Comput Netw 55(8):1804–1819

    Article  Google Scholar 

  30. Peersim [EB/OL]. http://peersim.sourceforge.net/

  31. Xiong W, Xie D, Jiao B, Liu J (2009) Self-adaptive load balancing method in structured P2P protocol. J Softw 20(3):660–670

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Dalian University of Technology, No. 2, Linggong Road, Dalian, 116024, China

    Xianfu Meng & Dongxu Liu

Authors
  1. Xianfu Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dongxu Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xianfu Meng.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Meng, X., Liu, D. A traffic-efficient message forwarding approach in unstructured P2P networks. Peer-to-Peer Netw. Appl. 9, 255–265 (2016). https://doi.org/10.1007/s12083-015-0326-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-015-0326-2

Keywords

Search

Navigation