当前位置: X-MOL 学术Int. J. Comput. Sci. Eng. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Optimized flow assignment for applications with strict reliability and latency constraints using path diversity
Journal of Computational Science ( IF 3.1 ) Pub Date : 2020-06-13 , DOI: 10.1016/j.jocs.2020.101163
Zahraa Sweidan , Rania Islambouli , Sanaa Sharafeddine

The unprecedented increase in the number of smart connected devices invoked a plethora of diverse applications with different performance requirements stipulating various network management strategies. Ultra-reliable low-latency communication (URLLC), one of the promised 5G dimensions, is expected to enable mission-critical applications while adhering to the heterogeneity of their quality metrics. At its core, URLLC rests on the notion of providing stringent reliability and latency requirements, in which guaranteed network availability becomes a necessity. Network slicing (NS) is one of the key paradigms that can offer performance guarantees through customized network management of software defined networking (SDN). However, unlocking URLLC with network slicing based mechanisms requires careful demultiplexing of the network into various slices and proper assignment of traffic flows generated by ultra-reliable low latency applications over those slices. Within each slice, multiple disjoint paths may be selected to ensure the reliability requirement of the assigned application while meeting its latency constraint. Hence, we study, in this paper, the joint problem of forming end-to-end network slices, mapping URLLC applications to corresponding slices and assigning their traffic flows over multiple disjoint paths; then formulate it as a mixed integer program. Due to its complexity, we decompose the problem into two subproblems; end-to-end disjoint paths and traffic flow assignment for ultra-reliable low latency applications. Simulation results are presented for various scenarios to demonstrate the performance and scalability of the proposed decomposition approach as compared to the general formulation.



中文翻译:

使用路径多样性为具有严格可靠性和延迟限制的应用程序优化流分配

智能连接设备数量的空前增长引发了具有不同性能要求的多种应用程序,从而规定了各种网络管理策略。超可靠的低延迟通信(URLLC)是承诺的5G维度之一,预计将在支持关键任务应用程序的同时保持其质量指标的异构性。URLLC的核心思想是提供严格的可靠性和延迟要求,其中必须保证网络可用性。网络切片(NS)是可以通过软件定义网络(SDN)的定制网络管理提供性能保证的关键范例之一。然而,使用基于网络切片的机制解锁URLLC时,需要仔细地将网络多路分解为多个切片,并在这些切片上正确分配由超可靠的低延迟应用程序生成的流量。在每个切片内,可以选择多个不相交的路径以确保所分配应用程序的可靠性要求,同时满足其延迟约束。因此,在本文中,我们研究形成端到端网络切片,将URLLC应用程序映射到相应切片以及在多个不相交的路径上分配其流量的联合问题。然后将其表述为混合整数程序。由于其复杂性,我们将问题分解为两个子问题。端到端不相交的路径和业务流分配,用于超可靠的低延迟应用程序。

更新日期:2020-06-13
down
wechat
bug