Selfish overlay network creation and maintenance

IEEE/ACM Transactions on Networking

Volumn 19, Issue 6, 2011, Pages 1624-1637

  Smaragdakis, Georgios ^a   Laoutaris, Nikolaos ^b   Lekakis, Vassilis ^c   Bestavros, Azer ^d   Byers, John W ^d   Roussopoulos, Mema ^e  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b TELEFONICA RESEARCH   (Spain)

^c UNIVERSITY OF MARYLAND   (United States)

^d BOSTON UNIVERSITY   (United States)

^e UNIVERSITY OF ATHENS   (Greece)

Author keywords

Network formation; overlay networks; overlay routing; selfish neighbor selection (SNS)

Indexed keywords

AVAILABLE BANDWIDTH; BEST RESPONSE; BOUNDED DEGREE; LOCAL OPTIMIZATIONS; MEDIAN PROBLEM; NEIGHBOR SELECTION; NETWORK APPLICATIONS; NETWORK CONDITION; NETWORK CREATION; NETWORK FORMATION; OVERLAY ROUTING; OVERLAY STRUCTURES; PEER-TO-PEER FILE SHARING; PERFORMANCE BENEFITS; PERFORMANCE METRICS; PLANETLAB; SELFISH NODE;

BANDWIDTH; DISTRIBUTED COMPUTER SYSTEMS; GAME THEORY; OPTIMIZATION; OVERLAY NETWORKS;

PEER TO PEER NETWORKS;

EID: 84655167965     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2011.2129528     Document Type: Article

References (54)

1. N. Laoutaris, G. Smaragdakis, A. Bestavros, and J. W. Byers, "Implications of selfish neighbor selection in overlay networks," in Proc. IEEE INFOCOM, 2007, pp. 490-498. (Pubitemid 47334264)
2. G. Smaragdakis, V. Lekakis, N. Laoutaris, A. Bestavros, J. W. Byers, and M. Roussopoulos, "EGOIST: Overlay routing using selfish neighbor selection," in Proc. ACM CoNEXT, 2008, Article no. 6.
3. S. Savage, T. Anderson, A. Aggarwal, D. Becker, N. Cardwell, A. Collins, E. Hoffman, J. Snell, A. Vahdat, G. Voelker, and J. Zahorjan, "Detour: Informed Internet routing and transport," IEEE Micro, vol. 19, no. 1, pp. 50-59, Jan.-Feb. 1999.
4. D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris, "Resilient overlay networks," in Proc. ACM SOSP, 2001, pp. 131-145. (Pubitemid 33612610)
5. O. Ercetin and L. Tassiulas, "Market-based resource allocation for content delivery in the Internet," IEEE Trans. Comput., vol. 52, no. 12, pp. 1573-1585, Dec. 2003.
6. L. Wang, K. Park, R. Pang, V. Pai, and L. Peterson, "Reliability and security in the CoDeeN content distribution network," in Proc. USENIX Annu. Tech. Conf., 2004, p. 14.
7. B. Cohen, "Incentives build robustness in BitTorrent," in Proc. 1st Workshop Econ. Peer-to-Peer Syst., 2003.
8. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger,M. F. Kaashoek, F. Dabek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup protocol for Internet applications," IEEE/ACM Trans. Netw., vol. 11, no. 1, pp. 17-32, Feb. 2003.
9. M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, "SplitStream: High-bandwidth multicast in cooperative environments," in Proc. ACM SOSP, 2003, pp. 298-313. (Pubitemid 40929704)
10. D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat, "Bullet: High bandwidth data dissemination using an overlay mesh," in Proc. ACM SOSP, 2003, pp. 282-297. (Pubitemid 40929703)
11. N. Magharei and A. H. Rasti, "Prime: Peer-to-peer receiver-driven mesh-based streaming," in Proc. IEEE INFOCOM, 2007, pp. 1415-1423. (Pubitemid 47334367)
12. N. Laoutaris, P. Rodriguez, and L. Massoulie, "ECHOS: Edge capacity hosting overlays of nano data centers," Comput. Commun. Rev., vol. 38, no. 1, pp. 51-54, 2008.
13. A. Bharambe, J. R. Douceur, J. R. Lorch, T. Moscibroda, J. Pang, S. Seshan, and X. Zhuang, "Donnybrook: Enabling large-scale, high-speed, peer-to-peer games," in Proc. ACM SIGCOMM, 2008, pp. 389-400.
14. L. Qiu, Y. R. Yang, Y. Zhang, and S. Shenker, "On selfish routing in Internet-like environments," in Proc. ACM SIGCOMM, 2003, pp. 151-162.
15. M. Feldman, K. Lai, I. Stoica, and J. Chuang, "Robust incentive techniques for peer-to-peer networks," in Proc. ACM EC, 2004, pp. 102-111.
16. T. Roughgarden and É. Tardos, "How bad is selfish routing?," J. ACM, vol. 49, no. 2, pp. 236-259, 2002. (Pubitemid 44159321)
17. N. Nisan, T. Roughgarden, É. Tardos, and V. V. Vazirani, Algorithmic Game Theory. Cambridge, U.K.: Cambridge Univ. Press, 2007.
18. J. Feigenbaum and S. Shenker, "Distributed algorithmic mechanism design: Recent results and future directions," in Proc. 6th Int.Workshop Discrete Algor. Methods Mobile Comput. Commun., 2002, pp. 1-13.
19. J. Ledlie, P. Pietzuch, and M. Seltzer, "Network coordinates in the wild," in Proc. USENIX/ACM NSDI, 2007.
20. A. Fabrikant, A. Luthra, E. Maneva, C. H. Papadimitriou, and S. Shenker, "On a network creation game," in Proc. ACM PODC, 2003, pp. 347-351.
21. J. Corbo and D. C. Parkes, "The price of selfish behavior in bilateral network formation," in Proc. ACM PODC, 2005, pp. 99-107.
22. E. D. Demaine, M. Hajiaghayi, H. Mahini, and M. Zadimoghaddam, "The price of anarchy in network creation games," in Proc. ACM PODC, 2007, pp. 292-298. (Pubitemid 350229326)
23. B.-G. Chun, R. Fonseca, I. Stoica, and J. Kubiatowicz, "Characterizing selfishly constructed overlay routing networks," in Proc. IEEE INFOCOM, 2004, vol. 2, pp. 1329-1339.
24. B. G. Rocha, V. Almeida, and D. Guedes, "Improving reliability of selfish overlay networks," in Proc. WWW, 2006.
25. A. Archer, "Inapproximability of the asymmetric facility location and Median problems," 2000 [Online]. Available: http://www2.research. att.com/~aarcher/Research
26. X. Yang and G. de Veciana, "Performance of peer-to-peer networks: Service capacity and role of resource sharing policies," Perform. Eval., vol. 63, no. 3, pp. 175-194, 2006. (Pubitemid 41705252)
27. Z. Yao, D. Leonard, X. Wang, and D. Loguinov, "Modeling heterogeneous user churn and local resilience of unstructured P2P networks," in Proc. IEEE ICNP, 2006, pp. 32-41.
28. R. Bindal, P. Cao, W. Chan, J. Medval, G. Suwala, T. Bates, and A. Zhang, "Improving traffic locality in BitTorrent via biased neighbor selection," in Proc. IEEE ICDCS, 2006, p. 66.
29. Y. Liu, H. Zhang, W. Gong, and D. F. Towsley, "On the interaction between overlay routing and underlay routing," in Proc. IEEE INFOCOM, 2005, vol. 4, pp. 2543-2553. (Pubitemid 41382369)
30. Y. Tian, D. Wu, and K.-W. Ng, "Analyzing multiple file downloading in BitTorrent," in Proc. ICPP, 2006, pp. 297-306.
31. M. J. Osborne and A. Rubinstein, A Course in Game Theory. Cambridge, MA: MIT Press, 1994.
32. P. B. Mirchandani and R. L. Francis, Discrete Location Theory. New York: Wiley, 1990.
33. M. Charikar, S. Guha, É. Tardos, and D. B. Shmoys, "A constant-factor approximation algorithm for the median problem," J. Comput. Syst. Sci., vol. 65, no. 1, pp. 129-149, 2002.
34. M. R. Korupolu, C. G. Plaxton, and R. Rajaraman, "Analysis of a local search heuristic for facility location problems," in Proc. ACM-SIAM SODA, 1998, pp. 1-10.
35. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit, "Local search heuristics for median and facility location problems," SIAM J. Comput., vol. 33, no. 3, pp. 544-562, 2004.
36. K. Jain and V. V. Vazirani, "Primal-dual approximation algorithms for metric facility location and median problems," in Proc. IEEE FOCS, 1999, pp. 2-13. (Pubitemid 30539993)
37. J.-H. Lin and J. S. Vitter, "approximations with minimum packing constraint violation," in Proc. ACM STOC, 1992, pp. 771-782.
38. G. Smaragdakis, "Overlay network creation and maintenance with selfish users," Ph.D. dissertation, Dept. Comput. Sci., Boston Univ., Boston, MA, 2009.
39. N. Laoutaris, L. Poplawski, R. Rajaraman, R. Sundaram, and S.-H. Teng, "A bounded-degree network formation game," in Proc. ACM PODC, 2008, pp. 165-174.
40. A. Medina, A. Lakhina, I. Matta, and J. Byers, "BRITE: An approach to universal topology generation," in Proc. IEEE/ACM MASCOTS, 2001, pp. 346-353. (Pubitemid 32878219)
41. A.-L. Barabási and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, no. 5439, pp. 509-512, 1999.
42. A. Ziviani, S. Fdida, J. F. de Rezende, and O. C. M. B. Duarte, "Toward a measurement-based geographic location service," in Proc. PAM, 2004, pp. 43-52.
43. P. B. Godfrey, S. Shenker, and I. Stoica, "Minimizing churn in distributed systems," in Proc. ACM SIGCOMM, 2006, pp. 147-158. (Pubitemid 44623723)
44. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, "Handling churn in a DHT," in Proc. USENIX Annu. Tech. Conf., 2004, p. 10.
45. A. Young, J. Chen, Z. Ma, A. Krishnamurthy, L. L. Peterson, and R. Wang, "Overlay mesh construction using interleaved spanning trees," in Proc. IEEE INFOCOM, 2004, pp. 396-407.
46. A. Shriram, M. Murray, Y. Hyun, N. Brownlee, A. Broido, M. Fomenkov, and K. C. Claffy, "Comparison of public end-to-end bandwidth estimation tools on high-speed links," in Proc. PAM, 2005, pp. 306-320. (Pubitemid 41252755)
47. V. Ribeiro, R. Riedi, R. Baraniuk, J. Navratil, and L. Cottrell, "pathChirp: Efficient available bandwidth estimation for network paths," in Proc. PAM, 2003.
48. N. Deo,Graph TheoryWith Applications to Engineering and Computer Science. Upper Saddle River, NJ: Prentice-Hall, 1994.
49. V. Latora and M. Marchiori, "Economic small-world behavior in weighted networks," The Eur. Phys. J. B, vol. 32, pp. 249-263, 2003. (Pubitemid 41201142)
50. E. Koutsoupias and C. Papadimitriou, "Worst-case equilibria," in Proc. STACS, 1999, pp. 404-413.
51. S. Kintali, L. J. Poplawski, R. Rajaraman, R. Sundaram, and S.-H. Teng, "Reducibility among fractional stability problems," in Proc. IEEE FOCS, 2009, pp. 283-292.
52. G. Smaragdakis, N. Laoutaris, P. Michiardi, A. Bestavros, J. W. Byers, and M. Roussopoulos, "Distributed network formation for n-way broadcast applications," IEEE Trans. Parallel Distrib. Syst., vol. 21, no. 10, pp. 1427-1441, Oct. 2010.
53. V. Aggarwal, A. Feldmann, and C. Scheideler, "Can ISPs and P2P users cooperate for improved performance?," Comput. Commun. Rev., vol. 37, no. 3, pp. 29-40, 2007.
54. S. Seetharaman, V. Hilt, M. Hofmann, and M. Ammar, "Preemptive strategies to improve routing performance of native and overlay layers," in Proc. IEEE INFOCOM, 2007, pp. 463-471. (Pubitemid 47334261)