András Gulyás
Abstract
Greedy navigability is a central issue in the theory of networks. However, the exogenous nature of network models do not allow for describing how greedy routable-networks emerge in reality. In turn, network formation games focus on the very emergence proess, but the applied shortest-path based cost functions exclude navigational aspects. This paper takes a frst step towards incorporating both emergence (missing in algorithmic network models) and greedy navigability (missing in network formation games) into a single framework, and proposes the Greedy Network Formation Game. Our first contribution is the game definition, where we assume a hidden metric space underneath the network, and, instead of usual shortest path metric, we use the length of greedy paths as the measure of communiation cost between players. Our main finding is that greedy-routable small worlds do not emerge on constant dimensional Eulidean grids. This simply means that the emergence of topologies on which w eunderstood the priniples of greedy forwarding cannot be explained endogenously. We also present a very brief outlook on how the situation hanges in the hyperbolic space.
- J. Kleinberg. The small-world phenomenon: analgorithm perspetive. In Proc. of STOC'00, pages 163--170,2 000. Google Scholar
Digital Library
- J. Kleinberg. Complex networks and decentralized search algorithms. In Proc. of ICM, volume 3, 2006.Google Scholar
- D. Krioukovet. al. Hyperbolic geometry of complex networks. Physical Review E, 82 (3): 036106, 2010.Google ScholarCross Ref
- R. Kleinberg. Geographic routing using hyperbolic space. In Proc. of INFOCOM 2007, pages 1902--1909. Ieee, 2007.Google ScholarDigital Library
- A. Gulyás, A. Körösi, D. Szabó, and G. Biczók. On greedy network formation. Technical report, http://qosip.tmit.bme.hul/~gulyas/personal_page/gg.pdf, 2011.Google Scholar
- Cyril Gavoille and Stephane Perennes. Memory requirement for routing in distributed networks. Proc. of PODC'96, pages 125--133, 1996. Google ScholarDigital Library
- Mm Boguñá and D. Krioukov. Navigating ultrasmall worlds in ultrashort time. Phys. Rev. Lett.,102 (5): 058701, Feb 2009.Google ScholarCross Ref
- E. Even-Darand, M. Kearns. A small world threshold for eonomic network formation. In Advanes in Neural Information Processing Systems, page 385, 2007.Google Scholar
- J. Traversand, S. Milgram. An experimental study of the small world problem. Sociometry, 32: 425--443, 1969.Google ScholarCross Ref
- J.M. Kleinberg. Navigation in a small world. Nature, 406 (6798): 845--845, 2000.Google ScholarCross Ref
- D.J. Watts, P.S. Dodds, and M.E.J. Newman. Identity and search in social networks. Science, 296 (5571): 1302, 2002.Google ScholarCross Ref
- M. Boguna, F. Papadopoulos, and D. Krioukov. Sustaining the internet with hyperbolic mapping. Nature Communiations, 1(6):1--8, 2010.Google ScholarCross Ref
- S. Ratnasamyet. al. A scalable content-addressable network. In Proc. of SIGCOMM'01, pages 161--172, 2001. Google ScholarDigital Library
- I. Stoiaet. al. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. of SIGCOMM'01, San Diego, California, August 2001. Google ScholarDigital Library
- C. Guo et. al. Bcube: a high performance, server-centric network architecture for modular data enters. ACM SIGCOMM CCR, 39 (4): 63--74, 2009. Google ScholarDigital Library
- A. Fabrikantet. al. On a network creation game. In Proc. of PODC'03, pages 347--351, 2003. Google ScholarDigital Library
- J. Corboand D. Parkes.The price of selfish behavior in bilateral network formation. In PODC'05, pages 99--107, 2005. Google ScholarDigital Library
- Erik D. Demaineet. al. The price of anarchy in network creation games. In Proc. of PODC'07, pages 292--298, 2007. Google ScholarDigital Library
Index Terms
- On greedy network formation
Recommendations
Greedy versus recursive greedy: Uncorrelated heuristics for the binary paint shop problem
AbstractIt is well-known that there are instances of the binary paint shop problem for which the recursive greedy heuristic is better than the greedy heuristic. In this note, we give an example of a family of instances where the greedy ...
Greedy by Chance - Stochastic Greedy Algorithms
ICAS '10: Proceedings of the 2010 Sixth International Conference on Autonomic and Autonomous SystemsFor many complex combinatorial optimization problems, obtaining good solutions quickly is of value either by itself or as part of an exact algorithm. Greedy algorithms to obtain such solutions are known for many problems. In this paper we present ...
Randomized greedy algorithms for covering problems
GECCO '18: Proceedings of the Genetic and Evolutionary Computation ConferenceGreedy algorithms provide a fast and often also effective solution to many combinatorial optimization problems. However, it is well known that they sometimes lead to low quality solutions on certain instances. In this paper, we explore the use of ...
Comments