Sciweavers

Share
ICNP
2002
IEEE

Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup

9 years 4 months ago
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such as the routing of point-to-multipoint label switched paths in Multi-Protocol Label Switched (MPLS) Networks, and the provision of bandwidth guaranteed services under the “hose” model [4]. Failure backup implies that when a multicast tree is set-up alternate backup paths be also set-up so that the multicast is unaffected by single link or node failures. For dynamic routing, the multicast routing requests arrive one-by-one and there is no a priori knowledge regarding future requests. We believe that this is the first paper that addresses the issue of multicast routing with failure backup. Each multicast request consists of a source ×, a set of receivers Ê, and a bandwidth requirement . Offline multicast routing algorithms cannot be used since they require a priori knowledge of all multicast tunnel reques...
Murali S. Kodialam, T. V. Lakshman
Added 14 Jul 2010
Updated 14 Jul 2010
Type Conference
Year 2002
Where ICNP
Authors Murali S. Kodialam, T. V. Lakshman
Comments (0)
books