Show simple item record

dc.contributor.authorSmaragdakis, Georgiosen_US
dc.contributor.authorLaoutaris, Nikolaosen_US
dc.contributor.authorBestavros, Azeren_US
dc.contributor.authorByers, John W.en_US
dc.contributor.authorRoussopoulos, Memaen_US
dc.date.accessioned2011-10-20T04:42:48Z
dc.date.available2011-10-20T04:42:48Z
dc.date.issued2007en_US
dc.identifier.urihttp://hdl.handle.net/2144/1690
dc.description.abstractA foundational issue underlying many overlay network applications ranging from routing to P2P 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 – a prototype overlay routing system that we implemented, deployed, and evaluated on PlanetLab. Using measurements on PlanetLab and trace-based simulations, we demonstrate that Egoist's neighbor selection primitives significantly outperform existing heuristics on a variety of performance metrics, including delay, available bandwidth, and node utilization. Moreover, we demonstrate that Egoist is competitive with an optimal, but unscalable full-mesh approach, remains highly effective under significant churn, is robust to cheating, and incurs minimal overhead. Finally, we discuss some of the potential benefits Egoist may offer to applications.en_US
dc.description.sponsorshipNational Science Foundation (CISE/CSR 0720604, ENG/EFRI 0735974, CISE/CNS 0524477, CNS/NeTS 0520166, CNS/ITR 0205294; CISE/EIA RI 0202067; CAREER 04446522); European Commission (RIDS-011923)en_US
dc.language.isoen_USen_US
dc.publisherBoston University Computer Science Departmenten_US
dc.relation.ispartofseriesBUCS Technical Reports;BUCS-TR-2007-013en_US
dc.relation.isreplacedbyBUCS-TR-2008-016en_US
dc.titleEGOIST: Overlay Routing Using Selfish Neighbor Selectionen_US
dc.typeTechnical Reporten_US


Files in this item

This item appears in the following Collection(s)

Show simple item record