Topology Abstraction Service for IP VPNs: Core Network Partitioning for Resource Sharing

Show more

1. Introduction

Topology abstraction (TA) as a VPN service has been described in [1]. The objective of such a service is to provide the core topology information in an abstracted manner to the VPNs. The motivation for this service is the following:

1) Providing TA information to the VPNs allows them to seek resources from the VSP with high degree of success.

2) In current provider networks, control plane scalability is a major concern. With TA service, as we will observe, the VPNs achieve very good crankback ratio performance compared to VPNs that are not provided with any form of abstraction. This gain is significant as it reduces the call processing burden on the VSP which would otherwise be required to process these calls.

In [1] we established the above two points using simulation analysis. In [1] we also explained the notion of TA as applicable to VPNs, proposed a framework to realize it and proposed SLA parameters that could be used to provide service differentiation. In [2] we addressed a problem called VPN capacity sharing problem encountered in the context of TA service to VPNs. The objective of the problem was to generate abstractions so that the available resource is exposed in a fair manner to the VPNs subscribing to the TA service. We proposed solutions to this problem using decentralized schemes. We proposed three schemes in this context: maximum capacity scheme, mixed-bound scheme, and Steiner tree scheme. These schemes assume that all the border nodes performing the abstraction have access to the entire core topology, and generate TA to its hosted VPNs independent of one another. This form of TA generation leads to inefficient resource utilization and poor call performance. This suggests the need for a centralized approach to combine all information and optimize resource allocation while maintaining fairness.

In this paper, we develop centralized schemes to partition the core network capacities, and assign each partition to a specific VPN for applying the decentralized abstraction schemes presented in [2]. The main difference between the centralized form of TA generation considered in this paper and the decentralized TA generation process discussed in [2] is the use of a central server (CS) owned by the VSP to compute a resource partition subgraph for each VPN. These subgraph partitions are distributed to the border nodes, which use them to generate the desired TA that is then flooded to the VPN customer edge (CE) nodes. A key advantage of this process of TA generation is that it mitigates the problem of oversubscription encountered in the decentralized mode of TA generation. In this paper, our goal is to develop scalable centralized schemes that can allocate resources efficiently and maintain fairness among all the VPNs. Some preliminary results along these lines were presented in [3].

The rest of the paper is organized as follows. In Section 2 graph theory notations used in this paper are introduced. In Section 3, a summary of the essential ideas on topology abstraction described in [2] is presented. In Section 4 VPN core capacity sharing problem is stated. In Section 5, partitioning schemes based on maximum concurrent flow (MConF) and the maximum multicommodity flow (MMCF) formulations are developed. In Section 6, approaches to improve the fairness of the partitions generated by the MMCF method are developed. We present in Section 7 results of extensive simulations conducted on several network topologies, and provide a comparative evaluation of the different schemes in terms of abstraction efficiency, fairness to VPNs and call performance characteristics.

2. Graph Theory Notations

We summarize in Table 1 graph theory notations used in this paper. They are explained with reference to the network in Figure 1. As in Figure 1, VSP’s core topology is represented as a graph
$G\left(V,E\right)$ . Each directed link of the network
${e}_{i,j}\in E$ has a capacity represented as
${t}_{i,j}$ (which we also denote as t(e)). This is the total capacity of the link. On the other hand, the capacity available on a link e at any given time is called residual capacity, denoted as
${r}_{i,j}$ (or r(e)). B represents the set of all border PE nodes in graph
$G\left(V,E\right)$ . U represents the set of all VPN customers subscribing to the TA service. Each border node
$b\in B$ may support multiple VPN instances identified as U_{b}. For a VPN instance
$u\in U$ , we represent the sets of corresponding CE and PE nodes as C_{u} and P_{u}, respectively. The set of CE nodes corresponding to a VPN instance
$u\in U$ hosted on a border node b is represented as
${C}_{u,b}$ . The “P” nodes in Figure 1 are the provider nodes, which only participate in routing or switching the traffic.

3. Summary of Previous Work [2]

In this section we give a brief review of [2] where a detailed discussion of the topology abstraction (TA) service and decentralized topology abstraction algorithm are given.

TA Service SLA Definition and Parameters

First, to enable a VSP to use TA service for generating service differentiation among the VPN customers, in [2] a new set of topology abstraction SLA (TA-SLA) parameters, which allows the VSP to customize the properties of the TA service to the requirements of the VPN is proposed. We next discuss the elements of the TA-SLA.

Abstraction topology type parameter. This parameter represents the type of abstract topology generated by the VSP for a VPN. The VSP uses this parameter

Figure 1. VSP providing TA service to two VPNs.

Table 1. Graph theory notations.

to generate an abstract graph with a certain granularity before sharing it with the VPN. The optimizing objective for any form of TA is to minimize the complexity with respect to the granularity of the abstraction, while at the same time, maximizing the accuracy of the topology metric information that is being abstracted. Three forms of abstract topologies, namely source-star abstraction (SSA), star abstraction (SA), and simple node abstraction (SNA), which are also the most well-studied forms of abstractions in the context of hierarchical routing literature and used in [2].

Figures 2(a)-(c) show these three types of abstract topologies. Among these the SSA type topology provides the finest granularity. Once a SSA type topology is generated, the other two can be generated through information aggregation. So we focus on the SSA type.

The SSA type of abstraction, illustrated in Figure 2(a), has been adapted from [2]. In this case, a VPN is provided an abstraction that is a source-rooted tree. Here, the root of the tree is the PE node computing the abstraction for the corresponding VPN. The other nodes of the source-star topology are the PE nodes P_{k} on which VPN of the same type is hosted. In the case where a CE node has adjacency with more than one PE node, multiple source-star abstractions would have to be provided to the CE node in order to take advantage of the routing

Figure 2. (a) Source-star abstraction topology; (b) Star abstraction topology; (c) Simple node abstraction topology.

diversity due to multiple PE connectivity. For the case of single CE-PE connectivity and for a given VPN k, the total message complexity of updating a CE is $O\left(\left|{P}_{k}\right|+\left|{C}_{k}\right|\right)$ .

Abstract topology link metric. This parameter identifies the choice of QoS metric information that is required to be associated with the virtual links of the abstract topology chosen as part of the abstraction topology type parameter. It is not necessary that all the VPNs subscribe the same set of QoS metric information. The choice of QoS metrics associated with the abstract topology could be determined by the purpose for which the TA service will be used for. Here, we use only one metric, namely available bandwidth. The virtual link metric associated with the nodes x and y for a VPN k of the abstracted graph ${G}_{k,l}\left({V}_{k},{E}_{k}\right)$ is represented as ${w}_{k,l}\left(x,y\right)$ .

Abstract topology refresh interval metric. The importance of this parameter is linked to the fact that the VSP provides periodic updates about resource availability by flooding the TA periodically in order to synchronize the core state information with that of the VPN’s view of the core network. From this, we can see intuitively that the choice of this parameter decides the correctness of the TA information at any given point of time in relation to the link state of the VSP’s core network. In a dynamic call request scenario, the ideal refresh rate (inverse of the refresh interval) desired by a VPN is expected to be a function of the mean arrival rate of bandwidth requests, dynamic nature of the state information in the core network, which will depend on factors like the load offered by all the VPNs and time of day, and the tolerance for the control overhead by the CE routers due to the frequency of update of abstraction information from the PE nodes. The abstract topology refresh rate negotiated by the VPN is also influenced by both the abstraction topology type and the abstract topology link metric chosen by the VPN.

Performance metrics. One of the significant benefits of abstracting VSP’s core network and QoS information is to improve the call performance of the VPNs that require dynamic bandwidth service, while minimizing the overhead for sharing such information with the VPNs. Three call performance metrics have been defined to study the efficiency of the TA service, which are success, crankback, and misscall ratios. These metrics are explained with respect to Figure 3 which shows the different possibilities of a bandwidth request from a VPN.

Starting from the root, denoted as (1), a VPN call request could have two possible outcomes. The first outcome is when a CE node finds that the requested

Figure 3. VPN call request scenarios.

capacity is not available and terminates the call locally. This is identified as (3). The second outcome is that the CE node finds that the requested capacity is available and sends the request to the corresponding PE node (2). For the case (3), we could have two possibilities. The first possibility is that the call has been wrongly terminated due to stale abstraction information, in which case we count it as a “Miss” call (6). The alternative possibility is that the call has been correctly terminated because of the VSP’s inability to find the required path in the core network. We label such a call as a “Hit” call (7). For the case where a path is deemed to exist by the VPN, there can be two outcomes. The first is that the call does go through to the destination and the CE node receives a positive acknowledgement from the PE (4). The other is that the call crankbacks because of the inability of the PE node in the VSP to route the call (5). Crankbacked calls also waste signaling processing resources for the VSP. Success ratio measures the percentage of correct decisions in terms of both successfully computing a path (with successful signaling) and rejecting the call locally using the abstraction provided by the VSP. Crankback ratio measures the percentage of calls that resulted in successful path computation locally but is cranked back by the VSP. Misscall ratio measures the proportion of calls which were terminated wrongly at the VPN’s end, in spite of sufficient resources in the core network to satisfy the call. For each VPN, success ratio is to be maximized while crankback and miscall ratio are to be minimized. These metrics are summarized below.

Success ratio. The success ratio is a measure of a VPN making a right routing decision using the abstraction provided to it by the VSP. This includes successful calls and the hit calls. The availability of the requested capacity is verified by recomputing the path with the exact state of the network

$\text{Success Ratio}=\frac{\text{Number of calls}\left(\text{correctly accepted}+\text{calls correctly rejected}\right)}{\text{Total number of calls}}$

Crankback ratio. A call would crank back, if there were no feasible path with the requested capacity in the core. The crankback ratio is defined as the ratio of the number of calls that have been cranked back to the total number of path requests made by the VPN

$\text{CrankBack Ratio}=\frac{\text{Number of calls cranked back}}{\text{Total number of calls}}$

Misscall ratio. The misscall ratio is the ratio of calls that have been wrongly terminated locally at the VPN’s end (even though there is enough resource to accommodate the call) to the total number of calls originated by the VPN; ideally, a successful TA service implementation should have a miss call ratio of zero

$\text{MissCall Ratio}=\frac{\text{Number of wrongly rejected calls}}{\text{Total number of calls}}$

Average network utilization. This metric refers to the ratio of total link capacity utilized by active VPN bandwidth requests (aggregate utilized link capacity) to the total link capacity (aggregate link capacity)

$\text{Average Network Utilization}=\frac{\text{Aggregate utilized link capacity}}{\text{Aggregate link capacity}}$

To generate the TA for the VPNs, we assume the availability of the entire core network topology, locally in a border node. In addition, the algorithms also require VPN specific information, which would include information about the VPNs hosted on each border node, along with the residual capacity of the VPN access link connecting the PE and the CE nodes. The core topology information is readily available as part of link state protocols, such as OSPF or ISIS, which are the protocols of choice in most VSP networks. The VPN specific information required by the abstraction schemes can be obtained from a TA service specific database populated by appropriate protocol extensions that include VPN membership information and the associated TA-SLA parameters discussed earlier. This information can be either locally available at the PE node or accessed centrally from a centralized database.

Fairness. An important factor to consider during the abstraction process is the TA-SLA parameters, particularly the abstraction topology type parameter to offer service differentiation. To enable this service differentiation, we assume that the VSP adopts a model where the goal is to always expose the available capacity differently to different types of TA while exposing the available capacity equally among all the VPNs that have subscribed to the same abstract topology type parameter T_{k}. This fairness policy is applied locally by each border node b, while generating abstract topologies for the set of VPNs U_{b} hosted by it. The criterion we adopt can be stated as follows: For a pair of VPNs
$\left(i,j\right)\in {U}_{b}$ with the same abstract topology type parameter l, with abstract graphs
${G}_{i,l}\left({V}_{i},{E}_{i}\right)$ and
${G}_{i,l}\left({V}_{j},{E}_{j}\right)$ and with a common pair of nodes x and y, the VSP imposes the rule that the exposed capacity associated with virtual link connecting the nodes x and y should be equal, that is
${w}_{i,l}\left(x,y\right)={w}_{j,l}\left(x,y\right)$ . This ensures that two VPNs with the same TA type will be exposed the same amount of bandwidth for each virtual link connecting the nodes x and y in the abstract topology.

Topology abstraction problem and abstraction algorithms. The challenge faced during the abstract topology generation process is the fact that the process of generating TAs may lead to oversubscription of the available core resource, which could result in poor VPN call performance and high signaling cost for VSPs under high load conditions. Oversubscription results because of two reasons: first due to the decentralized approach of TA generation wherein each border node generates TAs for the VPNs without coordinating with one another; second, the degree of oversubscription also depends on the abstraction algorithm that is used to generate the abstraction for each VPN by a border node. The VPN-TA problem stated next is to address the problem of oversubscription arising due to the second factor in a decentralized context of TA generation. The objectives of this problem are the following:

1) Provide the VPNs with an accurate representation of available capacity considering the case of having to satisfy simultaneous VPN calls during high load condition. This objective also correlates with the objective of maximizing the call performance of the VPNs.

2) Maximize utilization of the VSP core network.

3) Generate fair abstraction which aligns with the fairness policy presented earlier.

VPN topology abstraction (VPN-TA) problem. Given a set of VPNs U_{b} hosted on the border node b, each VPN instance
$i\in {U}_{b}$ is to be provided with an abstract topology
${G}_{i,l}\left({V}_{i},{E}_{i}\right)$ . The objective is to device a methodology to allocate virtual capacities to the links in E_{i} so that the VSP maximizes the probability of each VPN making a correct decision of successfully computing or rejecting a path locally in the context of the TA service.

In [2] three algorithms for the above problem are proposed. All the three abstraction schemes have been proposed to maximize the call success ratio. The three schemes vary in their nature from being aggressive or conservative in terms of associating virtual capacity to the link in the abstract topology. The nature of these algorithms leads to different performance results varying in tradeoffs between the three call performance metrics, i.e., the success, crankback, and misscall ratio.

4. VPN Capacity Sharing Problem

As part of the TA service, each VPN is served with an abstract topology of type l. We discussed different types of abstract topologies in [1] ; they are source-star (SSA), star, and simple node abstract topologies. The topology of the latter two types can be generated from the first type through an information aggregation process which results in information loss and therefore differentiated services as discussed in [1]. In this paper we discuss TA generation with respect to SSA, the difference in performance when star or simple node forms of abstraction is chosen by a VPN should be similar to that discussed in [1]. Different from [1] , the abstract topology for a VPN u will be derived from a partition subgraph denoted as $S\left({V}_{u},{E}_{u}\right)$ . Centralized schemes to generate these partition subgraphs are the main focus of this paper. With this in view, we now define the VPN core capacity sharing problem. We start with a restatement of the objectives.

First, the goal of a TA service is to enable better call performance to the VPNs making dynamic capacity requests; in other words, the goal is to maximize call performance. We use the VPN success ratio as a parameter to measure VPN call performance. This parameter is a measure of making right bandwidth request decisions by a VPN using the abstraction provided to it by the VSP. This includes the calls that are computed and signaled successfully by the CE node as well those rejected correctly by the VPN locally. The local call rejections happen due to insufficient resources to accommodate the VPN call request because of increased load conditions.

The second objective is to ensure the best possible use of the VSP’s available core capacity resource. Hence, the objective is also to maximize a VSP’s network utilization. This also correlates with the goal of maximizing the revenue generated out of the TA service.

The third criterion we consider while computing partition subgraphs for the VPNs is to ensure that the schemes are fair to all the VPNs. This fairness policy requires that we expose the available capacity equally to all the VPNs that have the same abstract topology type T_{k}, while maintaining the desired property that different abstract topology types result in different service levels. Considering these objectives, we define the VPN core capacity sharing problem.

VPN core capacity sharing problem (VPN-CS). Given a graph $G\left(V,E\right)$ representing the VSP’s core network that provides topology abstraction service to the set of VPNs, U, the objective is to compute fair partitions $S\left({V}_{u},{E}_{u}\right)$ for each VPN $u\in U$ of the network so as to maximize the VPN call success ratio and core network utilization. If ${x}_{e}^{u}$ represents the resource identified as part of subgraph $S\left({V}_{u},{E}_{u}\right)$ on edge $e\in E$ and for VPN $u\in U$ , then ${\sum}_{u\in U}{x}_{e}^{u}}\le t\left(e\right),\forall e\in E$ must be satisfied.

5. Multicommodity Flow Formulation of the VPN-CS Problem

In view of the relationship between the maximization objectives of the VPN-CS problem and the total abstracted capacity considered during the partitioning phase (that is, the sum of the link capacities of the partition graphs
$S\left({V}_{u},{E}_{u}\right)$ for each
$u\in U$ ), we first present a multicommodity flow formulation that maximizes the total abstracted capacity. The fairness criterion discussed in Section 3 is also incorporated in this formulation. In this formulation, K_{v} represents the set of all source-destination pairs of VPN
$v\in U$ derived from the set P_{v}. We define the set of commodities K as the set of all the VPN commodities, i.e.
$K=\left\{{K}_{v}|\forall v\in U\right\}$ . Let the net flow achieved for each source-destination commodity
$k\in {K}_{v}$ of VPN v be
${f}_{v,k}$ . The variable
${x}_{i,j}^{v,k}$ denotes the logical resource assigned to source-destination pair
$\left({s}_{k},{d}_{k}\right)\in {K}_{v}$ on an edge
$\left(i,j\right)\in E$ . Using these definitions, the VPN-CS problem can be formulated as in (1)-(5) with the objective of maximizing the aggregate resources considered as part of the subgraph partitions.

Formulation for VPN Core Capacity Sharing Problem

$\text{Maximize}\underset{v\in U}{{\displaystyle \sum}}\underset{k\in {K}_{v}}{{\displaystyle \sum}}\underset{\left(i,j\right)\in E}{{\displaystyle \sum}}{x}_{i,j}^{v,k}$

$s.t.\text{\hspace{0.17em}}{\displaystyle {\sum}_{\left(i,j\right)\in E}{x}_{i,j}^{v,k}}-{\displaystyle {\sum}_{\left(j,i\right)\in E}{x}_{j,i}^{v,k}}={f}_{v,k},\forall v\in U,k\in {K}_{v},i={s}_{k}$ (1)

${\sum}_{\left(i,j\right)\in E}{x}_{i,j}^{v,k}}-{\displaystyle {\sum}_{\left(j,i\right)\in E}{x}_{j,i}^{v,k}}=0,\forall v\in U,k\in {K}_{v},i\ne {s}_{k},i\ne {d}_{k$ (2)

${\sum}_{\left(i,j\right)\in E}{x}_{i,j}^{v,k}}-{\displaystyle {\sum}_{\left(j,i\right)\in E}{x}_{j,i}^{v,k}}=-{f}_{v,k},\forall v\in U,k\in {K}_{v},i={d}_{k$ (3)

${\sum}_{v\in U}{\displaystyle {\sum}_{k\in {K}_{v}}{x}_{i,j}^{v,k}}}\le {t}_{i,j},\forall \left(i,j\right)\in E$ (4)

${f}_{{v}_{1},k}-{f}_{{v}_{2},k}=0,\forall {s}_{k},{d}_{k}\in B,\forall \left({v}_{1},{v}_{2}\right)\in Z\left({s}_{k},{d}_{k}\right)$ (5)

${x}_{i,j}^{v,k}\ge 0,{f}_{v,k}\ge 0$

In the formulation, (1)-(3) enforce the supply-demand conservation condition for each VPN commodity. (4) enforces the capacity constraint for each edge of the core graph. (5) enforces the fairness constraint during the subgraph partition computation process with the goal of sharing resources equally among all the VPNs. We define $Z\left(s,d\right)$ as the set of VPNs having a common source-destination border node pair $\left(s,d\right)$ . The constraint (5) ensures equal sharing of resources by enforcing the aggregate flow, i.e., ${f}_{{v}_{1},k},{f}_{{v}_{2},k}$ for any two VPNs ${v}_{1},{v}_{2}\in Z\left({s}_{k},{d}_{k}\right)$ to be equal. The optimum flow values ${x}_{i,j}^{v,k}$ define the capacity of the link $\left(i,j\right)$ in the partition graph for each $v\in U$ and commodity k. The worst case scenario of the formulation can be assessed assuming that all the VPNs in U are hosted on all the border nodes in B. In this case, the number of variables in the formulation is $O\left(\left|E\right|\times \left|U\right|\times {\left|B\right|}^{2}+\left|U\right|\times {\left|B\right|}^{2}\right)$ , and the number of possible constraints would be in the order of $O\left(\left|U\right|\times {\left|B\right|}^{2}\times \left|V\right|+{\left|U\right|}^{2}\times {\left|B\right|}^{2}\right)$ . Since the goal of the TA service is to enable dynamic bandwidth requests based on a topology abstraction in smaller time scales, solving the problem to optimality for large numbers of variables and constraints as in the above formulation using linear programming tools will not be efficient. So, we propose solutions based on a variant of the multicommodity flow problem, namely, the maximum concurrent flow (MConF) problem, whose objective is to maximize the aggregate commodity flow, while ensuring fairness among commodity flows.

5.1. Maximum Concurrent Flow Formulation of the VPN-CS Problem

The MConF problem is defined as follows. Given a network $G\left(V,E\right)$ and a set K of source-destination pairs $\left({s}_{i},{d}_{i}\right),i=1,2,\cdots ,\left|K\right|$ , assume that demands $D\left({s}_{i},{d}_{i}\right),\forall i=1,2,\cdots ,\left|K\right|$ are known. The objective of the MConF problem is to maximize the factor β such that there exists a flow that satisfies the demand $\beta \times D\left({s}_{i},{d}_{i}\right),\forall i=1,2,\cdots ,k$ . The node-link formulation of the MConF problem is as follows.

Maximum Concurrent Flow (MConF) Formulation

$\text{Maximize}\text{\hspace{0.17em}}\beta $

$s.t.\text{\hspace{0.17em}}{\displaystyle {\sum}_{\left(i,j\right)\in E}{x}_{i,j}^{k}}-{\displaystyle {\sum}_{\left(j,i\right)\in E}{x}_{j,i}^{k}}=\beta \times D\left({s}_{k},{d}_{k}\right),\forall k\in {K}_{v},i={s}_{k}$ (6)

${\sum}_{\left(i,j\right)\in E}{x}_{i,j}^{k}}-{\displaystyle {\sum}_{\left(j,i\right)\in E}{x}_{j,i}^{k}}=0,\forall k\in {K}_{v},i\ne {s}_{k},i\ne {d}_{k$ (7)

${\sum}_{\left(i,j\right)\in E}{x}_{i,j}^{k}}-{\displaystyle {\sum}_{\left(j,i\right)\in E}{x}_{j,i}^{k}}=-\beta \times D\left({s}_{k},{d}_{k}\right),\forall k\in {K}_{v},i={d}_{k$ (8)

${\sum}_{k\in E}{x}_{i,j}^{k}}\le {t}_{i,j},\forall \left(i,j\right)\in E$ (9)

${x}_{i,j}^{k}\ge 0,\beta \ge 0$

The value of β is called the throughput of the maximum concurrent flow formulation. The objective of the MConF problem enforces fairness by satisfying the same fraction of the demand for all the commodities, which is also in line with the fairness policy discussed in Section 3.

With regard to the solution for the MConF problem for online implementation, [4] proposed the first approximation algorithm for the MConF problem for networks with equal demands and undirected edges. Several researchers have since proposed enhancements to this algorithm in order to improve its complexity on the generalized version of the problem with arbitrary capacities. Later, Garg and Konemann [5] proposed a simple approximation algorithm to the MConF problem. Fleischer [6] presented improvements to the maximum concurrent flow approximation algorithm proposed in [5] , with better running time complexity, particularly, when the graph is sparse and has a larger number of commodities satisfying the condition $\left|K\right|>\left|E\right|/\left|V\right|$ .

Applying MConF to VPN-CS problem is not straight forward for two reasons. First, the commodity demands $D\left({s}_{k},{d}_{k}\right)$ for the VPN-CS problem are not known a priori. Secondly, if the commodity is defined for each VPN $v\in U$ and source-destination commodity $k\in {K}_{v}$ , the complexity of the number of commodities would be $O\left(\left|U\right|\times {\left|B\right|}^{2}\right)$ , which may not be scalable for online implementation.

We address these two concerns as follows. Since one of the objectives of VPN-CS problem is to maximize the link resources considered during the partitioning phase, we initialize $D\left({s}_{k},{d}_{k}\right)$ to $\alpha \left(k\right)$ , where $\alpha \left(k\right)$ is the maximum flow between the source-destination pair $\left({s}_{k},{d}_{k}\right)$ . In order to reduce the complexity of the execution time and memory requirement, we propose a two step optimization approach. The first step is to apply the MConF formulation on an aggregated set of source-destination pairs. For this scheme, we define a commodity k in the aggregated version as source-destination border node pair $\left(s,d\right)$ that has a potential VPN bandwidth request from s to d. This is the case if the source-destination border nodes s and d host at least one common VPN; in this case, it will satisfy the criteria $\left|\left({U}_{s}\cap {U}_{d}\right)\right|\ge 1$ . This aggregation of commodities reduces commodity complexity to $O\left({\left|B\right|}^{2}\right)$ . With this simplification, we propose a centralized heuristic to be executed by the CS in order to solve the VPN-CS problem as shown in the pseudo code in Algorithm 1.

Based on our previous discussion, Lines 1 - 11 are self-explanatory. Lines 12 - 16 iterate over each commodity
$k\in K$ . For each commodity k and the set of VPNs
$v\in Z\left({s}_{k},{d}_{k}\right)$ sharing the source-destination pair (s_{k}, d_{k}), we set the logical capacity
${x}_{i,j}^{v,k}$ over link
$\left(i,j\right)$ for VPN
$v\in Z\left({s}_{k},{d}_{k}\right)$ equal to
${x}_{i,j}^{k}/\left|Z\left({s}_{k},{d}_{k}\right)\right|$ ; this means we divide the MConF edge flow
${x}_{i,j}^{k}$ equally among all the VPNs
$v\in Z\left({s}_{k},{d}_{k}\right)$ . Lines 12 - 16 are in line with our policy of sharing link resources fairly among the set of VPNs
$Z\left({s}_{k},{d}_{k}\right)$ whose flows share a link; another step of fairness is applied by the border nodes, as per [1] , when the final abstractions are generated. Lines 17 - 19 use the capacities logically partitioned for each of the VPN
$v\in U$ on each link
$\left(i,j\right)\in E$ in order to realize the VPN subgraph
$S\left({V}_{v},{E}_{v}\right)$ , which is obtained by constructing a subgraph with positive edge flows assigned for VPN v. Once
$S\left({V}_{v},{E}_{v}\right)$ is determined, it is then distributed to the nodes in
${P}_{v}$ (those border nodes hosting VPN v) as in Lines 20 - 22.

Algorithm 1. MConF based partitioning heuristic for VPN core capacity sharing problem.

The partition subgraphs will be used by the PE nodes to generate TAs using the abstraction schemes in [2].

For online implementation, [6] proposes the fastest ϵ-approximation algorithm for the MConF problem; this can be applied in Line 11 of the MConF based heuristic. With respect to the complexity of the MConF based partitioning scheme, it is dominated by Lines 4 - 6 and 11, which results in the overall complexity of $O\left({\u03f5}^{2}\left|E\right|\times \left(\left|E\right|+\left|K\right|\right)+\left|K\right|\times {\left|V\right|}^{3}\right)$ .

5.2. Multicommodity Flow Based Formulation of the VPN-CS Problem

We now draw attention to a drawback of the MConF based partitioning scheme and propose an approach based on the maximum multicommodity flow (MMCF) theory in order to address it. Figure 4 shows a VSP core network. Let us consider three commodities $k\left(1\right)=P{E}_{1},P{E}_{4}$ , $k\left(2\right)=P{E}_{1},P{E}_{2}$ , and $k\left(3\right)=P{E}_{3},P{E}_{2}$ .

The throughput achieved by the MConF formulation with the values of the commodities set to their maximum flow values of $\left\{20,15,5\right\}$ is $\beta =0.5$ , and the aggregate commodity flow (which is the sum of flows between the three source-destination pairs) is 20 units. This happens because the edges of the paths corresponding to a commodity’s maximum flow are also shared by other commodities, which results in $\beta <1$ forcing the same fraction of the demand to be satisfied for all the commodities. Through observation, we can see that the aggregate commodity flow, which can be achieved when the flows of each commodity are increased independently, is 25 units. This inefficiency can be addressed by maximizing the sum of the independent commodity flows; in other words, we use the objective of maximizing ${\sum}_{k}{\beta}_{k}\times D\left({s}_{k},{d}_{k}\right)$ . The modified MconF (M-MConF) problem is stated next.

Modified Maximum Concurrent Flow (M-MConF) Formulation

$\text{Maximize}\text{\hspace{0.17em}}{\displaystyle \underset{k}{\sum}{\beta}_{k}\times D\left({s}_{k},{d}_{k}\right)}$

Subject to:

${\sum}_{\left(i,j\right)\in E}{x}_{i,j}^{k}}-{\displaystyle {\sum}_{\left(j,i\right)\in E}{x}_{j,i}^{k}}={\beta}_{k}\times D\left({s}_{k},{d}_{k}\right),\forall k\in K,i={s}_{k$ (10)

${\sum}_{\left(i,j\right)\in E}{x}_{i,j}^{k}}-{\displaystyle {\sum}_{\left(j,i\right)\in E}{x}_{j,i}^{k}}=0,\forall k\in K,i\ne {s}_{k},i\ne {d}_{k$ (11)

${\sum}_{\left(i,j\right)\in E}{x}_{i,j}^{k}}-{\displaystyle {\sum}_{\left(j,i\right)\in E}{x}_{j,i}^{k}}=-{\beta}_{k}\times D\left({s}_{k},{d}_{k}\right),\forall k\in K,i={d}_{k$ (12)

${\sum}_{k\in K}{x}_{i,j}^{k}}\le {t}_{i,j},\forall \left(i,j\right)\in E$ (13)

${x}_{i,j}^{k}\ge 0,\beta \ge 0$

Replacing ${\beta}_{k}\times D\left({s}_{k},{d}_{k}\right)$ by ${f}_{mc}\left(k\right)$ in the MMConF formulation we get the following equivalent maximum multicommodity flow formulation whose objective is to maximize the total flow for all the commodities. The node-link MMCF formulation is as follows:

Figure 4. Example demonstrating MConF drawback.

Maximum Multicommodity Flow (MMCF) Formulation.

$\text{Maximize}\underset{k\in K}{{\displaystyle \sum}}{f}_{mc}(k)$

Subject to:

${\sum}_{\left(i,j\right)\in E}{x}_{i,j}^{k}}-{\displaystyle {\sum}_{\left(i,j\right)\in E}{x}_{j,i}^{k}}={f}_{mc}\left(k\right),\forall k\in K,i={s}_{k$ (14)

${\sum}_{\left(i,j\right)\in E}{x}_{i,j}^{k}}-{\displaystyle {\sum}_{\left(i,j\right)\in E}{x}_{j,i}^{k}}=0,\forall k\in K,i\ne {s}_{k},i\ne {d}_{k$ (15)

${\sum}_{\left(i,j\right)\in E}{x}_{i,j}^{k}}-{\displaystyle {\sum}_{\left(i,j\right)\in E}{x}_{j,i}^{k}}=-{f}_{mc}\left(k\right),\forall k\in K,i={d}_{k$ (16)

${\sum}_{k\in K}{x}_{i,j}^{k}}\le {t}_{i,j},\forall \left(i,j\right)\in E$ (17)

${x}_{i,j}^{k}\ge 0,\beta \ge 0$

Here, ${f}_{mc}\left(k\right)$ is the aggregate MMCF flow variable corresponding to commodity k. The objective of MMCF is to maximize the total commodity flow. As in previous formulations, (14)-(16) represent the supply-demand constraints and (17) the capacity bound for edge $\left(i,j\right)\in E$ . Next, we propose in Algorithm 2 a MMCF based heuristic to solve the VPN-CS problem.

As in the case of the MConF based partition generation scheme, MMCF begins in Lines 1 - 3 by initializing the set $Z\left(s,d\right)$ for all potential source-destination pairs $\left(s,d\right)\in B$ ; this is then used to determine the commodity set K. Line 4 solves the MMCF problem. For an online implementation, the ϵ-approximation algorithm from [6] can be applied. This results in partitions associated with aggregate source-destination commodity ${x}_{i,j}^{k},\forall k\in K$ and $\left(i,j\right)\in E$ . Lines 5 - 15 are similar to the fair partitioning process discussed with respect to the MConF based partitioning solution. The MMCF heuristic is expected to achieve better network utilization compared to MConF heuristic; this is due to an increase in aggregate edge capacity considered during the partitioning process. For an online implementation, the overall complexity of this heuristic is dominated by Line 4, where we apply the ϵ-approximation algorithm presented in [6] , which results in a complexity of $O\left({\u03f5}^{2}\left|E\right|\left(\left|E\right|+\left|V\right|\times \mathrm{log}\left|E\right|\right)\mathrm{log}\left(\left|V\right|\right)\right)$ .

Algorithm 2. MMCF based partitioning heuristic for VPN core capacity sharing problem.

6. Improving Fairness of MMCF Partitioning Scheme

Though the MMCF based partitioning scheme maximizes the aggregate flow, it may not achieve the desired objective of maximizing ${\beta}_{k}$ for each commodity k in a fair manner. Hence, the final ${\beta}_{k}$ values may end up being very optimistic for a few commodities and conservative for others, which leads to unfair resource partitioning among the commodities. Since the goal of maximizing the VPN success ratio also requires partitioning the network capacity as fairly as possible among all the VPNs, we define another problem called the fair partitioning problem, whose goal is to improve the fairness of the commodity flows obtained by using the MMCF based partitioning scheme. This problem can be stated as follows.

Fair Partitioning Problem: Given a solution for the VPN-CS problem with individual commodity flows ${f}_{mc}\left(k\right),\forall k\in K$ , the fair partitioning problem is intended to rearrange the path flows for each commodity so as to minimize $\left|{f}_{mc}\left(i\right)/\alpha \left(i\right)-{f}_{mc}\left(j\right)/\alpha \left(j\right)\right|,\forall i,j\in K$ .

The goal of the fair partitioning problem is to minimize the difference between the ratio of flow achieved from the MMCF solution and the maximum flow between any pair of commodities. In order to achieve this, we propose modified MMCF formulations called the bounded MMCF formulations suitable for offline implementation and a flow balancing algorithm for online implementation in dynamic environments.

Both the offline and online improvements to be proposed will be based on balancing commodity flows obtained from MMCF based heuristic. We begin by first dividing the set of commodities K into the deficit set ( ${\Omega}_{d}$ ) and the excess set ( ${\Omega}_{e}$ ) based on the fraction of maximum flow $\alpha \left({s}_{k},{d}_{k}\right)$ achieved by the MMCF solution as discussed next. The sets are derived by first normalizing the aggregate MMCF commodity flow ${f}_{mc}\left(k\right)$ with its corresponding maximum flow $\alpha \left(k\right)$ . From this, the set ${S}_{K}={f}_{mc}\left(k\right)/\alpha \left(k\right),\forall k\in K$ is defined. We next define a threshold value σ as follows: Let ${S}_{\mathrm{min}}=\mathrm{min}\left\{{S}_{K}\right\}$ and ${S}_{\mathrm{max}}=\mathrm{max}\left\{{S}_{K}\right\}$ . σ is set to $\left({S}_{\mathrm{min}}+{S}_{\mathrm{max}}\right)/2$ . The threshold σ is then used to divide set K into sets ${\Omega}_{e}$ and ${\Omega}_{d}$ as follows: ${\Omega}_{d}=\left\{k|k\in K,{S}_{k}\le \sigma \right\}$ , ${\Omega}_{e}=\left\{k|k\in K,{S}_{k}>\sigma \right\}$ . Applying this definition of deficit and excess commodity sets, we next discuss the bounded MMCF formulation and the flow balancing algorithm in order to address the fair partitioning problem.

6.1. Bounded MMCF Formulation

This formulation retains the objective of the MMCF formulation but adds more constraints in the form of lower and upper bounds to the excess and deficit commodity elements with the goal of reducing the imbalance among commodity flows. Introducing such bounds enables us to achieve a minimum level of fairness for each deficit commodity without allowing the flows of the excess commodities to fall below a certain threshold flow. We represent the upper and lower bound flows of commodity $e\in {\Omega}_{e}$ as ${\Phi}_{e,l}$ and ${\Phi}_{e,u}$ , respectively, and those for commodity $d\in {\Omega}_{d}$ as ${\Phi}_{d,l}$ and ${\Phi}_{d,u}$ . The modified MMCF formulation applying the new constraints can be stated as follows.

In the formulation, ${f}_{b}\left(k\right)$ is the aggregate commodity balanced flow resulting from solving the problem. As can be seen from this formulation the new constraints, i.e. (21) and (22), are the lower and upper bound constraints on the flows of the excess and deficit commodities, whose initialization we discuss next.

Bounded MMCF formulation for Fair Partitioning Problem:

$\text{Maximize}\text{\hspace{0.17em}}\underset{k\in K}{{\displaystyle \sum}}\text{\hspace{0.05em}}{f}_{b}(k)$

Subject to:

${\sum}_{\left(i,j\right)\in E}{x}_{i,j}^{k}}-{\displaystyle {\sum}_{\left(j,i\right)\in E}{x}_{j,i}^{k}}={f}_{b}\left(k\right),\forall k\in K,i={s}_{k$ (18)

${\sum}_{\left(i,j\right)\in E}{x}_{i,j}^{k}}-{\displaystyle {\sum}_{\left(j,i\right)\in E}{x}_{j,i}^{k}}=0,\forall k\in K,i\ne {s}_{k},i\ne {d}_{k$ (19)

${\sum}_{\left(i,j\right)\in E}{x}_{i,j}^{k}}-{\displaystyle {\sum}_{\left(j,i\right)\in E}{x}_{j,i}^{k}}=-{f}_{b}\left(k\right),\forall k\in K,i={d}_{k$ (20)

${\Phi}_{e,l}\le {f}_{b}\left(e\right)\le {\Phi}_{e,u},\forall e\in {\Omega}_{e}$ (21)

${\Phi}_{d,l}\le {f}_{b}\left(d\right)\le {\Phi}_{d,u},\forall e\in {\Omega}_{d}$ (22)

${\sum}_{k\in K}{x}_{i,j}^{k}}\le {t}_{i,j},\forall \left(i,j\right)\in E$ (23)

${x}_{i,j}^{k}\ge 0,\beta \ge 0$

6.1.1. Lower and Upper Bound Initialization for Bounded MMCF Formulation

The task now is to understand the initialization of these bounds. Care should be taken to define the bounds, so that the solution obtained by the modified bounded MMCF formulation is at least as good as the one obtained by solving the MMCF formulation. We propose two ways to initialize the lower and upper bounds of the aggregate flow of the commodities in the sets ${\Omega}_{e}$ and ${\Omega}_{u}$ .

In the first approach, which we identify as the MB-1 formulation, we assume that the maximum flows and MMCF flows for the commodities in set K with respect to the graph $G\left(V,E\right)$ are known. In this case, the lower bound ${\Phi}_{e,l}$ for the excess commodity element $e\in {\Omega}_{e}$ is set so that its aggregate flow does not become less than $\sigma \times \alpha \left(e\right)$ , ( $\alpha \left(k\right)$ is the maximum flow of commodity pair $\left({s}_{k},{d}_{k}\right)$ ), and the upper bound ${\Phi}_{e,u}$ does not exceed the flow obtained from the MMCF solution, which is ${f}_{mc}\left(e\right)$ . In case of the deficit commodity elements $d\in {\Omega}_{d}$ , the lower and upper bound settings are reversed. In this case, the lower bound ${\Phi}_{d,l}$ is set so that the flow achieved is at least ${f}_{mc}\left(d\right)$ , and the upper bound ${\Phi}_{d,u}$ is set so that it does not exceed the desired threshold $\sigma \times \alpha \left(d\right)$ .

The second proposal to initialize the bounds based on the observation that the optimal commodity flow solution of a MConF problem, which ensures fairness through its throughput factor β, is also a feasible MMCF solution. For the MB-2 formulation, we must first determine the throughput factor β by solving the MConF problem with the demands set to maximum flow of the commodity $k,\alpha \left(k\right)$ . Once the MConF flows are obtained, the lower bound ${\Phi}_{e,l}$ of excess commodity $e\in {\Omega}_{e}$ is set to $\beta \times \alpha \left(e\right)$ and upper bound ${\Phi}_{e,u}$ to ${f}_{mc}\left(e\right)$ . For the commodity elements in $d\in {\Omega}_{d}$ , we set lower bound ${\Phi}_{d,l}$ to $\beta \times \alpha \left(d\right)$ , and the upper bound ${\Phi}_{d,u}$ is set to $\alpha \left(d\right)$ . We study the performance of the bounded MMCF formulations in the performance analysis section in Section 7.

The above changes to the MMCF formulation are expected to improve fairness among the commodity flows, but as stated earlier, the formulations would have to be solved in an offline manner using an LP tool, which would make the approach too complex to be realized in a dynamic environment. So, we next discuss a heuristic for online implementation.

6.1.2. Flow Balancing Heuristic

This algorithm builds on the approach discussed in the previous section where the set of commodities K is first divided into an excess set
${\Omega}_{e}$ and a deficit set
${\Omega}_{d}$ . The two sets are determined similarly to the approach discussed earlier using the threshold factor σ. The algorithm builds on the idea of transferring flows from the elements in excess commodity set
${\Omega}_{e}$ to the elements in deficit commodity set
${\Omega}_{d}$ . The algorithm has as inputs the MMCF flow
${f}_{mc}\left(k\right)$ and the corresponding path set P_{k} for commodity
$k\in K$ , and it outputs the modified balanced flows
${f}_{b}\left(k\right)$ for commodities in the set K. The flow balancing algorithm is explained next with reference to Figure 5 and the pseudo code in Algorithm 3.

In Lines 4 - 5, the algorithm begins by identifying the sets ${\Omega}_{e}$ and ${\Omega}_{d}$ and initializing ${f}_{b}\left(k\right)$ to the previously computed ${f}_{mc}\left(k\right)$ . Flow balancing begins

Algorithm 3. Flow balancing heuristic for fair partitioning problem.

Figure 5. Logical view of the flow balancing process.

by iterating through each deficit commodity item $d\in {\Omega}_{d}$ in Line 6. In Line 7, for each commodity d, we iterate over all the paths $p\in {P}_{d}$ corresponding to the commodity flow ${f}_{b}\left(d\right)$ . We choose a path $p=\left\{{S}_{d},{e}_{1},{e}_{2},\cdots ,e,\cdots ,{D}_{d}\right\}$ for further steps in the iteration only if it has exactly one edge e such that the left over edge capacity after executing MMCF based partitioning algorithm, which we denote as ${r}^{\prime}\left(e\right)$ , satisfies ${r}^{\prime}\left(e\right)=0$ and ${r}^{\prime}\left({e}_{i}\right)\ge \tau $ for all other edges ${e}_{i}\in p$ and ${e}_{i}\ne e$ , for a predefined left over edge capacity threshold τ. We impose this condition for three reasons: First, the edge with the zero left over capacity increases the probability of finding at least one or more commodities from the ${\Omega}_{e}$ set contributing to the total edge flow, and this could be used to potentially transfer flow to the deficit commodity; second, this approach enables us to control the complexity of the algorithm by limiting the choice of edges that can be chosen on a path $p\in {P}_{d}$ , and thereby, simplifying the choice of the excess commodity from which the flow can be transferred; third, τ also acts like a tunable parameter that could also be used to control the complexity of the algorithm by eliminating the paths that may not make a considerable change to the flow of the deficit commodity after an augmentation iteration. If an FPTAS (Fully Polynomial Time Approximation Scheme) algorithm was used to solve the MMCF problem, and as the optimality of the solution is a function of the approximation factor, the left over capacity on all the edges of the path p may be positive. In this case, we chose the path p and an edge e such that $e\in \left\{x:\mathrm{min}\left\{{r}^{\prime}\left(x\right),x\in p\right\}\right\}$ and with left over capacity ${r}^{\prime}\left({e}_{i}\right)>\tau ,\forall {e}_{i}\in p,{e}_{j}\ne e$ .

Once a path p is determined, we determine in Line 8 the set
$T\subset {\Omega}_{e}$ of excess commodities that can potentially contribute flows to the deficit commodity d. In Line 9, we select an excess commodity
$t\in T$ that can contribute the maximum units of flow. We choose
$t\in T$ , which maximizes
$\left({f}_{b}\left(t\right)/\alpha \left(t\right)-\alpha \right)$ , i.e.
$t\in \left\{x:\mathrm{max}\left\{{f}_{b}\left(x\right)/\alpha \left(x\right)-\alpha \right\}\wedge x\in T\right\}$ . In Line 10, corresponding to the commodity t, we identify the subset Q of commodity path set P_{t} that includes edge e. From the set Q, we choose the path
$q\in Q$ that maximizes the flow of commodity t on path q; we represent this flow as
${\lambda}_{t,q}$ . In Line 11, to determine the flow that can be transferred from the excess commodity t to the deficit commodity d, we compute the following:

1) ${\lambda}_{t,q}$ = Minimum of the flows of the excess commodity t on the edges of path q.

2) ${\zeta}_{d,p}$ = Minimum of the left over capacities of the links on path p of the deficit commodity d without considering the left over capacity of the link e.

3) ${f}_{d}=\left(\sigma \times \alpha \left(d\right)-{f}_{b}\left(d\right)\right)$ is the flow required for deficit commodity d in order to achieve its target flow threshold, which is $\sigma \times \alpha \left(d\right)$ .

4) ${f}_{t}=\left({f}_{b}\left(t\right)-\sigma \times \alpha \left(t\right)\right)$ is the maximum flow that can be contributed by commodity t beyond which the flow of the excess commodity would go below the threshold flow $\sigma \times \alpha \left(t\right)$ .

We choose the minimum of the above values in order to determine bw, i.e.
$bw=\mathrm{min}\left\{{\lambda}_{t,q},{\zeta}_{d,p},\left(\sigma \times \alpha \left(d\right)-{f}_{b}\left(d\right)\right),\left({f}_{b}\left(t\right)-\sigma \times \alpha \left(t\right)\right)\right\}$ . In Lines 12 - 15, bw is deducted from edge flows corresponding to the excess commodity t on path q and augmented along the edges of path p of the deficit commodity d. Corresponding augmentation and subtraction are also made to respective aggregate commodity flows
${f}_{b}\left(d\right),{f}_{b}\left(t\right)$ , and set
${\Omega}_{e}$ is updated if necessary. If
${\Omega}_{e}$ is empty, we terminate, else this process continues over all the deficit commodities until either each of the deficit commodities
$d\in {\Omega}_{d}$ satisfies
$\left({f}_{b}\left(d\right)/\alpha \left(d\right)\right)\ge \sigma $ , or there are no more paths p for augmentation in the set P_{d} in the iteration for commodity d, upon which we move on to the next deficit commodity in the set
${\Omega}_{d}$ .

The complexity of the balancing heuristic can be controlled by limiting the number of paths considered for each commodity in ${\Omega}_{d}$ and ${\Omega}_{e}$ . The worst case complexity of the flow balancing heuristic can be derived assuming a highly unfair flow distribution by MMCF, where the size of $\left|{\Omega}_{d}\right|$ is $O\left(\left|K\right|\right)$ . Let $\left|{P}_{d}\right|$ and $\left|{P}_{e}\right|$ be the maximum number of paths to be considered for each deficit and excess commodity as part of the balancing process. The worst case complexity of the flow balancing heuristic with this assumption is $O\left(\left|K\right|\times \left|{P}_{d}\right|\times \left|{P}_{e}\right|\right)$ .

The flow balancing heuristic can be incorporated as part of the MMCF based partitioning heuristic in order to improve the fairness of the MMCF commodity flow by modifying Line 5 (Algorithm 2) as follows.

Line 5: For the commodity set K, solve the maximum multicommodity flow problem. The solution ${x}_{i,j}^{k}$ represents the resource associated with commodity k over edge $\left(i,j\right)\in E$ .

Line 5a: If the MMCF fair partitioning scheme is enabled, determine set ${S}_{K}=\left\{{f}_{mc}\left(k\right)/\alpha \left(k\right)\right\},\forall k\in K$ , initialize σ.

Line 5b: Apply MB-1, MB-2, or flow balancing heuristic in order to obtain new ${x}_{i,j}^{k}$ ‘s and balanced MMCF flows ${f}_{b}\left(k\right)$ which is the new ${f}_{mc}\left(k\right)$ .

The complexity of the MMCF based partitioning heuristic for the online implementation case with the above changes could be dominated by the complexity of solving MMCF formulation to optimality or

7. Simulation Study

The topology used for studying the different scenarios is a 22-node random topology based on well-known Waxman’s random graph [7] model with an average node degree of 4, $\alpha =0.150,\beta =2.2$ ; this topology is shown in Figure 6. In

Figure 6. Simulation topology.

order to validate our results over other standard topologies, we also studied the performance with respect to two other European networks referred from [8]. Considering the correlation in the results for the three topologies, for the discrete event simulation case we limit our results to those corresponding to the random graph. All the results discussed have been obtained from running the simulation for 30 independent replications to achieve 95% confidence interval for an absolute error [9] of less than 1%. The number of independent replications is deduced by observing the sample variance over several independent runs, and applying the approximation given in [9] (page. 512). The simulation study has been carried out with respect to three objectives. The simulation parameters are given in Table 2.

Objective 1(a-b): First we study the performance of the MConF based resource partitioning algorithm. Then, we study and compare the performance of the MMCF based resource partitioning algorithm with respect to the MConF based scheme.

Objective 2(a-b): As part of this objective, in the first part, we study the performance with respect to the improvement achieved by the bounded MMCF formulations (MB-1 and MB-2) in terms of fairness and compare their performance to the performance of the MMCF formulation without the fairness constraints. The analysis is done in an offline manner using an LP tool [10] over well known service provider networks referred from [8]. In the second part, we present a simulation analysis of the performance of the flow balancing algorithm proposed to improve the fairness of MMCF based partitioning scheme.

Objective 3: The goal of this objective is to compare the performance of the centralized abstraction schemes with the decentralized schemes proposed in [2]. Here, we also study how oversubscription of the residual link capacity can be used to overcome the conservative nature of centralized TA generation schemes to a certain extent. We also study the effect of oversubscription on VPN call

Table 2. Simulation parameters.

performance and network utilization. In the simulation study, all final abstractions from the partition subgraphs are derived using the maximum capacity scheme of [2]. We choose maximum capacity scheme as it performed the best in terms of success ratio of the three schemes proposed in [2].

Figure 7(a) & Figure 7(b) show the performance of MConF based subgraph partitioning scheme for generating VPN TA by varying the mean call holding time (ℋ). With respect to abstraction efficiency (Figure 7(a)), the MConF based algorithm achieved an abstraction efficiency of 55% at lower load conditions, which decreases by 10% with an increasing load on the network. This is because increasing the mean call holding time of VPN bandwidth requests causes the network utilization to increase, as shown in Figure 7(b). Hence, the residual capacity for future abstraction reduces. This results in an increasing variance of residual capacity among the links resulting in lesser aggregate commodity flows, and causing the resource partitioning scheme to result in lower abstraction efficiency.

Objective 1(a): Performance of MConF based partitioning Scheme

With respect to call performance in Figure 7(b), we observe that at lower load conditions, the success ratio is close to 100%, but as the load increases, the success ratio decreases. This is because of increasing misscall ratio. It should be noted that crankback ratio is almost 0 for all the load conditions. The good crankback ratio is achieved because of the subgraph partitioning method used for TA generation, but this is at the cost of deteriorating misscall ratio performance. The main reason for misscall ratio to increase with increasing load is due to the reducing abstraction efficiency as noted earlier. With lesser abstraction efficiency, the virtual links are associated with lesser virtual link capacities. This makes the VPNs terminate increasing percentage of calls locally, thereby increasing the misscall ratio.

In conclusion, we observe that applying MConF based TA generation approach achieves very good success ratio at low load conditions, but at higher loads the success ratio deteriorates because of poor misscall ratio performance. Also, applying centralized mode of TA generation results in very good crankback ratio.

Objective 1(b): Evaluation of the MMCF based partitioning scheme and comparison with the MConF based scheme

Figure 7(c) & Figure 8(a) compare the call performance of MConF and MMCF based heuristics under varying loads. From Figure 7(c), which compares the success ratio, we observe that the partitioning approach using MMCF performs better than MConF by about 5% particularly at higher load conditions. This is because of the gain achieved by MMCF in terms of abstraction efficiency. A similar result was also made in the case of crankback and misscall ratio metrics as shown in Figure 8(a). We can see that MMCF based TA scheme performs 5% better than the MConF based TA scheme in terms of this aggregate metric. Figure 8(b) compares the network utilization achieved by the MConF

(a)(b)(c)

Figure 7. (a) VSP abstraction efficiency and core network utilization with varying mean holding time (ℋ); (b) VPN call performance with varying ℋ for MConF based abstraction scheme; (c) VPN call performance comparison of success ratio MConF and MMCF based abstraction schemes with varying ℋ.

and MMCF approaches; the better call performance and abstraction efficiency of the MMCF based approach results in better network utilization in the range of 5% for various load conditions. As expected, a significant difference in the two approaches was noted with respect to fairness of the commodity flows. Though MMCF was observed to achieve high abstraction efficiency, it fared poorly in terms of fairness among the commodity flows. Figure 8(c) compares the average

(a)(b)(c)(d)(e)(f)

Figure 8. (a) VPN call performance (crankback + misscall) ratio comparison of MConF and MMCF based abstraction schemes with varying mean holding time (ℋ); (b) VSP network utilization comparison of MConF and MMCF based abstraction schemes with varying ℋ; (c) Comparison of fairness of MConF and MMCF based abstraction schemes with varying ℋ; (d) Comparison of abstraction efficiency of MConF and MMCF based abstraction schemes with varying ℋ; (e) Offline comparison of abstraction efficiency of MConF, MMF, MMCF with MB1/MB2 formulations for different graphs; (f) Offline comparison of fairness of MConF, MMCF, MMCF with MB1/MB2 formulations for different graphs.

standard deviation of the commodity flows achieved by the MMCF and MConF based partitioning algorithms. We see that at lower network utilization conditions, the MConF performs fifty times better than MMCF. The decreasing difference of the fairness performance of the two schemes is due to decreasing difference of abstraction efficiency between the two schemes with increasing load as observed in Figure 8(d).

Objective 2(a): Offline performance comparison of MMCF formulations and improvements to achieve fairness

Here, we study and compare the performance of MMCF formulation and its variations to address the fairness issue in an offline manner. Before discussing the results, we wish to note that by the very nature of the objective function, MMCF will always result in the maximum abstraction efficiency and least fairness, and as stated earlier, MConF will result in commodity flows with maximum fairness, while achieving the least abstraction efficiency. The performance of the MMCF variations MB-1 and MB-2 is expected to lie within these extremes. The goal of this objective is to understand which formulation strikes the best balance in achieving abstraction efficiency matching that of the MMCF scheme and fairness matching that of the MConF scheme. We study the performance of these formulations by running over well known provider networks referred from [8] , and we characterize their performance in terms of two metrics: the aggregate flow achieved by the formulation from which abstraction efficiency is obtained and the fairness of the commodity flows among the commodities. The fairness is characterized in terms of the standard deviation among the commodity flows. In Figure 8(e), we see that MMCF achieves the best abstraction efficiency but also suffers in terms of fairness as shown in Figure 8(f), which results in maximum standard deviation among the commodity flows. On the other hand, the MConF resource partitioning scheme achieves the least abstraction efficiency, while achieving the least standard deviation and maximum fairness. Comparing the two MMCF variations, variation MB-1, which defines its flow bounds using the maximum flow and MMCF flow, achieves abstraction efficiency close to that of MMCF formulation but makes only a small gain in addressing the fairness issue. The second variation MB-2 that uses the MConF and MMCF outputs to define the bounds results in as much or slightly less aggregate flow when compared to MMCF or MB-1 formulation, while achieving maximum fairness of the three MMCF formulations. Hence we see that, comparing the two bounded MMCF formulations, the MB-2 variation that uses the MConF flows to define the bounds over the commodity flows, performs the best in terms of achieving MMCF’s abstraction efficiency, while also improving the fairness among the commodity flows.

Objective 2(b): Comparing performance of MMCF based partitioning scheme and MMCF augmented with flow balancing heuristic

Figure 9(a) & Figure 9(b) compare the performance of abstraction efficiency and success ratio of MMCF with and without the application of the flow balancing heuristic. With respect to both these metrics, the performance of the two scenarios was almost the same. No difference in performance was also noted in terms of other call performance metrics too. This is expected since the fair partitioning algorithm only improves the fairness of the commodity flows obtained from MMCF based heuristic, which is done by rebalancing the flows without affecting the abstraction efficiency.

As expected, an important difference was noted with respect to fairness, as seen in Figure 9(c). With flow balancing enabled over MMCF commodity flows, we would expect the variance of the commodity throughput factor to reduce. The improvement in terms of standard deviation when flow balancing is applied was noted to be about 25% better; this demonstrates the usefulness of the flow balancing heuristic. From Figure 9(c), we observe that with increasing load the difference between the variance of the commodity flows of MMCF and MMCF

(a)(b)(c)

Figure 9. (a) Comparing VSP abstraction efficiency of MMCF with and without Fair Balancing with varying mean holding time (ℋ); (b) VPN call performance comparing success ratio of MMCF with and without Fair Balancing with varying ℋ; (c) Comparing fairness of MMCF with and without Fair Balancing with varying ℋ.

with flow balancing decreases. This is because, the increasing network load results in proportional increase in network utilization, hence decrease in abstraction efficiency. This results in lesser aggregate MMCF flows, thereby decreasing the variance between aggregate flows of the commodities. This causes flow balancing scheme to achieve lesser improvement in terms of fairness with increasing load.

Objective 3(a): Comparing performance of centralized abstraction and decentralized abstraction schemes

In this objective, we compare the difference in performance of the two modes of TA generation in terms of VPN call performance and network utilization. From the three schemes proposed in [2] , we choose the maximum capacity scheme for the analysis. In the following, decentralized scheme refers to the decentralized scheme of [2] based on the maximum capacity abstraction algorithm. Similarly, MConF and MMCF schemes, also called centralized schemes refer to those that construct partition subgraphs using the MCoN and MMCF formulations and then apply the maximum capacity abstraction algorithm.

Figure 10(a)-10(c) compare the call performance and network utilization of the decentralized scheme, MConF, and MMCF based abstraction schemes. As regards the VPN success ratio, we note in Figure 10(a) that the success ratio of the decentralized scheme scheme is better than that of MConF scheme by 10% and by 5% with respect to the MMCF scheme. With respect to the crankback ratio we note in Figure 10(b) that the decentralized scheme’s performance degrades by 7% at maximum load while MConF and MMCF schemes achieve crankback ratio of less than 1%, which was also noted earlier in objectives 1 (a - b). The significant gain in crankback ratio is achieved at the cost of high misscall ratio of 25% and 22% for MConF and MMCF schemes compared to 7% for the decentralized scheme. This performance difference is shown in Figure 10(c). The performance difference in success ratio also translates into good network utilization of the decentralized scheme, which performs 10% and 5% better than MConF and MMCF schemes. This can be seen in Figure 10(d). This performance difference between the decentralized and MConF and MMCF schemes suggests that minimizing the oversubscription alone, which was the main motivation for developing the MConF and MMCF schemes, does not translate into good VPN call performance. This is particularly obvious at higher loads when the contention of resources among the VPNs is high. In this case, the aggressive nature of the decentralized scheme is noted to improve statistical multiplexing of core resources among the VPN bandwidth requests, which contributes to better call performance. The centralized schemes, because of their conservative exposure of available capacity (derived from logical partitioning schemes), result in poorer misscall ratio performance because of their property of minimizing oversubscription, which results in limited multiplexing of available capacity.

In the next objective we try to improve the misscall ratio performance and in turn the success ratio performance of the centralized schemes by applying the technique of oversubscription of residual link capacities.

Objective 3(b): Improving the performance of centralized TA schemes by oversubscription of link capacities.

(a)(b)(c)(d)(e)(f)

Figure 10. (a) VPN call performance comparing success ratio of decentralized , MConF and MMCF schemes with varying mean holding time (ℋ); (b) VPN call performance comparing crankback ratio of decentralized , MConF and MMCF schemes with varying ℋ; (c) VPN misscall ratio comparison of decentralized, MConF and MMCF schemes with varying ℋ; (d) VSP network utilization comparison of decentralized , MConF and MMCF schemes with varying ℋ; (e) VPN call performance comparing success ratio of MConF based abstraction scheme with varying over-subscription factor (Y) with 95% C.I; (f) VPN call performance comparing success ratio of MMCF based abstraction scheme with varying oversubscription factor (Y).

One of the observations from the study of the previous objective is that oversubscription in the context of the TA service in a dynamic bandwidth scenario could help improve statistical multiplexing. In this objective, we study if this notion can be used to improve the conservative nature of the centralized schemes, particularly the misscall ratio performance. We do this by oversubscribing the links of the core network by multiplying the residual capacity of the link by a constant factor (Y) before executing either MConF or MMCF based subgraph partitioning schemes. Figures 10(e)-(f) & Figures 11(a)-(d) compare the performance of the MConF and MMCF based schemes for a range of values of oversubscription factor Y in the interval [1] [10]. The performance statistics are collected for low, medium and high load conditions set to 0.5, 1 and 5 Erlangs.

Figure 10(e) & Figure 10(f) compare the success ratio with varying values of oversubscription factor for different load conditions for the MConF and MMCF based schemes. At the low load of 0.5 Erlang, we can observe that even at Y set to 3, the success ratio of MMCF improves by 50%. Also the gain in success ratio is observed to improve with increasing value of Y. In Figure 11(a), we see a similar improvement with respect to misscall ratio performance. From Figures 10(e)-(f) & Figure 11(a) we also observe that the gain in success and misscall ratio saturates after a particular value of Y. For the low load case this value of Y is 7. The reason for saturation of the success and misscall ratio performance with increasing oversubscription of links is due to increase in the crankback ratio (see Figure 11(c)) which achieves its maximum value of 3% when Y ≥ 7 for the low load case. With respect to network utilization (see Figure 11(c)) we observe that gain in success ratio also translates into increasing gain in network utilization. The saturation in network utilization is due to the saturation observed with respect to the success ratio metric discussed earlier. Similar trends in gain in success and misscall ratios are observed for network utilization performance for medium and high load cases too.

From Figure 11(d) we observe that, with increasing load, the overall gain in success ratio from applying oversubscription decreases. That is, the maximum success ratio achieved with the load offered at 0.5 is 97% compared to 74% when load is 5. This is due to two reasons. First, this is due to decrease in abstraction efficiency of MConF based partitioning scheme with increasing load as discussed in objective 1 with reference to Figure 8(d). Second, with increasing load and increasing network utilization, the resource contention among VPNs also increases. This causes the crankback ratio to increase, and this increases with increasing load whose trend can be observed in Figure 11(e). Figure 10(f) compares the gain in success ratio achieved for MMCF based abstraction scheme. The trend in performance with increasing oversubscription factor in terms of success ratio in the case of MMCF based abstraction scheme is similar to that observed for MConF based scheme. The important observation here is that the difference in performance between MMCF and MConF based abstraction scheme reduces with increasing link oversubscription. This is because, with increasing oversubscription the advantage gained by better abstraction efficiency of MMCF reduces, hence MConF begins to perform as good as MMCF at higher oversubscription factors. The reason for decreasing trend of the success ratio performance with increasing load for the MMCF case is the same as those for the MConF case.

Next we compare the performance of decentralized scheme with MConF and MMCF schemes after link oversubscription is applied. For this scenario, based on the previous results we choose an oversubscription factor of 9. Figure 11(d) compares the success ratio for the three schemes with link oversubscription. Here we observe that MConF and MMCF perform better than the decentralized scheme particularly at low and medium load conditions. We see that MConF and MMCF schemes perform on an average 4% better than the decentralized

(a)(b)(c)(d)(e)

Figure 11. (a) VPN call performance comparing misscall ratio of MConF based abstraction scheme with varying oversubscription factor (Y); (b) VPN call performance comparing crankback ratio of MConF based abstraction scheme with varying oversubscription factor (Y); (c) VSP network utilization comparison of MConF based abstraction scheme with varying oversubscription factor (Y); (d) Success ratio comparison of MConF/MMCF/decentralized TA schemes with varying mean holding time (ℋ); (e) (Crankback + Misscall) ratio comparison of MConF/MMCF/decentralized TA schemes with varying ℋ.

scheme. We also observe that the difference between performance of MConF and MMCF itself is not significant. This is because, the link oversubscription overshadows the gain in abstraction efficiency achieved by MMCF which was discussed earlier. At high loads, we see that the decentralized scheme performs better than MConF and MMCF based TA scheme. This is because at high loads the crankback and misscall ratios, as shown in Figure 11(e), deteriorates for MConF and MMCF based schemes, resulting in poorer success ratio than the decentralized scheme. This shows that oversubscription may not always act favorably in all load conditions. This is so because link oversubscription at high load conditions results in abstractions that are too aggressive causing VPNs to make poor decisions resulting in high crankback and misscall ratios. In such situations the VSP could adopt the technique of using a tunable oversubscription factor that varies with utilization of network resources.

To summarize the above observations, we note that oversubscribing the core links by a fixed factor does help to overcome the conservative nature of centralized MConF and MMCF based schemes to a significant extent.

8. Discussion

We would like to conclude by pointing out opportunities for extending our works presented in this paper.

Given a graph G with vertex set V and a VPN defined on a subset V’ of V, a steiner logical topology (or graph) G’ is a graph defined on V’ such that G’ provides an accurate estimate of the maximum flow available in G between the vertices of G’. The Steiner logical topology problem is to design a Steiner logical topology for a given subset V’ of V. We note that a Steiner logical graph is not necessarily a subgraph of G. So we need to assign capacities to the links in the Steiner logical graph to achieve the desired property. So, there are many ways to do this. For instance, we can assign each logical link with a path in G (similar to lightpath in IP-over-WDM optical networks). What makes the problem challenging is the fact that several VPNs will be present simultaneously on a given G and all of them need to be provided with an accurate estimate of the available capacities in G. Certain recent works and the references therein can provide the basis for further research in this direction [11] [12] [13] [14].

Another area where TA can be used is to address the problems arising from conflicting traffic engineering (TE) principles applied by over-the-top (OTT) content providers and the underlay service providers [15]. This problem could result in unstable network behavior. This situation can be improved by adopting a cooperative model between the OTT and the SP, wherein the SP could expose the underlying physical network’s properties in the form of a TA to the OTT content provider. This form of cooperative benefit has been studied in [16] , but in the context of the provider providing the complete topology to the OTT provider which is not feasible practically. TA could be a promising direction to address this problem.

9. Conclusions

This paper is a continuation of [1] [2] where we introduced the TA service for VPNs and proposed three decentralized schemes. These schemes assume that all the border nodes performing the abstraction have access to the entire core network topology. In contrast to this, in this paper we have developed centralized schemes to partition the core network capacities, and assign each partition to a specific VPN for applying the decentralized abstraction schemes presented in [1] [2]. Towards this end, we first introduced the VPN core capacity sharing (VPN-CS) problem. We applied multicommodity flow theory to solve this problem. Considering the objectives of the VPN-CS problem, we first proposed a method based on the maximum concurrent flow theory, and later improved it by proposing the use of the maximum multicommodity flow theory. In order to address the fairness issue associated with the MMCF based approach, a new problem called the fair partitioning problem was formulated. We studied this problem by proposing the bounded MMCF formulation, wherein two variations were proposed. In addition, we also proposed a heuristic called the flow balancing scheme to address the fair partitioning problem for online implementation. Performance analysis was conducted where we compared the proposed schemes using offline implementations with an LP tool and discrete event driven simulation.

From the simulation analysis, we observed that the MMCF based partitioning approach resulted in better call performance than the MConF based partitioning scheme. The MMCF based partitioning algorithm performed about 5% better than the MConF approach with respect to both VPN call performance and network utilization metrics. With respect to abstraction efficiency, we observed that MMCF’s performance was 37% better than MConF; however, in terms of fairness, the standard deviation of the commodity flows generated by MConF was on an average 75% less than the standard deviation of the flows generated by MMCF. With flow balancing enabled, the simulation analysis also showed that the fairness issue of MMCF could be improved by about 25% with no significant impact on the overall call performance of the VPNs or the core network utilization.

We also studied how the conservative nature of the centralized schemes can be overcome by oversubscribing the residual capacity of core network links before applying the centralized abstraction schemes. We observed that the call performance and core network utilization showed significant improvement over a range of oversubscription factors, demonstrating this as a practical way to overcome the conservative nature of the centralized mode of VPN TA generation.

Another line of investigation is to study how best one can use the ideas of partitioning developed in this paper for enhancing the capabilities of the Virtual Cluster Embedding schemes discussed in [17] [18] and the references therein.

References

[1] Ravindran, R., Huang, C. and Thulasiraman, K. (2006) A Dynamic Managed VPN Service: Architecture and Algorithms. Proceedings of IEEE ICC, 2, 664-669.

https://doi.org/10.1109/ICC.2006.254783

[2] Ravindran, R., Huang, C. and Thulasiraman, K. (2013) Topology Abstraction Service for IP-VPNs. IEEE Transactions on Parallel and Distributed Systems, 24, 184-195.

https://doi.org/10.1109/TPDS.2012.27

[3] Ravindran, R., Huang, C. and Thulasiraman, K. (2007) Managed Dynamic VPN Service: Core Capacity Sharing Schemes for Improved VPN Performance. 2007 IEEE International Conference on Communications, Glasgow, 24-28 June 2007, 211-216.

https://doi.org/10.1109/ICC.2007.43

[4] Shahrokhi, F. and Matula, D.W. (1990) The Maximum Concurrent Flow Problem. Journal of the Association for Computing Machinery, 37, 318-334.

https://doi.org/10.1145/77600.77620

[5] Garg, N. and Konemann, J. (1998) Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems. Proceedings of 39th Annual Symposium on Foundations of Computer Science, Palo Alto, 8-11 November 1998, 300-309.

https://doi.org/10.1109/SFCS.1998.743463

[6] Fleischer, L. (1999) Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. Proceedings of IEEE 40th Annual Symposium of Foundations of Computer Science, New York, 17-19 October 1999, 24-31.

https://doi.org/10.1109/SFFCS.1999.814573

[7] Waxman, B. (1988) Routing of Multipoint Connections. Journal on Selected Areas in Communications, 6, 1617-1622.

https://doi.org/10.1109/49.12889

[8] Ho, K. and Cheung, K. (2007) Generalized Survivable Networks. IEEE/ACM Transactions on Networking, 15, 750-760.

https://doi.org/10.1109/TNET.2007.893889

[9] Law, A. and Kelton, W. (1999) Simulation Modelling and Analysis. 3rd Edition, McGraw Hill, New York.

[10] LINDO Systems, Inc. (2018) LINDO Optimization Tool.

http://www.lindo.com

[11] Peleg, D. and Schaffer, A. (1989) Graph Spanners. Journal of Graph Theory, 13, 99-116.

https://doi.org/10.1002/jgt.3190130114

[12] Cohen, E. (1998) Fast Algorithms for Constructing t-Spanners and Paths with Stretch t. SIAM Journal on Computing, 28, 210-236.

https://doi.org/10.1137/S0097539794261295

[13] Dragan, F. and Yan, C. (2006) Network Flow Spanners. LATIN, 3887, 410-422.

https://doi.org/10.1007/11682462_39

[14] Thulasiraman, K., Javed, M. and Xue, G. (2010) Primal Meets Dual: A Generalized Theory of Logical Topology Survivability in IP-Over-WDM Optical Networks. 2010 Second International Conference on Communication Systems and Networks, Bangalore, 5-9 January 2010, 1-10.

[15] Keralapura, R., Chuah, C., Taft, N. and Iannaccone, G. (2005) Can Co-Existing Overlays Inadvertently Step on Each Other. 2005 13th IEEE International Conference on Network Protocols, Boston, 6-9 November 2005, 211-214.

[16] Jiang, W., Zhang-Shen, R., Rexford, J. and Chiang, M. (2009) Cooperative Content Distribution and Traffic Engineering in an ISP Network. ACM SIGMETRICS Performance Evaluation Review, 2, 239-250.

https://doi.org/10.1145/1555349.1555377

[17] Chowdhury, K., Rahman, M. and Boutaba, R. (2009) Virtual Network Embedding with Coordinated Node and Link Mapping. 2009 IEEE INFOCOM, Rio de Janeiro, 19-25 April 2009, 783-791.

[18] Rost, M., Fuerst, C. and Schmid, S. (2015) Beyond the Stars: Revisiting Virtual Cluster Embedding. ACM SIGCOMM Computer Communication Reviews, 45, 12-18.

https://doi.org/10.1145/2805789.2805792