Sciweavers

Share
COMCOM
1998

Algorithms for delay-constrained low-cost multicast tree construction

8 years 5 months ago
Algorithms for delay-constrained low-cost multicast tree construction
With the proliferation of multimedia group applications, the construction of multicast trees satisfying Quality of Service QoS requirements is becoming a problem of prime importance. Multicast groups are usually classi ed as sparse or pervasive groups depending on the physical distribution of group members. They are also classi ed based on the temporal characteristics of group membership into static and dynamic groups. In this paper, we propose two algorithms for constructing multicast trees for multimedia group communication in which the members are sparse and static. The proposed algorithms use a constrained distributed unicast routing algorithm for generating low-cast, bandwidth and delay constrained multicast trees. These algorithms have lower message complexity and call setup time due to their nature of iteratively adding paths, rather than edges, to partially constructed trees. We study the performance in terms of call acceptance rate, call setup time, and multicast tree cost...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt
Added 21 Dec 2010
Updated 21 Dec 2010
Type Journal
Year 1998
Where COMCOM
Authors R. Sriram, Govindarasu Manimaran, C. Siva Ram Murthy
Comments (0)
books