.png){kind=icon}
返回
On Distributed Virtual Network Embedding With Guarantees
.png){kind=icon}
OA
AI
DOI：10.1109/TNET.2014.2375826.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 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. Using extensive simulations, we confirm superior convergence properties and resource utilization when compared to 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.
Keyword:
Approximation algorithms
consensus algorithms
network virtualization
resource allocation
virtual network embedding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
引用论文
Treatment sequence in elderly metastatic castration-resistant prostate cancer (mCRPC) patients (pts) in a prospective cohort study.老年转移性去势抵抗性前列腺癌（mCRPC）患者（pts）在前瞻性队列研究中的治疗顺序。
PREAI
分享收藏
Ni-Co-P nanosheets in-situ grown at macroporous nickel mesh with promising performance for hydrogen evolution reaction in alkaline medium.png)
Ionics
IonicsIF0
PREAI
分享收藏
查看更多内容