publication . Article . Preprint . Other literature type . 2017

Collective navigation of complex networks: Participatory greedy routing

Kaj-Kolja Kleineberg; Dirk Helbing;
Open Access English
  • Published: 01 Jun 2017 Journal: Scientific Reports, volume 7 (eissn: 2045-2322, Copyright policy)
  • Publisher: Nature Publishing Group UK
  • Country: Switzerland
Abstract
Many networks are used to transfer information or goods, in other words, they are navigated. The larger the network, the more difficult it is to navigate efficiently. Indeed, information routing in the Internet faces serious scalability problems due to its rapid growth, recently accelerated by the rise of the Internet of Things. Large networks like the Internet can be navigated efficiently if nodes, or agents, actively forward information based on hidden maps underlying these systems. However, in reality most agents will deny to forward messages, which has a cost, and navigation is impossible. Can we design appropriate incentives that lead to participation and g...
Subjects
free text keywords: Article, Physics - Physics and Society, Nonlinear Sciences - Adaptation and Self-Organizing Systems, Physics - Computational Physics, Physics - Data Analysis, Statistics and Probability, Multidisciplinary, lcsh:Medicine, lcsh:R, lcsh:Science, lcsh:Q, Large networks, The Internet, business.industry, business, Probability and statistics, Computer science, Citizen journalism, Scalability, Incentive, Navigability, Complex network, Computer security, computer.software_genre, computer
Related Organizations
Funded by
EC| MOMENTUM
Project
MOMENTUM
Modeling the Emergence of Social Complexity and Order: How Individual and Societal Complexity Co-Evolve
  • Funder: European Commission (EC)
  • Project Code: 324247
  • Funding stream: FP7 | SP2 | ERC
43 references, page 1 of 3

Helbing, D. Globally networked risks and how to respond. Nature. 2013; 497: 51-59 [OpenAIRE] [PubMed] [DOI]

2.Meyer, D., Fall, K. & Zhang, L. The internet architecture board. RFC4984 (2007).

3.The future of the internet and broadband…and how to enable it. Federal Communications Commission (2009).

Godfrey, PB, Ganichev, I, Shenker, S, Stoica, I. Pathlet routing. SIGCOMM Comput. Commun. Rev.. 2009; 39: 111-122 [OpenAIRE] [DOI]

Gammon, K. Networking: Four ways to reinvent the internet. Nature. 2010; 463: 602-604 [OpenAIRE] [PubMed] [DOI]

Helbing, D, Pournaras, E. Society: Build digital democracy. Nature. 2015; 527: 33-34 [OpenAIRE] [PubMed] [DOI]

Contreras, JL, Reichman, JH. Sharing by design: Data and decentralized commons. Science. 2015; 350: 1312-1314 [OpenAIRE] [PubMed] [DOI]

Epstein, R, Robertson, RE. The search engine manipulation effect (seme) and its possible impact on the outcomes of elections. Proceedings of the National Academy of Sciences. 2015; 112: E4512-E4521 [OpenAIRE] [DOI]

Bond, RM. A 61-million-person experiment in social influence and political mobilization. Nature. 2012; 489: 295-8 [OpenAIRE] [PubMed] [DOI]

Krioukov, D, Papadopoulos, F, Kitsak, M, Vahdat, A, Boguñá, M. Hyperbolic geometry of complex networks. Phys. Rev. E. 2010; 82: 036106 [OpenAIRE] [DOI]

Boguñá, M, Papadopoulos, F, Krioukov, D. Sustaining the Internet with hyperbolic mapping. Nature communications. 2010; 1: 62 [OpenAIRE] [PubMed] [DOI]

Papadopoulos, F, Psomas, C, Krioukov, D. Network mapping by replaying hyperbolic growth. IEEE/ACM Transactions on Networking. 2015; 23: 198-211 [OpenAIRE] [DOI]

Papadopoulos, F, Aldecoa, R, Krioukov, D. Network geometry inference using common neighbors. Phys. Rev. E. 2015; 92: 022807 [OpenAIRE] [DOI]

Serrano, MÃ, Krioukov, D, Boguñá, M. Self-Similarity of Complex Networks and Hidden Metric Spaces. Phys. Rev. Lett.. 2008; 100: 078701 [PubMed] [DOI]

Papadopoulos, F, Kitsak, M, Serrano, MÃ, Boguñá, M, Krioukov, D. Popularity versus similarity in growing networks. Nature. 2012; 489: 537-540 [OpenAIRE] [PubMed] [DOI]

43 references, page 1 of 3
Abstract
Many networks are used to transfer information or goods, in other words, they are navigated. The larger the network, the more difficult it is to navigate efficiently. Indeed, information routing in the Internet faces serious scalability problems due to its rapid growth, recently accelerated by the rise of the Internet of Things. Large networks like the Internet can be navigated efficiently if nodes, or agents, actively forward information based on hidden maps underlying these systems. However, in reality most agents will deny to forward messages, which has a cost, and navigation is impossible. Can we design appropriate incentives that lead to participation and g...
Subjects
free text keywords: Article, Physics - Physics and Society, Nonlinear Sciences - Adaptation and Self-Organizing Systems, Physics - Computational Physics, Physics - Data Analysis, Statistics and Probability, Multidisciplinary, lcsh:Medicine, lcsh:R, lcsh:Science, lcsh:Q, Large networks, The Internet, business.industry, business, Probability and statistics, Computer science, Citizen journalism, Scalability, Incentive, Navigability, Complex network, Computer security, computer.software_genre, computer
Related Organizations
Funded by
EC| MOMENTUM
Project
MOMENTUM
Modeling the Emergence of Social Complexity and Order: How Individual and Societal Complexity Co-Evolve
  • Funder: European Commission (EC)
  • Project Code: 324247
  • Funding stream: FP7 | SP2 | ERC
43 references, page 1 of 3

Helbing, D. Globally networked risks and how to respond. Nature. 2013; 497: 51-59 [OpenAIRE] [PubMed] [DOI]

2.Meyer, D., Fall, K. & Zhang, L. The internet architecture board. RFC4984 (2007).

3.The future of the internet and broadband…and how to enable it. Federal Communications Commission (2009).

Godfrey, PB, Ganichev, I, Shenker, S, Stoica, I. Pathlet routing. SIGCOMM Comput. Commun. Rev.. 2009; 39: 111-122 [OpenAIRE] [DOI]

Gammon, K. Networking: Four ways to reinvent the internet. Nature. 2010; 463: 602-604 [OpenAIRE] [PubMed] [DOI]

Helbing, D, Pournaras, E. Society: Build digital democracy. Nature. 2015; 527: 33-34 [OpenAIRE] [PubMed] [DOI]

Contreras, JL, Reichman, JH. Sharing by design: Data and decentralized commons. Science. 2015; 350: 1312-1314 [OpenAIRE] [PubMed] [DOI]

Epstein, R, Robertson, RE. The search engine manipulation effect (seme) and its possible impact on the outcomes of elections. Proceedings of the National Academy of Sciences. 2015; 112: E4512-E4521 [OpenAIRE] [DOI]

Bond, RM. A 61-million-person experiment in social influence and political mobilization. Nature. 2012; 489: 295-8 [OpenAIRE] [PubMed] [DOI]

Krioukov, D, Papadopoulos, F, Kitsak, M, Vahdat, A, Boguñá, M. Hyperbolic geometry of complex networks. Phys. Rev. E. 2010; 82: 036106 [OpenAIRE] [DOI]

Boguñá, M, Papadopoulos, F, Krioukov, D. Sustaining the Internet with hyperbolic mapping. Nature communications. 2010; 1: 62 [OpenAIRE] [PubMed] [DOI]

Papadopoulos, F, Psomas, C, Krioukov, D. Network mapping by replaying hyperbolic growth. IEEE/ACM Transactions on Networking. 2015; 23: 198-211 [OpenAIRE] [DOI]

Papadopoulos, F, Aldecoa, R, Krioukov, D. Network geometry inference using common neighbors. Phys. Rev. E. 2015; 92: 022807 [OpenAIRE] [DOI]

Serrano, MÃ, Krioukov, D, Boguñá, M. Self-Similarity of Complex Networks and Hidden Metric Spaces. Phys. Rev. Lett.. 2008; 100: 078701 [PubMed] [DOI]

Papadopoulos, F, Kitsak, M, Serrano, MÃ, Boguñá, M, Krioukov, D. Popularity versus similarity in growing networks. Nature. 2012; 489: 537-540 [OpenAIRE] [PubMed] [DOI]

43 references, page 1 of 3
Any information missing or wrong?Report an Issue