loading...
Distributed End Host Multicast Algorithms for Irregular Overlay Mesh
Beijing, China November 27-November 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SKG.2005.64First International Conference on Sem ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Wanqing Tu, City University of Hong Kong
Weijia Jia, City University of Hong Kong
This paper proposes a set of novel distributed algorithms on top of m-D irregular mesh overlay to achieve the short delay and low network resource consumption end host multicast services. Our end host multicast fully utilizes the advantages of m-D irregular mesh to construct a two-layer architecture. Compared to previous approaches, the novelty and contribution of our end host multicast include: 1. cluster formation that partitions the group members into different clusters in the lower layer; 2. cluster core selection that selects a core who has the minimum sum of overlay hops to all other cluster members for each cluster ; 3. weighted shortest path tree construction that constructs the shortest multicast trees with the minimum number of paths to propagate the multicast traffic; 4. distributed multicast routing directs the multicast messages to be efficiently distributed along the two-layer multicast architecture in parallel without a global control. Simulation results show that our end host multicast can distributively achieves the short delay and low network resource consumption multicast services as compared with some well-know end host multicast systems.
Citation:
Wanqing Tu, Weijia Jia, "Distributed End Host Multicast Algorithms for Irregular Overlay Mesh," skg, pp.15, First International Conference on Semantics, Knowledge and Grid (SKG'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.