Optimising multicast structures for grid computing

Waters, Gill and Crawford, John and Lim, Sei Guan (2004) Optimising multicast structures for grid computing. Computer Communications, 27 (14). pp. 1389-1400. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1016/j.comcom.2004.02.015

Abstract

This paper introduces a flexible new method of constructing hierarchical multicast structures suitable for supporting large-scale GRID applications. Hierarchical multicast trees are constructed by repeated application of clustering algorithms that partition the members of a large application community to form a layered hierarchy of clusters of users. The hierarchies are examples of application overlay networks that do not rely on network layer facilities for multicast transmission. Our method applies clustering based either on the geographical location of users or by using more standard network topology measures. Our results show favourable performance when compared with the NICE protocol for overlay networks. Both NICE and our clustering approach build overlay networks which offer a compromise between the ?stress? on network links and the ?stretch? or increase in delay to users caused by the application layer overlay.

Item Type: Article
Uncontrolled keywords: grid computing; clustering algorithms; hierarchical multicast; overlay networks
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Systems Architecture Group
Faculties > Science Technology and Medical Studies > School of Computing > Systems Architecture Group
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:01
Last Modified: 12 Jul 2009 06:23
Resource URI: http://kar.kent.ac.uk/id/eprint/14112 (The current URI for this page, for reference purposes)
  • Depositors only (login required):