中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 数学与系统科学研究院
  3. 中国科学院数学与系统科学研究院
Optimal Network Slicing for Service-Oriented Networks With Flexible Routing and Guaranteed E2E Latency

文献类型：期刊论文

作者Chen, Wei-Kun1,2; Liu, Ya-Feng3; De Domenico, Antonio4; Luo, Zhi-Quan5; Dai, Yu-Hong3
刊名IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT
出版日期2021-12-01
卷号18期号:4页码:4337-4352
关键词Routing Cloud computing Network slicing Delays 5G mobile communication Service function chaining Data centers Energy efficiency E2E delay network function virtualization network slicing resource allocation service function chain
ISSN号1932-4537
DOI10.1109/TNSM.2021.3087483
英文摘要Network function virtualization is a promising technology to simultaneously support multiple services with diverse characteristics and requirements in the 5G and beyond networks. In particular, each service consists of a predetermined sequence of functions, called service function chain (SFC), running on a cloud environment. To make different service slices work properly in harmony, it is crucial to appropriately select the cloud nodes to deploy the functions in the SFC and flexibly route the flow of the services such that these functions are processed in the order defined in the corresponding SFC, the end-to-end (E2E) latency constraints of all services are guaranteed, and all cloud and communication resource budget constraints are respected. In this paper, we first propose a new mixed binary linear program (MBLP) formulation of the above network slicing problem that optimizes the system energy efficiency while jointly considers the E2E latency requirement, resource budget, flow routing, and functional instantiation. Then, we develop another MBLP formulation and show that the two formulations are equivalent in the sense that they share the same optimal solution. However, since the numbers of variables and constraints in the second problem formulation are significantly smaller than those in the first one, solving the second problem formulation is more computationally efficient especially when the dimension of the corresponding network is large. Numerical results demonstrate the advantage of the proposed formulations compared with the existing ones.
资助项目Beijing Institute of Technology Research Fund Program for Young Scholars ; National Natural Science Foundation of China (NSFC)[12022116] ; National Natural Science Foundation of China (NSFC)[12021001] ; National Natural Science Foundation of China (NSFC)[11688101] ; National Natural Science Foundation of China (NSFC)[11991021] ; National Natural Science Foundation of China (NSFC)[11631013] ; Strategic Priority Research Program of Chinese Academy of Sciences[XDA27000000] ; National Natural Science Foundation of China[61731018] ; Shenzhen Fundamental Research Fund[KQTD201503311441545]
WOS研究方向Computer Science
语种英语
WOS记录号WOS:000728930000029
出版者IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/59667]  
专题中国科学院数学与系统科学研究院
通讯作者Liu, Ya-Feng
作者单位1.Beijing Inst Technol, Sch Math & Stat, Beijing 100081, Peoples R China
2.Beijing Inst Technol, Beijing Key Lab MCAACI, Beijing 100081, Peoples R China
3.Chinese Acad Sci, Acad Math & Syst Sci, Inst Computat Math & Sci Engn Comp, State Key Lab Sci & Engn Comp, Beijing 100190, Peoples R China
4.Huawei Technol Co Ltd, France Res Ctr, F-92100 Boulogne, France
5.Chinese Univ Hong Kong, Shenzhen Res Inst Big Data, Shenzhen 518172, Peoples R China
推荐引用方式
GB/T 7714		 Chen, Wei-Kun,Liu, Ya-Feng,De Domenico, Antonio,et al. Optimal Network Slicing for Service-Oriented Networks With Flexible Routing and Guaranteed E2E Latency[J]. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT,2021,18(4):4337-4352.
APA Chen, Wei-Kun,Liu, Ya-Feng,De Domenico, Antonio,Luo, Zhi-Quan,&Dai, Yu-Hong.(2021).Optimal Network Slicing for Service-Oriented Networks With Flexible Routing and Guaranteed E2E Latency.IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT,18(4),4337-4352.
MLA Chen, Wei-Kun,et al."Optimal Network Slicing for Service-Oriented Networks With Flexible Routing and Guaranteed E2E Latency".IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 18.4(2021):4337-4352.

入库方式： OAI收割

来源：数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。