University of Oulu

I. Kovacevic, A. S. Shafigh, S. Glisic, B. Lorenzo and E. Hossain, "Multi-Domain Network Slicing With Latency Equalization," in IEEE Transactions on Network and Service Management, vol. 17, no. 4, pp. 2182-2196, Dec. 2020, doi: 10.1109/TNSM.2020.3008005

Multi-domain network slicing with latency equalization

Saved in:
Author: Kovacevic, Ivana1; Shafigh, Alireza Shams1; Glisic, Savo1;
Organizations: 1Centre for Wireless Communications, University of Oulu, 90570 Oulu, Finland
2Dept. Electrical and Computer Engineering at University of Massachusetts, Amherst, USA
3University of Vigo, 36310 Vigo, Spain
4Department of Electrical and Computer Engineering at University of Manitoba, Winnipeg, Canada
Format: article
Version: accepted version
Access: open
Online Access: PDF Full Text (PDF, 2.8 MB)
Persistent link: http://urn.fi/urn:nbn:fi-fe2020111790692
Language: English
Published: Institute of Electrical and Electronics Engineers, 2020
Publish Date: 2020-11-17
Description:

Abstract

With network slicing, physical networks are partitioned into multiple virtual networks tailored to serve different types of service with their specific requirements. In order to optimize the utilization of network resources for delay-critical applications, we propose a new multi-domain network virtualization framework based on a novel multipath multihop delay model. This framework encompasses a novel hierarchical orchestration mechanism for mapping network slices onto physical resources and a mechanism for dynamic slice resizing. The main idea is to locally redefine the delay requirements on each network domain depending on the conditions in the rest of the network. Delays larger than threshold (debt) are allowed in certain domains if there is a possibility to compensate such excessive delays in other segments of the network that can transmit the messages with less latency (credit). This tradeoff or delay threshold redefinition on different segments of the route is referred to as network latency equalization. For performance comparison, minimum cost routing with latency constraints is used as a baseline. We show that our approach enables significantly better utilization of the network resources measured in the number of slices with the same latency requirements that can be accommodated in the network.

see all

Series: IEEE transactions on network and service management
ISSN: 2373-7379
ISSN-E: 1932-4537
ISSN-L: 2373-7379
Volume: 17
Issue: 4
Pages: 2182 - 2196
DOI: 10.1109/TNSM.2020.3008005
OADOI: https://oadoi.org/10.1109/TNSM.2020.3008005
Type of Publication: A1 Journal article – refereed
Field of Science: 213 Electronic, automation and communications engineering, electronics
Subjects:
Funding: The work of I. Kovacevic, A. S. Shafigh and S. Glisic was supported by the Finnish Academy/NSF US collaborative program WiFiUS 2018. The work by E. Hossain was supported by a Discovery Grant from the Natural Sciences and Engineering Research Council of Canada (NSERC).
Copyright information: © 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.