EGOIST: overlay routing using selfish neighbor selection

A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e., folding new arrivals into an existing overlay, and re-wiring to cope with changing network conditions. Previous work has considered the problem from two perspectives: devising practical heuristics for specific applications designed to work well in real deployments, and providing abstractions for the underlying problem that are analytically tractable, especially via game-theoretic analysis. In this paper, we unify these two thrusts by using insights gleaned from novel, realistic theoretic models in the design of Egoist

• Type: Conference
• Year: 2008
• Where: CONEXT
• Authors: Georgios Smaragdakis, Vassilis Lekakis, Nikolaos Laoutaris, Azer Bestavros, John W. Byers, Mema Roussopoulos
• Keywords: Computer Networks, CONEXT 2008, Egoist's Neighbor Selection, Overlay Network Applications, Peer-to-peer File Sharing