DocumentCode :
3111534
Title :
TSR: Topology Reduction from Tree to Star Data Grids
Author :
Ming-Chang Lee ; Fang-Yie Leu ; Ying-ping Chen
Author_Institution :
Dept. of Comput. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan
fYear :
2013
fDate :
3-5 July 2013
Firstpage :
678
Lastpage :
683
Abstract :
To speed up data transmission of data grids, several co-allocation schemes have been proposed. However, data grids are often large in scale, heterogeneous in participating resources, and complicated in architecture and network topology, consequently increasing the analytical complexity of its data transmission behaviour. In other words, if we can reduce the data transmission topology for the grid, the analysis will be easier. Therefore, in this paper, we propose a topology reduction approach, called the Tree-to-Star Reduction method (TSR for short), which can reduce a packet delivery tree topology to a star for a data grid so that the data transmission of a co-allocation scheme can be more conveniently analyzed. Here, a delivery tree topology, as a tree topology rooted at the destination node, is a network topology for delivering all fragments of a file to the destination node.
Keywords :
grid computing; telecommunication network topology; trees (mathematics); TSR; architecture; coallocation schemes; data grids; data transmission behaviour; data transmission speed; data transmission topology; destination node; network topology; packet delivery tree topology; topology reduction; tree-to-star reduction method; Bandwidth; Computer science; Data communication; Delays; Educational institutions; Network topology; Topology; co-allocation scheme; data grid; delivery star; delivery tree; topology reduction;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS), 2013 Seventh International Conference on
Conference_Location :
Taichung
Type :
conf
DOI :
10.1109/IMIS.2013.122
Filename :
6603756
Link To Document :
بازگشت