中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 数学与系统科学研究院
  3. 中国科学院数学与系统科学研究院
  4. 计算数学与科学工程计算研究所
Network Slicing for Service-Oriented Networks Under Resource Constraints

文献类型：期刊论文

作者Zhang, Nan1; Liu, Ya-Feng2; Farmanbar, Hamid3; Chang, Tsung-Hui5,6; Hong, Mingyi4; Luo, Zhi-Quan5,7
刊名IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
出版日期2017-11-01
卷号35期号:11页码:2512-2521
ISSN号0733-8716
关键词Software defined network network function virtualization traffic engineering
DOI10.1109/JSAC.2017.2760147
英文摘要To support multiple on-demand services over fixed communication networks, network operators must allow flexible customization and fast provision of their network resources. One effective approach to this end is network virtualization, whereby each service is mapped to a virtual subnetwork providing dedicated on-demand support to network users. In practice, each service consists of a prespecified sequence of functions, called a service function chain (SFC), while each service function in a SFC can only be provided by some given network nodes. Thus, to support a given service, we must select network function nodes according to the SFC and determine the routing strategy through the function nodes in a specified order. A crucial network slicing problem that needs to be addressed is how to optimally localize the service functions in a physical network as specified by the SFCs, subject to link and node capacity constraints. In this paper, we formulate the network slicing problem as a mixed binary linear program and establish its strong NP-hardness. Furthermore, we propose efficient penalty successive upper bound minimization (PSUM) and PSUM-R(ounding) algorithms, and two heuristic algorithms to solve the problem. Simulation results are shown to demonstrate the effectiveness of the proposed algorithms.
资助项目Natural Science Foundation of China[61571384] ; Natural Science Foundation of China[61571385] ; Natural Science Foundation of China[11671419] ; Natural Science Foundation[CCF-1526434] ; Natural Science Foundation[CCF-1526078] ; AFOSR[15RT0767] ; CUHK (SZ) President Fund[PF.01.000183]
WOS研究方向Engineering ; Telecommunications
语种英语
出版者IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
WOS记录号WOS:000417338400009
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/27119]  
专题计算数学与科学工程计算研究所
通讯作者Liu, Ya-Feng
作者单位1.Peking Univ, Sch Math Sci, Dept Sci & Engn Comp, Beijing, Peoples R China
2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Computat Math & Sci Engn Comp, State Key Lab Sci & Engn Comp, Beijing, Peoples R China
3.Huawei Canada Res Ctr, Kanata, ON, Canada
4.Univ Minnesota, Dept Elect & Comp Engn, Minneapolis, MN USA
5.Shenzhen Res Inst Big Data, Shenzhen, Peoples R China
6.Chinese Univ Hong Kong, Sch Sci & Engn, Shenzhen, Peoples R China
7.Chinese Univ Hong Kong, Shenzhen, Peoples R China
推荐引用方式
GB/T 7714		 Zhang, Nan,Liu, Ya-Feng,Farmanbar, Hamid,et al. Network Slicing for Service-Oriented Networks Under Resource Constraints[J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS,2017,35(11):2512-2521.
APA Zhang, Nan,Liu, Ya-Feng,Farmanbar, Hamid,Chang, Tsung-Hui,Hong, Mingyi,&Luo, Zhi-Quan.(2017).Network Slicing for Service-Oriented Networks Under Resource Constraints.IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS,35(11),2512-2521.
MLA Zhang, Nan,et al."Network Slicing for Service-Oriented Networks Under Resource Constraints".IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 35.11(2017):2512-2521.

入库方式： OAI收割

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

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

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