Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the twenty-second annual symposium on Principles of distributed computing
The price of selfish behavior in bilateral network formation
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The price of anarchy in network creation games
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
BCube: a high performance, server-centric network architecture for modular data centers
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Greedy selfish network creation
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
| Hi-index | 0.00 |
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.