首页|Scheduling Reconfigurable Service Function Chain

Scheduling Reconfigurable Service Function Chain

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
  • 维普
Network function virtualization (NFV),has been widely adopted in existing networks since it brings lower capital expenditure and operating expense,as well as flexible and elastic deployment.Based on NFV,dynamic Service function chain (SFC) provides more comprehensive and thorough traffic steering over a series of middleboxes,e.g.,DPI,and IDS.Nevertheless,dynamic SFC involves internal state migration in middleboxes,making it hard to allocate SFC requests.We propose a reconfigurable SFC scheduling approach with consideration on resource constraints and race of the state migration to collaborate the execution of the SFC reconfiguration,in the reasonable fashion based on a heuristic algorithm.The evaluation is conducted through discrete event simulation to validate the efficiency of our reconfigurable SFC scheduling,and the results demonstrate that the proposed method outperforms First Come First Serve scheduling and random scheduling.

Network function virtualization(NFV)Service function chain(SFC)State migrationSDN

ZHU Kai、WU Chunming、ZHOU Boyang

展开 >

College of Computer Science, Zhejiang University, Hangzhou 310027, China

Zhejiang Lab, Hangzhou 310000, China

This work is supported by the National Key Research and Development Program of ChinaKey Research and Development Program of Zhejiang ProvinceKey Research and Development Program of Zhejiang ProvinceMajor Scientific Project of Zhejiang Lab

2018YFB21004042019C01064No.2018C010082018FD0ZX01

2019

10.1049/cje.2019.08.011

中国电子杂志(英文版)

中国电子杂志(英文版)

CSTPCDCSCDSCIEI
ISSN：1022-4653
年,卷(期)：2019.28(6)
  • 16