Priority based Overlay Multicast with Filtering Mechanism for Distributed Interactive Applications

The "priority-based directed minimum spanning tree" (PST) is designed for distributed interactive applications (DIAs) in which the data are delivered to the receiver node according to their priority; however PST cannot balance the bandwidth usage among the nodes and the system will be unstable when its scale increases. This paper proposes a novel overlay multicast protocol named priority based overlay multicast (POM), which uses the priority, delay and available bandwidth to construct the multicast tree, besides a filtering mechanism is proposed to rebuild the tree when the available bandwidth shortage appears. The effectiveness of our protocol is demonstrated in the simulation results, showing that POM uses the available bandwidth efficiently, besides it keeps the system stable when its scale increases

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

[2]  Michael Zyda,et al.  Multicast grouping for data distribution management , 2002, Simul. Pract. Theory.

[3]  Tianying Chang,et al.  Scalable and efficient update dissemination for distributed interactive applications , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

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

[5]  Samir Khuller,et al.  Balancing Minimum Spanning and Shortest Path Trees , 1993, SODA.

[6]  Chungnan Lee,et al.  Supporting large-scale distributed simulation using HLA , 2000, TOMC.

[7]  Paul Francis,et al.  Yoid: Extending the Internet Multicast Architec-ture , 2000 .

[8]  Zhen Liu,et al.  Stateless Application-Level Multicast for Dynamic Group Communication , 2004, Eighth IEEE International Symposium on Distributed Simulation and Real-Time Applications.

[9]  kc claffy,et al.  Bandwidth estimation: metrics, measurement techniques, and tools , 2003, IEEE Netw..

[10]  Constantinos Dovrolis,et al.  Bandwidth requirement and state consistency in three multiplayer game architectures , 2003, NetGames '03.

[11]  Samir Khuller,et al.  Balancing minimum spanning and shortest path trees , 1993, SODA '93.

[12]  Jörg Widmer,et al.  Priority-based distribution trees for application-level multicast , 2003, NetGames '03.

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

[14]  Jun Yu,et al.  A fuzzy grouping mechanism for distributed interactive simulation , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[15]  Shervin Shirmohammadi,et al.  An end-to-end communication architecture for collaborative virtual environments , 2001, Comput. Networks.