Optimized flow assignment for applications with strict reliability and latency constraints using path diversity

LAUR Repository

Show simple item record

dc.contributor.author Sweidan, Zahraa
dc.contributor.author Islambouli, Rania
dc.contributor.author Sharafeddine, Sanaa
dc.date.accessioned 2020-07-07T11:05:25Z
dc.date.available 2020-07-07T11:05:25Z
dc.date.copyright 2020 en_US
dc.date.issued 2020-07-07
dc.identifier.issn 1877-7503 en_US
dc.identifier.uri http://hdl.handle.net/10725/11955
dc.description.abstract 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. en_US
dc.language.iso en en_US
dc.title Optimized flow assignment for applications with strict reliability and latency constraints using path diversity en_US
dc.type Article en_US
dc.description.version Published en_US
dc.author.school SAS en_US
dc.author.idnumber 200502746 en_US
dc.author.department Computer Science And Mathematics en_US
dc.description.embargo N/A en_US
dc.relation.journal Journal of Computational Science en_US
dc.journal.volume 44 en_US
dc.keywords URLLC en_US
dc.keywords Industry 4.0 en_US
dc.keywords Network slicing en_US
dc.keywords Multipath diversity en_US
dc.keywords Traffic flow assignment en_US
dc.identifier.doi https://doi.org/10.1016/j.jocs.2020.101163 en_US
dc.identifier.ctation Sweidan, Z., Islambouli, R., & Sharafeddine, S. (2020). Optimized Flow Assignment for Applications with Strict Reliability and Latency Constraints Using Path Diversity. Journal of Computational Science, 44. en_US
dc.author.email sanaa.sharafeddine@lau.edu.lb en_US
dc.identifier.tou http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php en_US
dc.identifier.url https://www.sciencedirect.com/science/article/pii/S1877750320304646 en_US
dc.orcid.id https://orcid.org/0000-0001-6548-1624 en_US
dc.author.affiliation Lebanese American University en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account