Routing Fairness in Chord: Analysis and Enhancement

Add to your list(s) Download to your calendar using vCal

• Rubén Cuevas (Universidad Carlos III de Madrid)
• Thursday 28 January 2010, 16:00-17:00
• FW26, Computer Laboratory, William Gates Builiding.

If you have a question about this talk, please contact Eiko Yoneki.

Due to a flight delay, the speaker is still in Madrid. Unfortunately, we therefore need to cancel this talk.

In Peer-to-Peer (P2P) systems where stored objects are small, routing dominates the cost of publishing and retrieving an object. In such systems, the issue of fairly balancing the routing load among all nodes becomes critical. In this paper we address this issue for Chord-based P2P systems. We first present an analytical model to evaluate the routing fairness of Chord based on the well accepted Jain’s Fairness Index (FI). Our model shows that Chord performs poorly, with a FI around 0.6, mainly due to the different sizes of the zones between nodes. Following this observation, we propose a simple enhancement to the Chord finger selection algorithm with the goal of mitigating this effect. The key advantage of our proposal as compared to previous approaches is that it does not add any overhead to the basic Chord algorithm. The proposed approach is evaluated analytically showing a very substantial improvement over Chord, with a FI around 0.9. We conduct an extensive large-scale simulation study to evaluate our proposal and validate the analysis. The simulation study includes, among other aspects, churn conditions, heterogeneous nodes and Zipf- like object popularity.

The paper is available at: http://www.it.uc3m.es/rcuevas/papers/infocom09.pdf

Bio: Rubén Cuevas Rumín obtained his MSc in Telecomunications Engineering at University Carlos III of Madrid (Spain) in 2005. He received his MSc in Network Planning and Managment at Aalborg University (Denmark) in 2006. Furthermore, he obtained his MSc in Telematics Engineering at University Carlos III of Madrid and Politechnical Univeristy of Cataluña (Spain) in 2007. Since February 2006 he is Teaching Assistant and PhD Candidate in the Telematic Engineering Department at University Carlos III of Madrid. From September 2008 until March 2009 he was intern in the Internet Scientific Group at Telefonica Research Lab Barcelona. His main research interests include: peer-to-peer and overlay networks, internet measurements and online social networks.

This talk is part of the Computer Laboratory Systems Research Group Seminar series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• CL's SRG seminar
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Computer Laboratory Systems Research Group Seminar
• Department of Computer Science and Technology talks and seminars
• FW26, Computer Laboratory, William Gates Builiding
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.