Skip to main content
SpringerLink
Log in

Sparse structures for searching and broadcasting algorithms over internet graphs and peer-to-peer computing systems

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

Abstract

In a broadcasting problem, a message is sent from a source to all the other nodes in the network. Blind flooding is a classical mechanism for broadcasting, where each node retransmits received message to all its neighbors. Despite its important advantages, an increase in the number of requests or the network size or density produces communication overheads that limit the scalability of blind flooding, especially in networks with dynamic topologies. Theoretically optimal solution is based on minimal spanning trees (MST), but its construction is expensive. We discuss here protocols based on local knowledge and newly proposed sparse structures. In weighted RNG (Relative Neighborhood Graph), messages are forwarded only on links which are not the ‘longest’ in any triangle. In weighted RNGQ, messages are forwarded to links which are not the longest in any triangle or quadrangle. Each node constructs weighted MST based on its 2-hop knowledge. Weighted LMST (Localized LMST) preserves only edges that are selected by both endpoints, and messages are forwarded on these links. Any available metric, such as delay, reliability, reputation etc. can be used as weight. Analysis and simulation show that weighted RNG performs better than existing Flooding and Rumor Mongering (or Gossip) schemes. The parameterless weighted LMST, MST, RNG and RNGQ (RNG over Quadrangle) based broadcasting schemes are compared, showing overall advantage for LMST. We also hint that a number of existing protocols can be simplified by applying concept from this article.

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.

Fig. 1

Similar content being viewed by others

References

  1. Moy J, Lindem A, Dube R (2002) OSPF protocol charter, IETF, www.ietf.org/html.charters/ospf-charter.html .

  2. Ganesan P, Sun Q, Garcia-Molina H (2003) YAPPERS: A peer-to-peer lookup service over arbitrary topology. Infocom

  3. Rinaldi R, Waldvogel M (2002) Routing and data location in overlay peer-to-peer networks. Research Report RZ-3433, IBM, July

  4. Liu Y, Xiao L, Liu X, Ni LM, Zhang X (2005) Location awareness in unstructured peer-to-peer systems. IEEE Trans Parallel Distrib Syst 16(2):163–174

    Article  Google Scholar 

  5. Escalante-Mendieta O (2002) Intelligent flooding over the Internet. BSc. Thesis, IIMAS, Universidad Nacional Autónoma de México, October

  6. Escalante O, Perez T, Solano J, Stojmenovic I (2005) RNG-based searching and sorting over Internet grapas and peer-to-peer computing systems, 3rd ACS/IEEE Int Conf on Computer Systems and Applications, Cairo, Egypt, Jan. 3–6

  7. Perez T, Solano-Gonzalez J, Stojmenovic I (2007) LMST-based searching and broadcasting algorithms over Internet graphs and peer-to-peer computing systems. IEEE International Conference on Signal Processing and Communications (ICSPC 2007), Dubai, United Arab Emirates (UAE), 24–27, 1227–1230. November

  8. Perez T (2005) Searching and broadcasting in peer-to-peer and Internet systems. Master thesis, IIMAS, Universidad Nacional Autónoma de México

  9. Albert R, Barabási A (2002) Statistical mechanics of complex networks. Rev Mod Phys 74:47–97

    Article  Google Scholar 

  10. Barabási A, Albert R (1999) Emerge of scaling in random networks. Science 286:509–512

    Article  MathSciNet  Google Scholar 

  11. Faloutsos M, Faloutsos P, Faloutsos C (1999), On power-law relationships of the internet topology. SIGCOMM 251–262

  12. Magoni D, Pansiot J-J (2002) Internet topology modeler based on map sampling, in ISCC’02—7th IEEE Symposium on Computers and Communications, Giardini Naxos, Italy, July, 1021–1027

  13. Medina A, Lakhina A, Matta I, Byers J (2001) BRITE: Universal topology generation from a user’s perspective, Tech. Rep. 2001-003, NEC, 1

  14. Palmer C, Steffan J (2000) Generating network topologies that obey power laws. In EEE GLOBECOM 2000, San Francisco, CA, November

  15. Portmann M, Seneviratne A (2002) The cost of application-level broad-cast in a fully decentralized peer-to-peer network. ISCC 2002, Italy, July

  16. Waxman B (1988) Routing of multipoint connections. IEEE J Sel Areas Commun 6:1617–1622

    Article  Google Scholar 

  17. Jovanovic M, Annexstein FS, Berman KA (2001) Scalability issues in large peer-to-peer networks: A case study of Gnutella. Tech. Rep. University of Cincinnati

  18. Jin Y, Zhang B, Pappas V, Zhang L, Jamin S (2003) DIP: Distance information protocol for IDMaps, IEEE Int Symp on Computers and Communications ISCC, Turkey, July

  19. Francis P, Jamin S, Yin C, Yin Y, Raz D, Shavitt Y, Zhang L (2001) IDMaps: A global internet host distance estimation service. ACM/IEEE Trans. on Networking, Oct

  20. Lin M-J, Marzullo K, Masini S (1999) Gossip versus deterministic flooding: Low message overhead and high reliability for broadcasting on small networks. Technical Report CS1999-0637/ University of California, San Diego, Computer Science & Eng

  21. El-Ansary S, Alima LO, Brand P, Haridi S (2003) Efficient broadcast in structured P2P Networks. IPTPS LNCS 2735:304–314

    Google Scholar 

  22. Li J (2008) On peer-to-peer (P2P) content delivery. Peer-to-Peer Netw Appl 1:45–63

    Article  Google Scholar 

  23. Keong Lua E, Crowcroft J, Pias M, Sharma R, Lim S (2005) A survey and comparison of peer-to-peer overlay network schemes. IEEE Commun Surveys Tut 7(2):72–93, Second Quarter

    Article  Google Scholar 

  24. Liu Y, Liu X, Xiao L, Ni LM, Zhang X (2004) Location-aware topology matching in P2P systems. IEEE INFOCOM

  25. Toussaint G (1980) The relative neighborhood graph of a finite planar set. Pattern Recognit 12:261–268

    Article  MathSciNet  MATH  Google Scholar 

  26. Katajaien J (1988) The region approach for computing relative neighborhood graphs in the lp metric. Computing 40:147–161

    Article  MathSciNet  Google Scholar 

  27. Li N, Hou JC, Sha L (2003) Design and analysis of an MST based topology control algorithm. Proc IEEE INFOCOM

  28. Ovalle-Martinez FJ, Stojmenovic I, Garcia-Nocetti F, Solano-Gonzalez J (2005) Finding minimum transmission radii and constructing minimal spanning trees in ad hoc and sensor networks. J Parallel Distrib Comput 65(2):132–141

    Article  Google Scholar 

  29. Sariou S, Gummadi P, Gribble S (2002) A measurement study of peer-to-peer file sharing systems. Proc Multimedia Computing and Networking MMCN

  30. Jovanovic MA (2000) Modeling large-scale peer-to-peer networks and a case study of Gnutella. Master Thesis, DECE, University of Cincinnati. June

  31. Akon M, Shen X, Naik S, Singh A, Zhang Q (2008) An inexpensive unstructured platform for wireless mobile peer-to-peer networks. Peer-to-Peer Netw Appl 1:75–90

    Article  Google Scholar 

  32. Pogkas I, Kriakov V, Chen Z, Delis A (2009) Adaptive neighborhood selection in peer-to-peer networks based on content similarity and reputation. Peer-to-Peer Netw Appl 2:37–59

    Article  Google Scholar 

  33. Liu L, Xu J, Russell D, Townend P, Webster D (2009) Efficient and scalable search on scale-free P2P networks. Peer-to-Peer Netw Appl 2:98–108

    Article  Google Scholar 

Download references

Acknowledgements

This research is supported by CONACYT project 37017-A and NSERC grants.

Author information

Authors and Affiliations

  1. DISCA, IIMAS, UNAM, Universidad Nacional Autónoma de México, Circuito Escolar s/n, Coyoacán, México, D.F. 04510, Mexico

    Oscar Escalante, Tania Pérez & Julio Solano

  2. SITE, University of Ottawa, Ottawa, ON, K1N 6N5, Canada

    Ivan Stojmenovic

Authors
  1. Oscar Escalante
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tania Pérez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Julio Solano
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ivan Stojmenovic
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Julio Solano or Ivan Stojmenovic.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Escalante, O., Pérez, T., Solano, J. et al. Sparse structures for searching and broadcasting algorithms over internet graphs and peer-to-peer computing systems. Peer-to-Peer Netw. Appl. 4, 219–230 (2011). https://doi.org/10.1007/s12083-010-0077-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-010-0077-z

Keywords

Search

Navigation