arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2306.03041cs.NI
收藏

将受时延约束的 VNF 转发图嵌入可重构 WDM 光网络——扩展版

Embedding Delay-Constrained VNF Forwarding Graphs into Reconfigurable WDM Optical Networks -- Extended Version

Valentin Kirchner, Holger Karl

AI总结:

本文联合优化受时延约束的 VNF 转发图嵌入与可重构 WDM 光网络拓扑,建模三类时延并提出 MINLP、MIQCP 与 MILP 优化方法。

摘要:

可重构波分复用(WDM)光网络的运营商通过调整光通路拓扑来均衡负载并降低传输时延。这种调整通常依赖于已知或估计的流量矩阵。网络功能虚拟化(NFV)能够隐式地改变该流量矩阵。然而,这两种自由度在很大程度上一直被分开考虑,导致资源使用未达最优。尤其对于时延敏感型服务,资源的最优利用可能至关重要。本文旨在联合优化受时延约束的虚拟化网络功能(VNF)转发图嵌入与 WDM 光网络的光通路拓扑。与以往工作不同,我们同时考虑全部三类时延:传播时延、处理时延以及由转发引起的排队时延,并将后两者建模为 M/M/1 队列。我们构建并分析了一个混合整数非线性规划(MINLP),将其重新表述为混合整数二次约束规划(MIQCP),并用混合整数线性规划(MILP)进行近似。我们针对组播服务的小规模示例评估了所提方法。

英文摘要:

Operators of reconfigurable wavelength-division multiplexed (WDM) optical networks adapt the lightpath topology to balance load and reduce transmission delays. Such an adaption generally depends on a known or estimated traffic matrix. Network function virtualization (NFV) allows to implicitly change this traffic matrix. However, these two degrees of freedom have largely been considered separately, using resources suboptimally. Especially for delay-sensitive services, an optimal use of resources can be crucial. We aim to jointly optimize the embedding of virtualized network function (VNF) forwarding graphs with delay constraints and the lightpath topology of WDM optical networks. Unlike previous work, we consider all three types of delays: propagation, processing and forwarding-induced queuing delay. We model the latter two as M/M/1 queues. We formulate and analyze a mixed-integer nonlinear program (MINLP), reformulate it as a mixed-integer quadratic constrained program (MIQCP) and approximate it by a mixed-integer linear program (MILP). We evaluate our approach for small-scale examples of a multicast service.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑