Recent topology-aware proposals in multicast overlay construction often rely on incremental and periodic refinements to improve the system performance. These approaches are therefore neither scalable, as they induce high communication cost due to refinement overhead, nor efficient because long convergence time is needed to stabilize the structure. In this paper, we propose a highly scalable locating algorithm that gradually directs newcomers to a set of their closest nodes without inducing high overhead. On the basis of this locating process, we build a robust and scalable topology-aware overlay scheme, called LCC. We conducted both simulations and PlanetLab experiments to evaluate the performance of LCC. LCC demonstrates promising performance to support large scale multicast applications.
|Title of host publication||CFIP 2006 - Colloque Francophone sur l'Ingenierie des Protocoles|
|Publisher||Hermes Science Publications|
|Publication status||Published - 2006|
|Event||Colloque Francophone sur l'Ingenierie des Protocoles, CFIP 2006 - French-Speaking Conference on Protocol Engineering, CFIP 2006 - Tozeur, Tunisia|
Duration: 30 Oct 2006 → 3 Nov 2006
|Conference||Colloque Francophone sur l'Ingenierie des Protocoles, CFIP 2006 - French-Speaking Conference on Protocol Engineering, CFIP 2006|
|Period||30/10/06 → 3/11/06|