Hierarchical Multicast Tree Algorithms of Data Grid

Data Grid is one of the important research subjects in the field of Grid Computing. To get a high efficiency of the system, this paper proposes a set of novel multi-cast algorithms for Data grid, which can achieve shorter multicast delay and less resource consump-tions. In contrast to previous approaches, the algo-rithms in this paper partition the group members into clusters in the lower layer, seeking the most plenty of date amount node as an optimal core (root) and build-ing a shared tree within each cluster according to the algebra addition of the date amount of node and expo-nential to minimize the number of links used. In the upper layer, a shared tree is then constructed using our algorithms to implement the inter-cluster routing. The extended simulation results indicate that our algo-rithms are more suitable for Date Grid as compared with other well-known existing multicast solutions.

[1]  Dinesh C. Verma,et al.  ALMI: An Application Level Multicast Infrastructure , 2001, USITS.

[2]  Kirk L. Johnson,et al.  Overcast: reliable multicasting with on overlay network , 2000, OSDI.

[3]  Bobby Bhattacharjee,et al.  Scalable application layer multicast , 2002, SIGCOMM '02.

[4]  Xiaola Lin,et al.  Adaptive Multicast Wormhole Routing in 2D Mesh Multicomputers , 1993, PARLE.

[5]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[6]  Weijia Jia,et al.  A scalable and efficient end host multicast for peer-to-peer systems---DSCT , 2004 .

[7]  Kevin R. Fall,et al.  Ns: notes and documentation , 1997 .

[8]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[9]  Jie Wu,et al.  Hierarchical Multicast Tree Algorithms for Application Layer Mesh Networks , 2005, ICCNMC.

[10]  Srinivasan Seshan,et al.  Enabling conferencing applications on the internet using an overlay muilticast architecture , 2001, SIGCOMM '01.

[11]  Srinivasan Seshan,et al.  Enabling conferencing applications on the internet using an overlay muilticast architecture , 2001, SIGCOMM 2001.

[12]  Paul Francis,et al.  Yoid: Extending the Internet Multicast Architec-ture , 2000 .

[13]  Xiaola Lin,et al.  Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers , 1994, IEEE Trans. Parallel Distributed Syst..

[14]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

[15]  Mark Handley,et al.  Application-Level Multicast Using Content-Addressable Networks , 2001, Networked Group Communication.

[16]  Stephen E. Deering,et al.  Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.

[17]  Hui Zhang,et al.  A case for end system multicast (keynote address) , 2000, SIGMETRICS '00.

[18]  Lixia Zhang,et al.  Host multicast: a framework for delivering multicast to end users , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[19]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..