Optimising multicast structures for grid computing

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. The centralized method described 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 tree-building algorithm of 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.

[1]  Jörg Liebeherr,et al.  Application-layer multicasting with Delaunay triangulation overlays , 2002, IEEE J. Sel. Areas Commun..

[2]  A. Gill Waters,et al.  Applying clustering algorithms to multicast group hierarchies , 2003 .

[3]  Jiawei Han,et al.  Efficient and Effective Clustering Methods for Spatial Data Mining , 1994, VLDB.

[4]  Ray Wild,et al.  Optimization Algorithms for Networks and Graphs , 1980 .

[5]  A. Gill Waters,et al.  Hierarchies for Network Evolution , 2000 .

[6]  Vincent Kanade,et al.  Clustering Algorithms , 2021, Wireless RF Energy Transfer in the Massive IoT Era.

[7]  Subhash Sharma.  Applied multivariate techniques , 1995 .

[8]  Zoran Obradovic,et al.  Distributed clustering and local regression for knowledge discovery in multiple spatial databases , 2000, ESANN.

[9]  David Thaler,et al.  Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification , 1997, RFC.

[10]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[11]  Kevin C. Almeroth,et al.  Modeling the branching characteristics and efficiency gains in global multicast trees , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[12]  Francine Berman,et al.  Overview of the Book: Grid Computing – Making the Global Infrastructure a Reality , 2003 .

[13]  Esther Jennings,et al.  Evaluating graph theoretic clustering algorithms for reliable multicasting , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[14]  Yuval Shavitt,et al.  Big-Bang simulation for embedding network distances in Euclidean space , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[15]  Boris Mirkin,et al.  Mathematical Classification and Clustering , 1996 .

[16]  장주욱.  [서평]「Wide Area Network Design : Concepts and Tools for Optimization」 , 2000 .

[17]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[18]  Vincent Roca,et al.  A survey of proposals for an alternative group communication service , 2003, IEEE Netw..

[19]  Steven Tuecke,et al.  The Anatomy of the Grid , 2003 .

[20]  Ben Y. Zhao,et al.  Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination , 2001, NOSSDAV '01.

[21]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[22]  Peter Rodgers,et al.  Visualizing weighted edges in graphs , 2003, Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003..

[23]  Tony Ballardie,et al.  Core Based Trees (CBT) Multicast Routing Architecture , 1997, RFC.

[24]  Ian M. Leslie,et al.  How bad is naive multicast routing? , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[25]  Bin Zhang,et al.  Distributed data clustering can be efficient and exact , 2000, SKDD.

[26]  Marvin A. Sirbu,et al.  Pricing Multicast Communication: A Cost-Based Approach , 2001, Telecommun. Syst..

[27]  John Beidler,et al.  Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.

[28]  David Hutchison,et al.  Scalable adaptive hierarchical clustering , 2002, IEEE Communications Letters.

[29]  James Evans,et al.  Optimization algorithms for networks and graphs , 1992 .

[30]  Kien A. Hua,et al.  ZIGZAG: an efficient peer-to-peer scheme for media streaming , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[31]  I. Foster,et al.  The Physiology of the Grid , 2003 .

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

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

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