Implications of selfish neighbor selection in overlay networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 490-498

  Laoutaris, Nikolaos ^a,b   Smaragdakis, Georgios ^a   Bestavros, Azer ^a   Byers, John W ^a  

^a BOSTON UNIVERSITY   (United States)

^b UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; CONFORMAL MAPPING; GAME THEORY; INFORMATION MANAGEMENT; NETWORK ROUTING;

NASH EQUILIBRIA; SELFISH NEIGHBOR SELECTION;

TELECOMMUNICATION NETWORKS;

EID: 34548314616     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.64     Document Type: Conference Paper

References (27)

1. A. Fabrikant, A. Luthra, E. Maneva, C. H. Papadimitriou, and S. Shenker, "On a network creation game," in Proc. of ACM PODC '03. Boston, Massachusetts: ACM Press, 2003, pp. 347-351.
2. B.-G. Chun, R. Fonseca, I. Stoica, and J. Kubiatowicz, "Characterizing selfishly constructed overlay routing networks," in Proc. of IEEE INFOCOM'04, Hong Kong, 2004.
3. B. G. Rocha, V. Almeida, and D. Guedes, "Improving reliability of selfish overlay networks," in Proc. of WWW'06, Edinburgh, UK, 2006.
4. R. Bindal, P. Cao, W. Chan, J. Medved, G. Suwala, T. Bates, and A. Zhang, "Improving traffic locality in BitTorrent via biased neighbor selection," in Proc. of IEEE ICDCS '06, Lisbon, Portugal, 2006.
5. J. Liang, R. Kumar, and K. W. Ross, "The FastTrack overlay: A measurement study," Computer Networks, vol. 50, no. 6, pp. 842-858, 2006.
6. D. Stutzbach and R. Rejaie, "Characterizing the two-tier Gnutella topology," in Proc. of ACM SIGMETRICS '05, Banff, Alberta, Canada, 2005.
7. I. Stoica, R. Morris, D. Liben-Nowell, D. Karger, M. Kaashoek, F. Dabek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup protocol for internet applications," IEEE/ACM ToN, vol. 11, no. 1, pp. 17-32, 2003.
8. Y. Liu, H. Zhang, W. Gong, and D. F. Towsley, "On the interaction between overlay routing and underlay routing," in Proc. of IEEE INFOCOM '05, Miami, FL, 2005, pp. 2543-2553.
9. A. Archer, "Inapproximability of the asymmetric facility location and k-median problems," 2000, unpublished manuscript, available from the author's web-page.
10. M. J. Osborne and A. Rubinstein, A Course in Game Theory. MIT Press, 1994.
11. N. Laoutaris, R. Rajaraman, R. Sundaram, and S.-H. Teng, "A boundeddegree network formation game," 2007, arXiv-CoRR cs.GT/0701071.
12. P. Mirchandani and R. Francis, "Discrete location theory." John Wiley and Sons, 1990.
13. M. Charikar, S. Guha, D. B. Shmoys, and E. Tardos, "A constant factor approximation algorithm for the k-median problem," in Proc. of ACM STOC '99, Atlanta, GA, USA, 1999, pp. 1-10.
14. M. R. Korupolu, C. G. Plaxton, and R. Rajaraman, "Analysis of a local search heuristic for facility location problems," in Proc. of ACM-SIAM SODA '98, San Francisco, CA, USA, 1998, pp. 1-10.
15. V. Arya, N. Garg, R. Khandekar, K. Munagala, and V. Pandit, "Local search heuristic for k-median and facility location problems," in Proc. of ACM STOC '01, Hersonissos, Greece, 2001, pp. 21-29.
16. K. Jain and V. V. Vazirani, "Primal-dual approximation algorithms for metric facility location and k-median problems," in Proc of IEEE FOCS '99, New York City, NY, USA, 1999.
17. J.-H. Lin and J. S. Vitter, "ε-approximations with minimum packing constraint violation," in Proc. of ACM STOC '92, Victoria, British Columbia, Canada, 1992.
18. N. Laoutaris, O. Telelis, V. Zissimopoulos, and I. Stavrakakis, "Distributed selfish replication," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 12, pp. 1401-1413, 2006.
19. A. Medina, A. Lakhina, I. Matta, and J. Byers, "BRITE: An Approach to Universal Topology Generation," in Proc. of MASCOTS '01, Cincinnati, OH, Aug 2001, pp. 346-354.
20. A.-L. Barabási and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, no. 5439, pp. 509-512, 1999.
21. A. Ziviani, S. Fdida, J. F. de Rezende, and O. C. M. B. Duarte, "Toward a measurement-based geographic location service," in Proc. of PAM'2004, Antibes Juan-les-Pins, France, Apr. 2004, pp. 43-52.
22. C. Yoshikawa, http://ping.ececs.uc.edu/ping/, accessed on July 10, 2006.
23. http://www.cc.gatech.edu/~mihail/ASdata.html.
24. L. Subramanian, S. Agarwal, J. Rexford, and R. H. Katz, "Characterizing the internet hierarchy from multiple vantage points," in Proc. of IEEE INFOCOM '02, New York City, NY, USA, 2002.
25. A. Lakhina, J. Byers, M. Crovella, and P. Xie, "Sampling biases in IP topology measurements," in Proc. of IEEE INFOCOM'03, Apr. 2003.
26. J. Feigenbaum and S. Shenker, "Distributed algorithmic mechanism design: Recent results and future directions," in Proc. of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, 2002, pp. 1-13.
27. P. B. Godfrey, S. Shenker, and I. Stoica, "Minimizing churn in distributed systems," in Proc. of ACM SIGCOMM '06, Pisa, Italy, 2006.