Resilient multipoint networks based on redundant trees

Connection-oriented packet forwarding technologies such as multiprotocol label switching (MPLS), generalized MPLS (GMPLS), and new entrant MPLS transport profile (MPLS-TP) are all evolving to meet the increasing demand for an efficient support of multicast applications like Internet Protocol television (IPTV) and multicast virtual private networks (VPNs). One of the biggest challenges ahead is to develop bandwidth-efficient and fault-resilient solutions for these services at a reasonable cost of complexity. Starting from the state-of-the-art and standards insights, we highlight the technical limitations of current approaches and pinpoint major open issues. Based on this analysis, we propose a point-to-multipoint based solution that overcomes previous drawbacks and fulfills transport requirements for carrier-grade environments. We also present the support required for this scheme in the emerging standards-based control protocols and data plane architectures.

[1]  Muriel Médard,et al.  Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs , 1999, TNET.

[2]  Stewart Bryant,et al.  A Framework for MPLS in Transport Networks , 2010, RFC.

[3]  Dimitri Papadimitriou,et al.  Recovery (Protection and Restoration) Terminology for Generalized Multi-Protocol Label Switching (GMPLS) , 2006, RFC.

[4]  Radim Bartos,et al.  A heuristic approach to service restoration in MPLS networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[5]  Dimitri Papadimitriou,et al.  Extensions to Resource Reservation Protocol - Traffic Engineering (RSVP-TE) for Point-to-Multipoint TE Label Switched Paths (LSPs) , 2007, RFC.

[6]  Dimitri Papadimitriou,et al.  Network Working Group Rsvp-te Extensions in Support of End-to-end Generalized Multi-protocol Label Switching (gmpls) Recovery , 2006 .

[7]  Jitender S. Deogun,et al.  Building Redundant Multicast Trees for Preplanned Recovery in WDM optical networks , 2006, J. High Speed Networks.

[8]  Li Chen,et al.  Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees , 2003, IEEE J. Sel. Areas Commun..

[9]  Michalis Faloutsos,et al.  An architecture for scalable, efficient, and fast fault-tolerant multicast provisioning , 2004, IEEE Network.

[10]  Alon Itai,et al.  The Multi-Tree Approach to Reliability in Distributed Networks , 1984, Inf. Comput..

[11]  Adrian Farrel,et al.  GMPLS Segment Recovery , 2007, RFC.

[12]  Dave Katz,et al.  BFD for Multipoint Networks , 2009 .

[13]  Murali S. Kodialam,et al.  Dynamic routing of bandwidth guaranteed multicasts with failure backup , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[14]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[15]  Alia Atlas,et al.  Fast Reroute Extensions to RSVP-TE for LSP Tunnels , 2005, RFC.

[16]  J. W. Suurballe Disjoint paths in a network , 1974, Networks.

[17]  Robert E. Tarjan,et al.  Computing an st -Numbering , 1976, Theor. Comput. Sci..

[18]  Jean-Louis Le Roux P2MP MPLS-TE Fast Reroute with P2MP Bypass Tunnels , 2008 .

[19]  Kireeti Kompella,et al.  BFD For MPLS LSPs , 2003 .

[20]  Preetha Thulasiraman,et al.  Disjoint Multipath Routing to Two Distinct Drains in a Multi-Drain Sensor Network , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.