Characterizing selfishly constructed overlay routing networks

We analyze the characteristics of overlay routing networks generated by selfish nodes playing competitive network construction games. We explore several networking scenarios - some simplistic, others more realistic - and analyze the resulting Nash equilibrium graphs with respect to topology, performance, and resilience. We find a fundamental tradeoff between performance and resilience, and show that limiting the degree of nodes is of great importance in controlling this balance. Further, by varying the cost function, the game produces widely different topologies; one parameter in particular - the relative cost between maintaining an overlay link and increasing the path length to other nodes - can generate topologies with node-degree distributions whose tails vary from exponential to power-law. We conclude that competitive games can create overlay routing networks satisfying very diverse goals.

[1]  Hans Jürgen Prömel,et al.  The Steiner Tree Problem , 2002 .

[2]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[3]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[4]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[5]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[6]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[7]  Scott Shenker,et al.  On a network creation game , 2003, PODC '03.

[8]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[9]  David M. Pennock,et al.  Static and dynamic analysis of the Internet's susceptibility to faults and attacks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[10]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[11]  Robert Tappan Morris,et al.  Resilient overlay networks , 2001, SOSP.

[12]  Christos H. Papadimitriou,et al.  Algorithms, games, and the internet , 2001, STOC '01.

[13]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM 2001.

[14]  Eric Brewer,et al.  Scattercast: an architecture for internet broadcast distribution as an infrastructure service , 2000 .

[15]  Joan Feigenbaum,et al.  Distributed algorithmic mechanism design: recent results and future directions , 2002, DIALM '02.

[16]  Hui Zhang,et al.  A case for end system multicast (keynote address) , 2000, SIGMETRICS '00.

[17]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[18]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.