Multicast Tree Diameter for Dynamic Distributed Interactive Applications

Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups. We focus on using application-layer multicast with a centralized approach to the group management. The groups are organized in overlay networks that are created using graph algorithms. We investigate many spanning tree problems with particular focus on reducing the diameter of a tree, i.e., the maximum pairwise latency between users. In addition, we focus on reducing the time it takes to execute membership changes. In that context, we use core-selection heuristics to find well-placed group nodes, and edge-pruning algorithms to reduce the number of edges in an otherwise fully meshed overlay. Our edge-pruning algorithms strongly connect well-placed group nodes to the remaining group members, to create new and pruned group graphs, such that, when a tree algorithm is applied to a pruned group graph, it is manipulated into creating trees with a smaller diameter. We implemented and analyzed experimentally spanning-tree heuristics, core-selection heuristics and edge-pruning algorithms. We found that faster heuristics that do not explicitly optimize the diameter are able to compete with slower heuristics that do optimize it.

[1]  Subhash C. Narula,et al.  Degree-constrained minimum spanning tree , 1980, Comput. Oper. Res..

[2]  D. T. Lee,et al.  Bounded diameter minimum spanning trees and related problems , 1989, SCG '89.

[3]  Hossam S. Hassanein,et al.  Core-selection algorithms in multicast routing - comparative and complexity analysis , 2006, Comput. Commun..

[4]  Anthony Young,et al.  Overlay mesh construction using interleaved spanning trees , 2004, IEEE INFOCOM 2004.

[5]  Bryant A. Julstrom,et al.  Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem , 2003, SAC '03.

[6]  Narsingh Deo,et al.  Random-tree Diameter and the Diameter-constrained MST , 2002, Int. J. Comput. Math..

[7]  Sonia Fahmy,et al.  Topology-aware overlay networks for group communication , 2002, NOSSDAV '02.

[8]  Marcel Waldvogel,et al.  Dimensioning server access bandwidth and multicast routing in overlay networks , 2001, NOSSDAV '01.

[9]  Dinesh C. Verma,et al.  ALMI: An Application Level Multicast Infrastructure , 2001, USITS.

[10]  Michael T. Goodrich,et al.  Algorithm Design: Foundations, Analysis, and Internet Examples , 2001 .

[11]  Henry D. Shapiro,et al.  An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree , 1992, Computational Support for Discrete Mathematics.

[12]  Carsten Griwodz,et al.  Dynamic Group Membership Management for Distributed Interactive Applications , 2007, 32nd IEEE Conference on Local Computer Networks (LCN 2007).

[13]  O. Leon,et al.  Issues in TCP Vegas over Optical Burst Switching Networks , 2007 .

[14]  Kajal T. Claypool,et al.  Latency and player actions in online games , 2006, CACM.

[15]  L.S. Liu,et al.  Immersive peer-to-peer audio streaming platform for massive online games , 2006, CCNC 2006. 2006 3rd IEEE Consumer Communications and Networking Conference, 2006..

[16]  Carsten Griwodz,et al.  Applicability of group communication for increased scalability in MMOGs , 2006, NetGames '06.

[17]  Geoffrey C. Fox,et al.  The Narada Event Brokering System: Overview and Extensions , 2002, PDPTA.

[18]  Anukool Lakhina,et al.  BRITE: Universal Topology Generation from a User''s Perspective , 2001 .

[19]  Bobby Bhattacharjee,et al.  Analysis of the NICE Application Layer Multicast Protocol , 2002 .

[20]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.