Characterizing selfishly constructed overlay routing networks

@inproceedings{citeulike:2662645, abstract = {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.}, author = {Chun, Byung-Gon and Fonseca, R. and Stoica, I. and Kubiatowicz, J. }, booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies}, citeulike-article-id = {2662645}, journal = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies}, keywords = {networks, overlay, routing, selfish}, pages = {1329--1339 vol.2}, posted-at = {2008-04-13 03:12:50}, priority = {0}, title = {Characterizing selfishly constructed overlay routing networks}, url = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1357018}, volume = {2}, year = {2004} }

TY - CONF ID - citeulike:2662645 L3 - citeulike-article-id:2662645 TI - Characterizing selfishly constructed overlay routing networks T2 - INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies JF - INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies VL - 2 SP - 1329 EP - 1339 vol.2 N2 - 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. KW - networks KW - overlay KW - routing KW - selfish AU - Chun, Byung-Gon AU - Fonseca, R AU - Stoica, I AU - Kubiatowicz, J PY - 2004/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1357018 ER -