OpenBU

EGOIST: Overlay Routing Using Selfish Neighbor Selection

OpenBU

Show simple item record

dc.contributor.author Smaragdakis, Georgios en_US
dc.contributor.author Laoutaris, Nikolaos en_US
dc.contributor.author Bestavros, Azer en_US
dc.contributor.author Byers, John W. en_US
dc.contributor.author Roussopoulos, Mema en_US
dc.date.accessioned 2011-10-20T04:42:48Z
dc.date.available 2011-10-20T04:42:48Z
dc.date.issued 2007 en_US
dc.identifier.uri http://hdl.handle.net/2144/1690
dc.description.abstract A 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.sponsorship National 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.iso en_US en_US
dc.publisher Boston University Computer Science Department en_US
dc.relation.ispartofseries BUCS Technical Reports;BUCS-TR-2007-013 en_US
dc.relation.isreplacedby BUCS-TR-2008-016 en_US
dc.title EGOIST: Overlay Routing Using Selfish Neighbor Selection en_US
dc.type Technical Report en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search OpenBU


Browse

Deposit Materials

Statistics