EGOIST: Overlay routing using selfish neighbor selection

Proceedings of 2008 ACM CoNEXT Conference - 4th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT '08

Volumn , Issue , 2008, Pages

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

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF CRETE   (Greece)

^c TELEFONICA RESEARCH   (Spain)

^d BOSTON UNIVERSITY   (United States)

Author keywords

Overlay network creation and maintenance; Overlay routing; Selfish neighbor selection

Indexed keywords

AVAILABLE BANDWIDTH; CONNECTIVITY MANAGEMENT; END-USER APPLICATIONS; MESH APPROACH; MULTIPLAYERS; NEIGHBOR SELECTION; NETWORK CONDITION; OVERLAY ROUTING; PEER-TO-PEER FILE SHARING; PEER-TO-PEER GAMES; PERFORMANCE METRICS; PLANETLAB; SELFISH NEIGHBOR SELECTION; THEORETIC ANALYSIS; THEORETIC MODEL;

BANDWIDTH; HEURISTIC METHODS; MAINTENANCE; OVERLAY NETWORKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 70350771141     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1544012.1544018     Document Type: Conference Paper

References (42)

1. D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris. Resilient Overlay Networks. In SOSP '01.
2. 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.
3. M. Babaioff, R. Kleinberg, and C. H. Papadimitriou. Congestion games with malicious players. In EC '07.
4. A. Bharambe, J. Pang, and S. Seshan. Colyseus: a distributed architecture for online multiplayer games. In NSDI '06.
5. A. Bharambe, J. Pang, and S. Seshan. Donnybrook: Enabling Large-Scale, High-Speed, Peer-to-Peer Games. In SIGCOMM '08.
6. A. Blanc, Y.-K. Liu, A. Vahdat, and S. Shenker. Designing incentives for peer-to-peer routing. In P2PEcon '04.
7. M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. Wallach. Secure routing for structured peer-to-peer overlay networks. In OSDI '02.
8. B.-G. Chun, R. Fonseca, I. Stoica, and J. Kubiatowicz. Characterizing selfishly constructed overlay routing networks. In INFOCOM '04.
9. J. Corbo and D. C. Parkes. The price of selfish behavior in bilateral network formation. In PODC '05.
10. N. Deo. Graph Theory with Applications to Engineering and Computer Science. Prentice Hall, 1994.
11. O. Ercetin and L. Tassiulas. Market-based resource allocation for content delivery in the internet. IEEE Transactions on Computers, 52(12):1573-1585, 2003.
12. A. Fabrikant, A. Luthra, E. Maneva, C. H. Papadimitriou, and S. Shenker. On a network creation game. In PODC '03.
13. M. Feldman, K. Lai, I. Stoica, and J. Chuang. Robust incentive techniques for peer-to-peer networks. In EC '04.
14. P. B. Godfrey, S. Shenker, and I. Stoica. Minimizing Churn in Distributed Systems. In SIGCOMM '06.
15. K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica. The Impact of DHT Routing Geometry on Resilience and Proximity. In SIGCOMM '03.
16. J. Han, D. Watson, and F. Jahanian. Topology aware overlay networks. In INFOCOM '05.
17. N. Laoutaris, L. Poplawski, R. Rajaraman, R. Sundaram, and S.-H. Teng. A Bounded-Degree Network Formation Game. In PODC '08.
18. N. Laoutaris, P. Rodriguez, and L. Massoulie. ECHOS: Edge Capacity Hosting Overlays of Nano Data Centers. SIGCOMM Compututer Communication Review, 38(1):51-54, 2008.
19. N. Laoutaris, G. Smaragdakis, A. Bestavros, and J. Byers. Implications of Selfish Neighbor Selection in Overlay Networks. In INFOCOM '07.
20. J. Ledlie, P. Pietzuch, and M. Seltzer. Network Coordinates in the Wild. In NSDI '07.
21. Z. Li and P. Mohapatra. Impact of Topology On Overlay Routing Service. In INFOCOM '04.
22. Z. Li and P. Mohapatra. QRON: QoS-aware routing in overlay networks. IEEE JSAC, 22(1):29-40, Jan 2004.
23. Y. Liu, H. Zhang, W. Gong, and D. F. Towsley. On the interaction between overlay routing and underlay routing. In INFOCOM '05.
24. G. S. Manku, M. Naor, and U. Wieder. Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. In STOC '04.
25. T. Moscibroda, S. Schmid, and R. Wattenhofer. On the topologies formed by selfish peers. In PODC '06.
26. L. Qiu, Y. R. Yang, Y. Zhang, and S. Shenker. On Selfish Routing in Internet-like Environments. In SIGCOMM '03.
27. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Topologically aware overlay construction and server selection. In INFOCOM '02.
28. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz. Handling Churn in a DHT. In USENIX '04.
29. V. Ribeiro, R. Riedi, R. Baraniuk, J. Navratil, and L. Cottrell. pathChirp: Efficient Available Bandwidth Estimation for Network Paths. In PAM '03.
30. T. Roughgarden and E. Tardos. How bad is selfish routing? Journal of the ACM, 49(2):236-259, 2002.
31. 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, 19(1):50-59, 1999.
32. S. Seetharaman and M. Ammar. On the Interaction between Dynamic Routing in the Overlay and Native Layers. In INFOCOM '06.
33. 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 PAM '05.
34. G. Smaragdakis. Overlay Network Creation and Maintenance with Selfish Users. PhD Dissertation, Computer Science Department, Boston University, 2008.
35. G. Smaragdakis, N. Laoutaris, A. Bestavros, J. Byers, and M. Roussopoulos. EGOIST: Overlay Routing using Selfish Neighbor Selection. Technical Report BUCS-TR-2007-013, CS Department, Boston University.
36. G. Smaragdakis, N. Laoutaris, P. Michiardi, A. Bestavros, J. W. Byers, and M. Roussopoulos. Swarming on Optimized Graphs for n-way Broadcast. In INFOCOM '08.
37. Srinivasan Seetharaman and Voler Hilt and Markus Hofmann and Mostafa Ammar. Preemptive strategies to improve routing performance of native and overlay layers. In INFOCOM '07.
38. V. Vishnumurthy and P. Francis. A comparison of structured and unstructured P2P approaches to heterogeneous random peer selection. In USENIX '07.
39. L. Wang, K. Park, R. Pang, V. Pai, and L. Peterson. Reliability and Security in the CoDeeN Content Distribution Network. In USENIX '04.
40. Z. Yao, D. Leonard, X. Wang, and D. Loguinov. Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks. In ICNP '06.
41. A. Young, J. Chen, Z. Ma, A. Krishnamurthy, L. L. Peterson, and R. Wang. Overlay Mesh Construction Using Interleaved Spanning Trees. In INFOCOM '04.
42. Y. Zhu, C. Dovrolis, and M. H. Ammar. Dynamic overlay routing based on available bandwidth estimation: A simulation study. Computer Networks, 50(6):742-762, 2006.