000160607 001__ 160607
000160607 005__ 20180913060242.0
000160607 02470 $$2ISI$$a000259411700101
000160607 037__ $$aCONF
000160607 245__ $$aBalanced relay allocation on heterogeneous unstructured overlays
000160607 269__ $$a2008
000160607 336__ $$aConference Papers
000160607 490__ $$aIeee Infocom Series
000160607 520__ $$aDue 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 ill 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.
000160607 700__ $$aNguyen, Hung X.
000160607 700__ $$aFigueiredo, Daniel R.
000160607 700__ $$0241029$$g152655$$aGrossglauser, Matthias
000160607 700__ $$aThiran, Patrick
000160607 7112_ $$dApr 15-17, 2008$$cPhoenix, AZ$$a27th IEEE Conference on Computer Communications (INFOCOM 2008)
000160607 773__ $$t27Th Ieee Conference On Computer Communications (Infocom), Vols 1-5$$q601-609
000160607 909C0 $$xU10836$$0252455$$pLCA4
000160607 909CO $$pconf$$pIC$$ooai:infoscience.tind.io:160607
000160607 917Z8 $$xWOS-2010-11-30
000160607 917Z8 $$x152655
000160607 937__ $$aEPFL-CONF-160607
000160607 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000160607 980__ $$aCONF