access icon free Scheduling Reconfigurable Service Function Chain

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.

Inspec keywords: virtualisation; discrete event simulation; scheduling

Other keywords: lower capital expenditure; network function virtualization; dynamic service function chain; discrete event simulation; internal state migration; NFV; first come first serve scheduling; reconfigurable service function chain scheduling; middleboxes; traffic steering; dynamic SFC; random scheduling; SFC reconfiguration; reconfigurable SFC scheduling approach; SFC requests

Subjects: Operating systems

http://iet.metastore.ingenta.com/content/journals/10.1049/cje.2019.08.011
Loading

Related content

content/journals/10.1049/cje.2019.08.011
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading