The EGOIST Overlay Routing System
Georgios Smaragdakis, Vassilis Lekakis, Nikolaos Laoutaris, Azer Bestavros, John W. Byers, Mema Roussopoulos · 2008
A foundational issue underlying many overlay net-work 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 rewiring to cope with changing network conditions. Pre-vious work has considered the problem from two perspectives: devising practical heuristics for specific appli-cations designed to work well in real deployments, and providing abstractions for the underlying problem thatare analytically tractable, especially via game-theoretic analysis. In this paper, we unify these two thrusts by us-ing insights gleaned from novel, realistic theoretic models in the design of Egoist- a distributed overlay rout-ing system that we implemented, deployed, and evaluated on PlanetLab. Using extensive measurements ofpaths between nodes, we demonstrate that Egoist'sneighbor selection primitives significantly outperform