On Distributed Virtual Network Embedding With Guarantees

Esposito, Flavio; Paola, Donato Di; Matta, Ibrahim

doi:10.1109/tnet.2014.2375826

Cited by 49 publications

(38 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that we used the one-shot VNE approximation algorithm proposed in [36] as an initial solution for the column generation approach to avoid two stage VNE limitations when physical network is initially unbalanced [17]. Finally, we compare against a Consensus-based Auction mechanism (CAD) [5], [21], the first policy-based distributed VNE approximation algorithm with convergence and optimality guarantees. Note that a version of CAD can be also used to solve the NFV-SC problem [5].…”

Section: A Management Plane Evaluationmentioning

confidence: 99%

A Constrained Shortest Path Scheme for Virtual Network Service Management

Chemodanov

Esposito

Calyam

et al. 2019

IEEE Trans. Netw. Serv. Manage.

Self Cite

View full text Add to dashboard Cite

Virtual network services that span multiple data centers are important to support emerging data-intensive applications in fields such as bioinformatics and retail analytics. Successful virtual network service composition and maintenance requires flexible and scalable 'constrained shortest path management' both in the management plane for virtual network embedding (VNE) or network function virtualization service chaining (NFV-SC), as well as in the data plane for traffic engineering (TE). In this paper, we show analytically and empirically that leveraging constrained shortest paths within recent VNE, NFV-SC and TE algorithms can lead to network utilization gains (of up to 50%) and higher energy efficiency. The management of complex VNE, NFV-SC and TE algorithms can be, however, intractable for large scale substrate networks due to the NP-hardness of the constrained shortest path problem. To address such scalability challenges, we propose a novel, exact constrained shortest path algorithm viz., 'Neighborhoods Method' (NM). Our NM uses novel search space reduction techniques and has a theoretical quadratic speed-up making it practically faster (by an order of magnitude) than recent branch-and-bound exhaustive search solutions. Finally, we detail our NM-based SDN controller implementation in a real-world testbed to further validate practical NM benefits for virtual network services.

show abstract

Section: A Management Plane Evaluationmentioning

confidence: 99%

A Constrained Shortest Path Scheme for Virtual Network Service Management

Chemodanov

Esposito

Calyam

et al. 2019

IEEE Trans. Netw. Serv. Manage.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Physical nodes belonging to different infrastructure providers partition the VN and attempt to embed the largest possible VN partitions, and then create virtual links among the winner physical hosts. Finally, we compare against a Consensus-based Auction mechanism (CAD) [7], the first policy-based distributed VNE approximation algorithm with convergence and optimality guarantees. The link embedding of these algorithms runs a k-shortest path with k = 3 for Waxman and k = 1 for Barabasi-Albert topologies shown to be within optimal range of k.…”

Section: Performance Evaluationmentioning

confidence: 99%

A general constrained shortest path approach for virtual path embedding

Chemodanov

Calyam

Esposito

et al. 2016

2016 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)

Self Cite

View full text Add to dashboard Cite

Network virtualization has become a fundamental technology to deliver services for emerging data-intensive applications in fields such as bioinformatics and retail analytics hosted at multi-data center scales. To create and maintain a successful virtual network service, the problem of generating a constrained path manifests both in the management plane with a physical path creation (chains of virtual network functions or virtual link embedding) and in the data plane with on-demand path adaptation (traffic steering with Service Level Objective (SLO) guarantees). In this paper, we define the virtual path embedding problem to subsume the virtual link embedding and the constrained traffic steering problems, and propose a new scheme to solve it optimally. Specifically, we introduce a novel algorithm viz., 'Neighborhood Method' (NM) which provides an on-demand path with SLO guarantees while reducing expensive over provisioning. We show that by solving the Virtual Path Embedding problem in a set of diverse topology scenarios we gain up to 20% in network utilization, and up to 150% in energy efficiency, compared to the existing path embedding solutions.

show abstract

“…Each agent is associated with a private utility u i ∈ R |J | + , that represents the benefit (or cost) of hosting an element of J . As in [8] and [10], we assume that agents cooperate to reach a Pareto optimal solution: i∈I u i . A Max-Consensus Auction protocol consists of two independent mechanisms: (i) a bidding mechanism, where agents independently bid on the items in J , and (ii) an agreement mechanism, where bids are exchanged with the logical neighbors for a distributed winner determination.…”

Section: A the Mechanismsmentioning

confidence: 99%

“…The Max Consensus-based Auction (MCA) protocol is a recent approach that allows a set of communicating agents to rapidly obtain a conflict-free (distributed) allocation of a set of items, given a common network utility maximization goal. Without calling it MCA, recent work [8], [10] demonstrated how max-cosnensus auction protocols provide desirable performance guarantees with respect to the optimal network utility. The MCA protocol consists of two mechanisms: a bidding mechanism, where agents independently bid on a single or on multiple items, and an agreement (or consensus) mechanism, where agents exchange their bids for a distributed winner determination.…”

Section: Introductionmentioning

confidence: 99%

“…To our knowledge, its first use appeared to solve the distributed task assignment problem [8], where a fleet of unmanned aerial vehicles bid to assign a set of tasks (geo-locations to be covered.) MCA protocols were also proposed for distributed virtual network management applications [10], where federated infrastructure providers bid to host virtual nodes and virtual links on their physical network, in attempt to embed a wide-area cloud service. More recently, MCA protocols have been also proposed to solve the economic dispatch problem in a distributed fashion, i.e., the problem of allocating power generation tasks among available units in a smart-grid [5].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Alloy Verification Model for Consensus-Based Auction Protocols

Mirzaei

Esposito²

2015

2015 IEEE 35th International Conference on Distributed Computing Systems Workshops

Self Cite

View full text Add to dashboard Cite

Abstract-Max Consensus-based Auction (MCA) protocols are an elegant approach to establish conflict-free distributed allocations in a wide range of network utility maximization problems. A set of agents independently bid on a set of items, and exchange their bids with their first hop-neighbors for a distributed (max-consensus) winner determination. MCA protocols have been proposed, e.g., to solve the task allocation problem for a fleet of unmanned aerial vehicles, in smart grids, or in distributed virtual network management applications. Misconfigured or malicious agents participating in a MCA or an incorrect combination of policy instantiations can lead to oscillations of the protocol, causing, e.g., Service Level Agreement (SLA) violations.In this paper we propose a formal, machine-readable, MaxConsensus Auction model encoded in the Alloy lightweight modeling language. The model consists of a network of agents applying the MCA mechanisms instantiated with potentially different policies, and a set of predicates to analyze its convergence properties. We were able to verify that even when all agents follow the protocol, MCA is not resilient against rebidding attacks, and that the protocol fails (to achieve a conflict-free resource allocation) for some specific combinations of policies. Our model can be used to verify, with a "push-button" analysis, the convergence of the MCA mechanism to a conflict-free allocation under a wide range of policy instantiations.

show abstract

On Distributed Virtual Network Embedding With Guarantees

Cited by 49 publications

References 33 publications

A Constrained Shortest Path Scheme for Virtual Network Service Management

A Constrained Shortest Path Scheme for Virtual Network Service Management

A general constrained shortest path approach for virtual path embedding

An Alloy Verification Model for Consensus-Based Auction Protocols

Contact Info

Product

Resources

About