Resilience-differentiation in programmable virtual networks

Abstract

Service and application requirements on network resilience have increased over the past few years. New on-line services such as e-commerce and connection-oriented interactive real-time services require higher network resilience than the more traditional off-line services. Programmable virtual networks promise fast and easy provisioning of new services but no consideration to meet the diverse resilience requirements has been made. This paper discusses issues related to resilience-differentiation in programmable virtual networks. A set of general guidelines is presented that apply to resilience-differentiation in programmable virtual network architectures. A case study is used to illustrate how the proposed guidelines can be met by extending an existing programmable virtual network architecture.

Resilience provisioning in provider-based overlay networks

“…The formulation does not take the residual link capacity into account when calculating the cost of setting up the service path. The objective function (6) assumes that all links have h units of residual bandwidth. Consequently if a link does not have enough residual bandwidth to accommodate the service path then the formulation produces a non-feasible solution.…”

“…These approaches offer an improved service compared to plain Internet connectivity but neither of them can offer any guaranteed levels of network availability, since they are built on top of Internet. The situation is different when the overlay network is constructed with virtual resources bought from a network provider, as in [6] [7]. Here, the network service availability is specified in service level agreements (SLAs) between the network provider and its customers and hence a certain level of resilience can be achieved.…”

Performance Analysis of Rejection Ratio in Cost Optimized Virtual Private Networks Provisioning Algorithm (COVPA) Using Waxman and Barabasi Model in Cyber Space

“…Resource allocation addresses the question of how much of the network resources to actually allocate for newly admitted flows so as to satisfy network-wide optimization objectives (Chu and Lea, 2009). Runtime enforcement ensures that the promised QoS guarantees are indeed delivered in a consistent manner throughout the lifetime of the flow and that the flow does not violate its traffic specifications (Rosenbaum et al, 2004;Baroncelli et al, 2007;Cavdar et al, 2008). Provisioning a virtual private network over a set of nodes gives rise to the general network design problem (Benhaddou and Alanqar, 2007;Zhang and Ionescu, 2010).…”