By Topic

Hierarchical Multicast Tree Algorithms of Data Grid

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Weijia Jia Weijia Jia ; Dept. of Comput. Sci., City Univ. of Hong Kong, Hong Kong, China ; Qingfeng Fan Qingfeng Fan ; Qingli Wu Qingli Wu ; Yanxiang He Yanxiang He

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.

Published in:

Semantics, Knowledge and Grid, 2006. SKG '06. Second International Conference on

Date of Conference:

1-3 Nov. 2006