Loading...
Please wait, while we are loading the content...
Similar Documents
On Distributed Virtual Network Embedding with Guarantees
| Content Provider | CiteSeerX |
|---|---|
| Author | Esposito, Flavio Paola, Donato Di Matta, Ibrahim |
| Abstract | 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 infrastructure providers, resulting in an attractive and flexible resource allocation solution. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Distributed Virtual Network Polynomial-time Approximation Algorithm Approximation Algo-rithms Physical Link Consensus-based Resource Allocation Literature Different Infrastructure Provider Wide-area Network Service Virtual Link Extensive Simulation Resource Allocation Optimal Node Embedding Index Term Network Virtualization Embedding Goal Superior Convergence Property Appropriate Policy Design Auction Mechanism Virtual Network Virtual Net-work Embedding Reasonable Assumption Bidding Scheme Consensus Algorithm Different Service Flexible Resource Allocation Solution Worst-case Efficiency |
| Content Type | Text |
