research-article

A Novel NFV Schedule Optimization Approach with Sensitivity to Packets Dropping Positions

Authors:

Lin CuiAuthors Info & Claims

TOPIC '18: Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms

Pages 23 - 28

https://doi.org/10.1145/3229774.3229778

Published: 23 July 2018 Publication History

Abstract

Network Function Virtualization (NFV) is a promising approach for providing efficient and flexible network functions deployment, which also reduces the cost in the network operations compared to traditional method using dedicated hardware. Multiple virtual network functions can be chained together working as service chain to provide a specific service. When multiple network functions share computing resources, how to efficiently schedule them dynamically is a great challenge. In this paper, we first investigate the issue that a single packet drop occurs at different positions of a service chain may have different impact on the performance. In light of this, a packets dropping cost model is carefully defined based on the NF positions in a service chain. Then, according to linear programming, a Minimizing Dropping Cost (MDC) approach is proposed to optimally schedule vNFs. Simulation results show that the proposed algorithm can reduce the total incurred cost by up to 60% compared to the existing common schedule approach.

References

[1]

Hyame Assem Alameddine, Samir Sebbah, and Chadi Assi . 2017. On the Interplay Between Network Function Mapping and Scheduling in VNF-Based Networks: A Column Generation Approach. IEEE Transactions on Network and Service Management Vol. 14, 4 (2017), 860--874.

Digital Library

[2]

Michael Till Beck and Juan Felipe Botero . 2017. Scalable and coordinated allocation of service function chains. Computer Communications Vol. 102 (2017), 78--88.

Digital Library

[3]

Nicolas El Khoury, Sara Ayoubi, and Chadi Assi . 2016. Energy-aware placement and scheduling of network traffic flows with deadlines on virtual network functions. In Cloud Networking (Cloudnet), 2016 5th IEEE International Conference on. IEEE, 89--94.

[4]

Victor Klee, George J Minty, and O Shisha . 1972. Inequalities, III. How Good is the Simplex Algorithm (1972), 159--175.

[5]

Sameer G Kulkarni, Wei Zhang, Jinho Hwang, Shriram Rajagopalan, KK Ramakrishnan, Timothy Wood, Mayutan Arumaithurai, and Xiaoming Fu . 2017. NFVnice: Dynamic Backpressure and Scheduling for NFV Service Chains Proceedings of the Conference of the ACM Special Interest Group on Data Communication. ACM, ACM, 71--84.

Digital Library

[6]

Xin Li and Chen Qian . 2015. Low-complexity multi-resource packet scheduling for network function virtualization Computer Communications (INFOCOM), 2015 IEEE Conference on. IEEE, 1400--1408.

[7]

Paul Menage . 2004. Cgroup. deftempurl%https://www.kernel.org/doc/Documentation/cgroup-v1/cgroups.txt tempurl

[8]

Chuan Pham, Nguyen H Tran, and Choong Seon Hong . 2018. Virtual Network Function Scheduling: A Matching Game Approach. IEEE Communications Letters Vol. 22, 1 (2018), 69--72.

[9]

Chuan Pham, Nguyen H Tran, Shaolei Ren, Walid Saad, and Choong Seon Hong . 2017. Traffic-aware and energy-efficient vnf placement for service chaining: Joint sampling and matching approach. IEEE Transactions on Services Computing (2017).

[10]

Long Qu, Chadi Assi, and Khaled Shaban . 2016. Delay-aware scheduling and resource optimization with network function virtualization. IEEE Transactions on Communications Vol. 64, 9 (2016), 3746--3758.

[11]

John F Shortle, James M Thompson, Donald Gross, and Carl M Harris . 2018. Fundamentals of queueing theory. John Wiley & Sons.

[12]

J MacGregor Smith . 2004. Optimal design and performance modelling of M/G/1/K queueing systems. Mathematical and computer modelling Vol. 39, 9--10 (2004), 1049--1081.

Digital Library

[13]

Daniel Spielman and Shang-Hua Teng . 2001. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. In Proceedings of the thirty-third annual ACM symposium on Theory of computing. ACM, 296--305.

Digital Library

[14]

Chen Sun, Jun Bi, Zhilong Zheng, Heng Yu, and Hongxin Hu . 2017. NFP: Enabling Network Function Parallelism in NFV. In Proceedings of the Conference of the ACM Special Interest Group on Data Communication. ACM, 43--56.

Digital Library

[15]

Sheng Tao, Lin Gu, Deze Zeng, Hai Jin, and Kan Hu . 2017. Fairness-aware dynamic rate control and flow scheduling for network function virtualization. In Quality of Service (IWQoS), 2017 IEEE/ACM 25th International Symposium on. IEEE, 1--6.

[16]

Hong Yao, Muzhou Xiong, Hui Li, Lin Gu, and Deze Zeng . 2018. Joint optimization of function mapping and preemptive scheduling for service chains in network function virtualization. Future Generation Computer Systems (2018).

[17]

Bo Yi, Xingwei Wang, and Min Huang . 2018. A Generalized VNF Sharing Approach for Service Scheduling. IEEE Communications Letters Vol. 22, 1 (2018), 73--76.

[18]

Masahiro Yoshida, Wenyu Shen, Taichi Kawabata, Kenji Minato, and Wataru Imajuku . 2014. MORSA: A multi-objective resource scheduling algorithm for NFV infrastructure Network Operations and Management Symposium (APNOMS), 2014 16th Asia-Pacific. IEEE, 1--6.

Cited By

Anthony Chowdhury SBai TBoutaba RFrancois J(2022)Non-Intrusive and Workflow-Aware Virtual Network Function Scheduling in User-SpaceIEEE Transactions on Cloud Computing10.1109/TCC.2020.302423210:3(1975-1990)Online publication date: 1-Jul-2022
https://doi.org/10.1109/TCC.2020.3024232
Zhang YCui LTso FGuan QJia WZhou J(2019)Mystique: A Fine-Grained and Transparent Congestion Control Enforcement SchemeIEEE Transactions on Network and Service Management10.1109/TNSM.2019.293582916:4(1869-1883)Online publication date: Dec-2019
https://doi.org/10.1109/TNSM.2019.2935829
Zhang YHe FSato TOki E(2019)Optimization of Network Service Scheduling with Resource Sharing and Preemption2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)10.1109/HPSR.2019.8808118(1-6)Online publication date: May-2019
https://doi.org/10.1109/HPSR.2019.8808118

Index Terms

A Novel NFV Schedule Optimization Approach with Sensitivity to Packets Dropping Positions
1. Networks

Recommendations

NFVnice: Dynamic Backpressure and Scheduling for NFV Service Chains
SIGCOMM '17: Proceedings of the Conference of the ACM Special Interest Group on Data Communication

Managing Network Function (NF) service chains requires careful system resource management. We propose NFVnice, a user space NF scheduling and service chain management framework to provide fair, efficient and dynamic resource scheduling capabilities on ...
A flexible and efficient container-based NFV platform for middlebox networking
SAC '18: Proceedings of the 33rd Annual ACM Symposium on Applied Computing

Network Function Virtualization (NFV) enables multiple network functions (NFs) to operate simultaneously on a commodity server. Internet Data Centers (IDCs) gain significant flexibility and agility through NFV's ability to dynamically deploy and ...
Design Challenges for High Performance, Scalable NFV Interconnects
KBNets '17: Proceedings of the Workshop on Kernel-Bypass Networks

Software-based network functions (NFs) have seen growing interest. Increasingly complex functionality is achieved by having multiple functions chained together to support the required network-resident services. Network Function Virtualization (NFV) ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

TOPIC '18: Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms

July 2018

40 pages

ISBN:9781450357760

DOI:10.1145/3229774

General Chairs:
Posco Tso
Loughborough University, UK
,
Amitabh Trehan
Loughborough University, UK
,
Iain Phillips
Loughborough University, UK
,
Lin Cui
Jinan University, China

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 July 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Fundamental Research Funds for the Central Universities
Chinese National Research Fund (NSFC)

Conference

PODC '18

PODC '18: ACM Symposium on Principles of Distributed Computing

July 27, 2018

Egham, United Kingdom

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
157
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Anthony Chowdhury SBai TBoutaba RFrancois J(2022)Non-Intrusive and Workflow-Aware Virtual Network Function Scheduling in User-SpaceIEEE Transactions on Cloud Computing10.1109/TCC.2020.302423210:3(1975-1990)Online publication date: 1-Jul-2022
https://doi.org/10.1109/TCC.2020.3024232
Zhang YCui LTso FGuan QJia WZhou J(2019)Mystique: A Fine-Grained and Transparent Congestion Control Enforcement SchemeIEEE Transactions on Network and Service Management10.1109/TNSM.2019.293582916:4(1869-1883)Online publication date: Dec-2019
https://doi.org/10.1109/TNSM.2019.2935829
Zhang YHe FSato TOki E(2019)Optimization of Network Service Scheduling with Resource Sharing and Preemption2019 IEEE 20th International Conference on High Performance Switching and Routing (HPSR)10.1109/HPSR.2019.8808118(1-6)Online publication date: May-2019
https://doi.org/10.1109/HPSR.2019.8808118

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten