A delay constrained distributed multicast routing algorithm
ICCC '95 Proceedings of the 12th international conference on computer communication on Information highways : for a smaller world and better living: for a smaller world and better living
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Multicast Communication on Network Computers
IEEE Software
Multicast routing with end-to-end delay and delay variation constraints
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
An efficient distributed multicast routing protocol with delay and delay variation constraints
ICCC '02 Proceedings of the 15th international conference on Computer communication
Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem
Knowledge-Based Systems
A fast and efficient multicast algorithm for QoS group communications in heterogeneous network
Computer Communications
On the Hardness of Approximating the Multicast Delay Variation Problem
IEEE Transactions on Computers
On fault tolerant ad hoc network design
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
On solving the rooted delay- and delay-variation-constrained steiner tree problem
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
| Hi-index | 0.25 |
We study the problem of constructing multicast trees for high-bandwidth delay-sensitive applications in a point-to-point communication network. This problem arise in real time multimedia applications, which often requires bounded end-to-end delay along paths from the source to each destination and bounded variations among the delays along these paths to ensure that data packets reaches the destinations without exceeding certain delay, failing which the user will experience jitters effect. This problem can be formulated as that of finding a minimum cost Steiner tree which satisfy the above-mentioned constraints and is known to be computationally intractable, being NP-complete. In this paper, we propose a new distributed algorithm, called the Distributed Delay and Delay Variation Bounded Multicast (DDVBM) algorithm for the problem. Empirical studies shows that our proposed algorithm performs very well in terms of cost and inter-destination delay variations of the solutions that it generates as compared to some existing algorithms.