Providing resilient quality of service connections in provider-based virtual private networks

This thesis focuses on efficient provisioning of resilient Virtual Private Network (VPN) services. It first confirms the intuition that network resources can be more efficiently utilized when resilience mechanisms are implemented by a network provider in the physical network than by its VPN customers in their VPNs. Next, a Multiprotocol Label Switching-based programmable VPN architecture is presented that delivers virtual links as resilient quality of service (QoS) connections and virtual sites. Virtual sites allow customers to implement functionality like customized routing and content adaptation “in the cloud”, as opposed to the current network model where all functionality is implemented at the network edge. To provision a resilient QoS connection, two paths need to be computed from the ingress to the egress nodes, such that both paths meet the given QoS constraints. Two different frameworks have been proposed in the literature to compute resilient QoS connections when the QoS constraints are bandwidth and end-to-end delay. They both use a preprocessing step whereby either all links with less residual capacity than the given bandwidth constraint are pruned, or the given end-to-end delay is converted to an effective bandwidth. The frameworks thus reduce the problem to one with only a single constraint. We argue in this thesis that these frameworks individually lead to poor network utilization and propose a new framework where both constraints are considered simultaneously. Our framework exploits the dependency between endto-end delay, provisioned bandwidth and chosen path through using the provisioned bandwidth as a variable. Here, two link-disjoint paths are computed together with their respective minimum bandwidths such that both the bandwidth and end-to-end delay constraints are satisfied.

[1]  Jean-Yves Le Boudec,et al.  Application of Network Calculus to Guaranteed Service Networks , 1998, IEEE Trans. Inf. Theory.

[2]  Peter Steenkiste,et al.  Routing high-bandwidth traffic in max-min fair share networks , 1996, SIGCOMM 1996.

[3]  Norio Shiratori,et al.  QoS based routing algorithm in integrated services packet networks , 1997, Proceedings 1997 International Conference on Network Protocols.

[4]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[5]  P. Van Mieghem,et al.  A multiple quality of service routing algorithm for PNNI , 1998 .

[6]  Ivan Pepelnjak,et al.  MPLS and VPN Architectures , 2000 .

[7]  Ying Zhu,et al.  Multicast with network coding in application-layer overlay networks , 2004, IEEE J. Sel. Areas Commun..

[8]  Sanjay Jha,et al.  Failure-oriented path restoration algorithm for survivable networks , 2004, 2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507).

[9]  Qingming Ma,et al.  Routing traffic with qualityof-service guaraxttees in integrated services networks , 1998 .

[10]  Sanjay Jha,et al.  An analysis of virtual private network solutions , 2003, 28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings..

[11]  Thanh Vinh Nguyen,et al.  An architecture for carrier grade programmable networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[12]  Nick McKeown,et al.  A simulation study of IP switching , 1997, SIGCOMM '97.

[13]  Chen-Nee Chuah,et al.  Proactive vs reactive approaches to failure resilient routing , 2004, IEEE INFOCOM 2004.

[14]  Yu Liu,et al.  Approximating optimal spare capacity allocation by successive survivable routing , 2005, TNET.

[15]  Vishal Sharma,et al.  Framework for Multi-Protocol Label Switching (MPLS)-based Recovery , 2003, RFC.

[16]  Yakov Rekhter,et al.  BGP/MPLS VPNs , 1999, RFC.

[17]  Ariel Orda,et al.  Efficient algorithms for computing disjoint QoS paths , 2004, IEEE INFOCOM 2004.

[18]  Klara Nahrstedt,et al.  Routing with topology aggregation in delay-bandwidth sensitive networks , 2004, IEEE/ACM Transactions on Networking.

[19]  Chunming Qiao,et al.  On finding disjoint paths in single and dual link cost networks , 2004, IEEE INFOCOM 2004.

[20]  Marwan Krunz,et al.  Bandwidth-delay constrained path selection under inaccurate state information , 2003, TNET.

[21]  Dave Katz,et al.  Cisco Systems' Tag Switching Architecture Overview , 1997, RFC.

[22]  John Wroclawski,et al.  The Use of RSVP with IETF Integrated Services , 1997, RFC.

[23]  Lixia Zhang,et al.  VirtualClock: a new traffic control algorithm for packet-switched networks , 1991, TOCS.

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

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

[26]  Xipeng Xiao,et al.  Internet QoS: a big picture , 1999, IEEE Netw..

[27]  Sanjay Jha,et al.  Resilience-differentiation in programmable virtual networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[28]  Sanjay Jha,et al.  Dynamic routing of restorable QoS connections in MPLS networks , 2005, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l.

[29]  Jon Crowcroft,et al.  Bandwidth-delay based routing algorithms , 1995, Proceedings of GLOBECOM '95.

[30]  Robert D. Doverspike,et al.  Efficient distributed restoration path selection for shared mesh restoration , 2003, TNET.

[31]  Athina Markopoulou,et al.  Characterization of failures in an IP backbone , 2004, IEEE INFOCOM 2004.

[32]  Prasant Mohapatra,et al.  QRON: QoS-aware routing in overlay networks , 2004, IEEE Journal on Selected Areas in Communications.

[33]  Sanjay Jha,et al.  Resilience provisioning in provider-based overlay networks , 2005, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l.

[34]  Greg Minshall,et al.  Ip Switching: Atm under Ip * , 1998 .

[35]  David L. Mills,et al.  Scheme for an internet encapsulation protocol: Version 1 , 1991, RFC.

[36]  Peter Steenkiste,et al.  Quality-of-Service Routing for Traffic with Performance Guarantees , 1997 .

[37]  Amit Kumar,et al.  Algorithms for provisioning virtual private networks in the hose model , 2002, TNET.

[38]  Scott Shenker,et al.  Specification of Guaranteed Quality of Service , 1997, RFC.

[39]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[40]  Chengzhi Li,et al.  A Network Calculus With Effective Bandwidth , 2007, IEEE/ACM Transactions on Networking.

[41]  Kireeti Kompella,et al.  Detecting Multi-Protocol Label Switched (MPLS) Data Plane Failures , 2006, RFC.

[42]  Hiroshi Esaki,et al.  Toshiba's Flow Attribute Notification Protocol (FANP) Specification , 1997, RFC.

[43]  Simon Crosby,et al.  The Tempest: a framework for safe, resource-assured, programmable networks , 1998, IEEE Commun. Mag..

[44]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.