Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Balanced relay allocation on heterogeneous unstructured overlays|
|Citation:||INFOCOM 2008: The 27th Conference on Computer Communications IEEE, 2008: pp.126-130|
|Conference Name:||Annual Joint conference of the IEEE Computer and Communications Societies (27th : 2008 : Phoenix, USA)|
|Hung X. Nguyen, Daniel R. Figueiredo, Matthias Grossglauser and Patrick Thiran|
|Abstract:||Due to the increased usage of NAT boxes and firewalls, it has become harder for applications to establish direct connections seamlessly among two end-hosts. A recently adopted proposal to mitigate this problem is to use relay nodes, end-hosts that act as intermediary points to bridge connections. Efficiently selecting a relay node is not a trivial problem, specially in a large-scale unstructured overlay system where end-hosts are heterogeneous. In such environment, heterogeneity among the relay nodes comes from the inherent differences in their capacities and from the way overlay networks are constructed. Despite this fact, good relay selection algorithms should effectively balance the aggregate load across the set of relay nodes. In this paper, we address this problem using algorithms based on the two random choices method. We first prove that the classic load-based algorithm can effectively balance the load even when relays are heterogeneous, and that its performance depends directly on relay heterogeneity. Second, we propose an utilization-based random choice algorithm to distribute load in order to balance relay utilization. Numerical evaluations through simulations illustrate the effectiveness of this algorithm, indicating that it might also yield provable performance (which we conjecture). Finally, we support our theoretical findings through simulations of various large-scale scenarios, with realistic relay heterogeneity.|
|Appears in Collections:||Mathematical Sciences publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.