Sciweavers

Share
TON
2016

On Distributed Virtual Network Embedding With Guarantees

3 years 3 months ago
On Distributed Virtual Network Embedding With Guarantees
—To provide wide-area network services, resources from different infrastructure providers are needed. Leveraging the consensus-based resource allocation literature, we propose a general distributed auction mechanism for the (NP-hard) virtual network (VNET) embedding problem. Under reasonable assumptions on the bidding scheme, the proposed mechanism is proven to converge, and it is shown that the solutions guarantee a worst-case efficiency of (1 − 1 e ) relative to the optimal node embedding, or VNET embedding if virtual links are mapped to exactly one physical link. This bound is optimal, that is, no better polynomial-time approximation algorithm exists, unless P = NP. Using extensive simulations, we confirm superior convergence properties and resource utilization when compared with existing distributed VNET embedding solutions, and we show how by appropriate policy design, our mechanism can be instantiated to accommodate the embedding goals of different service and infrastructur...
Flavio Esposito, Donato Di Paola, Ibrahim Matta
Added 11 Apr 2016
Updated 11 Apr 2016
Type Journal
Year 2016
Where TON
Authors Flavio Esposito, Donato Di Paola, Ibrahim Matta
Comments (0)
books