Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications (DS-RT'06)
Priority based Overlay Multicast with Filtering Mechanism for Distributed Interactive Applications
Torremolinos (M?laga), Spain
October 02-October 04
ISBN: 0-7695-2697-7
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 can not 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.
Citation:
Jun Yu, Ling Chen, Gen-Cai Chen, "Priority based Overlay Multicast with Filtering Mechanism for Distributed Interactive Applications," ds-rt, pp.127-134, Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications (DS-RT'06), 2006