Bandwidth Allocation In Multicast Trees With QoS Constraints

Growth in continuous media applications and group communications highlight the need for efficient multicast support. In multicast tree construction and resource reservation a central problem is ensuring that the determined multicast tree can support specified QoS requirements economically. In this paper, we focus on this specific problem under a typical QoS requirement that end-to-end delays must not exceed a specified limit. For the resulting optimization problem, we develop a fast and efficient algorithm that is suitable for implementing a router to perform real time provisioning for multicast sessions.

[1]  George C. Polyzos,et al.  The multimedia multicasting problem , 1998, Multimedia Systems.

[2]  Bin Wang,et al.  Multicast routing and its QoS extension: problems, algorithms, and protocols , 2000 .

[3]  Donald F. Towsley,et al.  Call admission and resource reservation for multicast sessions , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[4]  Lixia Zhang,et al.  Resource ReSerVation Protocol (RSVP) - Version 1 Functional Specification , 1997, RFC.

[5]  Ian M. Leslie,et al.  How bad is naive multicast routing? , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[6]  G. Manimaran,et al.  Managing Group Dynamics and Failures in QoS , .

[7]  Bernard M. Waxman,et al.  Performance evaluation of multipoint routing algorithms , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[8]  Clyde L. Monma,et al.  Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions , 1990, Math. Oper. Res..

[9]  Fouad A. Tobagi,et al.  Optimum routing of multicast streams , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.