| EGOIST: Overlay routing |
 "Utilizing PlanetLab's diverse resources we were able to demonstrate EGOIST's efficiency in creating optimized overlays at a global scale." Georgios Smaragdakis, Researcher, TU Berlin Participating organizations: Deutsche Telekom Laboratories/TU Berlin (Germany), ICS FORTH (Greece), Telefonica Research (Spain), Boston University (USA), Institut Eurecom (France). This multinational research collaboration has resulted in a distributed system for overlay routing called EGOIST, inspired by the "Selfish Neighbour Selection'' algorithm for overlay creation. This system is useful for a wide variety of network applications ranging from routing to peer-to-peer file sharing. The EGOIST system was implemented, deployed, and evaluated on PlanetLab over a period of two years. Using extensive measurements of the paths between the nodes of fifty PlanetLab sites, the research team demonstrated that EGOIST's neighbour selection primitives significantly outperform existing heuristics on a variety of performance metrics, including delay, available bandwidth, and node utilisation. Moreover, results also showed that EGOIST is competitive with an optimal, but unscalable, full-mesh approach, remains highly effective under significant churn, is resistent to cheating, and incurs minimal overheads. Finally, a multiplayer peer-to-peer game was used to demonstrate the value of EGOIST to end-user applications. Free, open-source EGOIST code will be available soon and can be used as a building block for the construction of optimised overlay networks. For more details and advances of the EGOIST project visit the Selfish Neighbor Selection website. To download EGOIST code, go to http://csr.bu.edu/sns/code.html. Related papers: G. Smaragdakis, N. Laoutaris, P. Michiardi, A. Bestavros, J. W. Byers, M. Roussopoulos. Distributed Network Formation for n-way Broadcast Applications. IEEE Transactions on Parallel and Distributed Systems, 21(10), 2010. 
G. Smaragdakis, N. Laoutaris, V. Lekakis, A. Bestavros, J. W. Byers, M. Roussopoulos. EGOIST: Overlay Routing using Selfish Neighbor Selection. ACM CoNEXT 2008. G. Smaragdakis, N. Laoutaris, P. Michiardi, A. Bestavros, J. W. Byers, M. Roussopoulos. Swarming on Optimized Graphs for n-way Broadcast. IEEE INFOCOM 2008. N. Laoutaris, G. Smaragdakis, A. Bestavros, J. W. Byers. Implications of Selfish Neighbor Selection in Overlay Networks. IEEE INFOCOM 2007.
|
