Full metadata record
DC FieldValueLanguage
dc.contributor.authorLee, Ming-Changen_US
dc.contributor.authorLeu, Fang-Yieen_US
dc.contributor.authorChen, Ying-pingen_US
dc.date.accessioned2014-12-08T15:35:17Z-
dc.date.available2014-12-08T15:35:17Z-
dc.date.issued2013en_US
dc.identifier.isbn978-0-7695-4974-3en_US
dc.identifier.urihttp://hdl.handle.net/11536/23913-
dc.identifier.urihttp://dx.doi.org/10.1109/IMIS.2013.122en_US
dc.description.abstractTo 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.en_US
dc.language.isoen_USen_US
dc.subjectdata griden_US
dc.subjectdelivery treeen_US
dc.subjectdelivery staren_US
dc.subjecttopology reductionen_US
dc.subjectco-allocation schemeen_US
dc.titleTSR: Topology Reduction from Tree to Star Data Gridsen_US
dc.typeProceedings Paperen_US
dc.identifier.doi10.1109/IMIS.2013.122en_US
dc.identifier.journal2013 SEVENTH INTERNATIONAL CONFERENCE ON INNOVATIVE MOBILE AND INTERNET SERVICES IN UBIQUITOUS COMPUTING (IMIS 2013)en_US
dc.citation.spage678en_US
dc.citation.epage683en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000333157600116-
Appears in Collections:Conferences Paper


Files in This Item:

  1. 000333157600116.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.