Skip to main content
Top
Published in: Peer-to-Peer Networking and Applications 2/2011

01-06-2011

Ad-hoc limited scale-free models for unstructured peer-to-peer networks

Authors: Durgesh Rani Kumari, Hasan Guclu, Murat Yuksel

Published in: Peer-to-Peer Networking and Applications | Issue 2/2011

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the churn caused by the ad-hoc nodes joining or leaving the network. Preserving the structure becomes more prohibitive due to the distributed and potentially uncooperative nature of such networks, as in the peer-to-peer (P2P) networks. Thus, most practical solutions involve unstructured approaches while attempting to maintain the structure at various levels of protocol stack. The primary focus of this paper is to investigate construction and maintenance of scale-free topologies in a distributed manner without requiring global topology information at the time when nodes join or leave. We consider the uncooperative behavior of peers by limiting the number of neighbors to a pre-defined hard cutoff value (i.e., no peer is a major hub), and the ad-hoc behavior of peers by rewiring the neighbors of nodes leaving the network. We also investigate the effect of these hard cutoffs and rewiring of ad-hoc nodes on the P2P search efficiency.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Albert R, Barabási A-L (2000) Topology of evolving networks: local events and universality. Phys Rev Lett 85:5234CrossRef Albert R, Barabási A-L (2000) Topology of evolving networks: local events and universality. Phys Rev Lett 85:5234CrossRef
2.
go back to reference Albert R, Jeong H, Barabási A-L (1999) Diameter of the World Wide Web. Nature 401:130CrossRef Albert R, Jeong H, Barabási A-L (1999) Diameter of the World Wide Web. Nature 401:130CrossRef
3.
go back to reference Albert R, Jeong H, Barabási A-L (2000) Error and attack tolerance of complex networks. Nature 406:378CrossRef Albert R, Jeong H, Barabási A-L (2000) Error and attack tolerance of complex networks. Nature 406:378CrossRef
4.
go back to reference Albert R, Jeong H, Barabási A-L (2000) Error and attack tolerance of complex networks (correction). Nature 409:542CrossRef Albert R, Jeong H, Barabási A-L (2000) Error and attack tolerance of complex networks (correction). Nature 409:542CrossRef
6.
go back to reference Barabási A-L, Jeong H, Neda Z, Ravasz E, Schubert A, Vicsek T (2002) Evolution of the social network of scientific collaborations. Physica A 311:590CrossRefMATHMathSciNet Barabási A-L, Jeong H, Neda Z, Ravasz E, Schubert A, Vicsek T (2002) Evolution of the social network of scientific collaborations. Physica A 311:590CrossRefMATHMathSciNet
7.
go back to reference Boguná M, Pastor-Satorras R, Vespignani A (2004) Cut-offs and finite size effects in scale free networks. Eur Phys J B 38:205CrossRef Boguná M, Pastor-Satorras R, Vespignani A (2004) Cut-offs and finite size effects in scale free networks. Eur Phys J B 38:205CrossRef
8.
go back to reference Chawathe Y, Ratnasamy S, Breslau L, Lanham N, Shenker S (2003) Making Gnutella-like systems scalable. In: Proceedings of ACM SIGCOMM Chawathe Y, Ratnasamy S, Breslau L, Lanham N, Shenker S (2003) Making Gnutella-like systems scalable. In: Proceedings of ACM SIGCOMM
9.
go back to reference Cohen E, Fiat A, Kaplan H (2003) Associative search in peer-to-peer networks: harnessing latent semantics. In: Proceedings of conference on computer communications (INFOCOM) Cohen E, Fiat A, Kaplan H (2003) Associative search in peer-to-peer networks: harnessing latent semantics. In: Proceedings of conference on computer communications (INFOCOM)
10.
go back to reference Cohen E, Shenker S (2002) Replication strategies in unstructured peer-to-peer networks. In: Proceedings of ACM SIGCOMM Cohen E, Shenker S (2002) Replication strategies in unstructured peer-to-peer networks. In: Proceedings of ACM SIGCOMM
11.
go back to reference Cohen R, Havlin S (2003) Scale-free networks are ultrasmall. Phys Rev Lett 90:058701CrossRef Cohen R, Havlin S (2003) Scale-free networks are ultrasmall. Phys Rev Lett 90:058701CrossRef
12.
go back to reference Dorogovtsev S, Mendes J (2000) Scaling behavior of developing and decaying networks. Europhys Lett 52:33–39CrossRef Dorogovtsev S, Mendes J (2000) Scaling behavior of developing and decaying networks. Europhys Lett 52:33–39CrossRef
13.
14.
go back to reference Dorogovtsev S, Mendes J, Samukhin A (2001) Anomalous percolation properties of growing networks. Phys Rev E 64:066110CrossRef Dorogovtsev S, Mendes J, Samukhin A (2001) Anomalous percolation properties of growing networks. Phys Rev E 64:066110CrossRef
15.
go back to reference Doyle JC, Alderson DL, Li L, Low S, Roughan M, Shalunov S, Tanaka R, Willinger W (2005) The ‘robust yet fragile’ nature of the Internet. Proc Natl Acad Sci 102:14497CrossRef Doyle JC, Alderson DL, Li L, Low S, Roughan M, Shalunov S, Tanaka R, Willinger W (2005) The ‘robust yet fragile’ nature of the Internet. Proc Natl Acad Sci 102:14497CrossRef
16.
go back to reference Ebel H, Mielsch M-I, Bornholdt S (2002) Scale-free topology of e-mail networks. Phys Rev E 66:035103(R)CrossRef Ebel H, Mielsch M-I, Bornholdt S (2002) Scale-free topology of e-mail networks. Phys Rev E 66:035103(R)CrossRef
17.
go back to reference Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the Internet topology. ACM Comput Commun Rev 29:251CrossRef Faloutsos M, Faloutsos P, Faloutsos C (1999) On power-law relationships of the Internet topology. ACM Comput Commun Rev 29:251CrossRef
18.
go back to reference Garbacki P, Epema DHJ, van Steen M (2007) Optimizing peer relationships in a super-peer network. In: Proceedings of IEEE international conference on distributed computing systems (ICDCS) Garbacki P, Epema DHJ, van Steen M (2007) Optimizing peer relationships in a super-peer network. In: Proceedings of IEEE international conference on distributed computing systems (ICDCS)
19.
go back to reference Gkantsidis C, Mihail M, Saberi A (2003) Random walks in peer-to-peer networks. In: Proceedings of conference on computer communications (INFOCOM) Gkantsidis C, Mihail M, Saberi A (2003) Random walks in peer-to-peer networks. In: Proceedings of conference on computer communications (INFOCOM)
20.
go back to reference Gkantsidis C, Mihail M, Saberi A (2005) Hybrid search schemes for unstructured peer-to-peer networks. In: Proceedings of conference on computer communications (INFOCOM) Gkantsidis C, Mihail M, Saberi A (2005) Hybrid search schemes for unstructured peer-to-peer networks. In: Proceedings of conference on computer communications (INFOCOM)
21.
go back to reference Graham RL, Knuth DE, Patashnik O (1994) Concrete mathematics: a foundation for computer science, 2nd edn. Addison-Wesley, ReadingMATH Graham RL, Knuth DE, Patashnik O (1994) Concrete mathematics: a foundation for computer science, 2nd edn. Addison-Wesley, ReadingMATH
22.
23.
go back to reference Guclu H, Korniss G, Toroczkai Z (2007) Extreme fluctuations in noisy task-completion landscapes on scale-free networks. Chaos 17:026104CrossRef Guclu H, Korniss G, Toroczkai Z (2007) Extreme fluctuations in noisy task-completion landscapes on scale-free networks. Chaos 17:026104CrossRef
24.
go back to reference Guclu H, Yuksel M (2007) Scale-free overlay topologies with hard cutoffs for unstructured peer-to-peer networks. In: Proceedings of IEEE ICDCS Guclu H, Yuksel M (2007) Scale-free overlay topologies with hard cutoffs for unstructured peer-to-peer networks. In: Proceedings of IEEE ICDCS
25.
go back to reference Hui K, Lui J, Yau D (2006) Small-world overlay p2p networks: Constructing and handling of dynamic flash crowd. Comput Networks 50:2727CrossRefMATH Hui K, Lui J, Yau D (2006) Small-world overlay p2p networks: Constructing and handling of dynamic flash crowd. Comput Networks 50:2727CrossRefMATH
26.
go back to reference Iamnitchi A, Ripeanu M, Foster I (2004) Small-world file-sharing communities. In: Proceedings of conference on computer communications (INFOCOM) Iamnitchi A, Ripeanu M, Foster I (2004) Small-world file-sharing communities. In: Proceedings of conference on computer communications (INFOCOM)
28.
go back to reference Korniss G (2007) Synchronization in weighted uncorrelated complex networks in a noisy environment: optimization and connections with transport efficiency. Phys Rev E 75:051121CrossRef Korniss G (2007) Synchronization in weighted uncorrelated complex networks in a noisy environment: optimization and connections with transport efficiency. Phys Rev E 75:051121CrossRef
29.
go back to reference Krapivsky P, Redner S (2001) Organization of growing random networks. Phys Rev E 63:066123CrossRef Krapivsky P, Redner S (2001) Organization of growing random networks. Phys Rev E 63:066123CrossRef
30.
go back to reference Krapivsky P, Redner S (2002) A statistical physics perspective on web growth. Comput Networks 39:261CrossRef Krapivsky P, Redner S (2002) A statistical physics perspective on web growth. Comput Networks 39:261CrossRef
31.
go back to reference Kumar A, Xu J, Zegura EW (2005) Efficient and scalable query routing for unstructured peer-to-peer networks. In: Proceedings of conference on computer communications (INFOCOM) Kumar A, Xu J, Zegura EW (2005) Efficient and scalable query routing for unstructured peer-to-peer networks. In: Proceedings of conference on computer communications (INFOCOM)
32.
go back to reference Merugu S, Srinivasan S, Zegura E (2005) Adding structure to unstructured peer-to-peer networks: the use of small-world graphs. J Parallel Distrib Comput 65:142CrossRefMATH Merugu S, Srinivasan S, Zegura E (2005) Adding structure to unstructured peer-to-peer networks: the use of small-world graphs. J Parallel Distrib Comput 65:142CrossRefMATH
33.
go back to reference Sarshar N, Roychowdhury V (2004) Scale-free and stable structures in complex ad hoc networks. Phys Rev E 69: 026101CrossRef Sarshar N, Roychowdhury V (2004) Scale-free and stable structures in complex ad hoc networks. Phys Rev E 69: 026101CrossRef
34.
go back to reference Sripanidkulchai K, Maggs B, Zhang H (2003) Efficient content location using interest-based locality in peer-to-peer systems. In: Proceedings of conference on computer communications (INFOCOM) Sripanidkulchai K, Maggs B, Zhang H (2003) Efficient content location using interest-based locality in peer-to-peer systems. In: Proceedings of conference on computer communications (INFOCOM)
35.
go back to reference Stoica I, Morris R, Karger D, Kaashoek H, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of ACM SIGCOMM Stoica I, Morris R, Karger D, Kaashoek H, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of ACM SIGCOMM
36.
go back to reference Toroczkai Z, Bassler K (2004) Jamming is limited in scale-free systems. Nature 428:716CrossRef Toroczkai Z, Bassler K (2004) Jamming is limited in scale-free systems. Nature 428:716CrossRef
37.
go back to reference Watts D, Strogatz S (1998) Collective dynamics of ‘small-world’ networks. Nature 393:440CrossRef Watts D, Strogatz S (1998) Collective dynamics of ‘small-world’ networks. Nature 393:440CrossRef
38.
go back to reference Xu J (2003) On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. In: Proceedings of conference on computer communications (INFOCOM) Xu J (2003) On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. In: Proceedings of conference on computer communications (INFOCOM)
39.
go back to reference Yao Z, Wang X, Leonard D, Loguinov D (2007) On node isolation under churn in unstructured p2p networks with heavy-tailed lifetimes. In: Proceedings of IEEE international conference on computer communication Yao Z, Wang X, Leonard D, Loguinov D (2007) On node isolation under churn in unstructured p2p networks with heavy-tailed lifetimes. In: Proceedings of IEEE international conference on computer communication
40.
go back to reference Zhang H, Goel A, Govindan R (2002) Using the small-world model improve Freenet performance. In: Proceedings of conference on computer communications (INFOCOM) Zhang H, Goel A, Govindan R (2002) Using the small-world model improve Freenet performance. In: Proceedings of conference on computer communications (INFOCOM)
Metadata
Title
Ad-hoc limited scale-free models for unstructured peer-to-peer networks
Authors
Durgesh Rani Kumari
Hasan Guclu
Murat Yuksel
Publication date
01-06-2011
Publisher
Springer US
Published in
Peer-to-Peer Networking and Applications / Issue 2/2011
Print ISSN: 1936-6442
Electronic ISSN: 1936-6450
DOI
https://doi.org/10.1007/s12083-010-0067-1

Other articles of this Issue 2/2011

Peer-to-Peer Networking and Applications 2/2011 Go to the issue

Premium Partner