Journal on Communications ›› 2021, Vol. 42 ›› Issue (11): 66-78.doi: 10.11959/j.issn.1000-436x.2021189

• Papers • Previous Articles     Next Articles

Service chain deployment algorithms for deterministic end-to-end delay upper bound

Ze’nan WANG1,2, Jiao ZHANG2,1, Shuo WANG1,2, Tao HUANG1,2, F.Richard Yu3   

  1. 1 Purple Mountain Laboratories, Nanjing 211111, China
    2 State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
    3 Carleton University, Ottawa K1S 5B6, Canada
  • Revised:2021-09-11 Online:2021-11-25 Published:2021-11-01
  • Supported by:
    The National Key Research and Development Program of China(2020YFB1805200);The National Natural Science Foundation of China(61872401);The National Natural Science Foundation of China(62132022);Fok Ying-Tong Education Foundation(171059)

Abstract:

To solve the problem that the current service chain deployment algorithms cannot guarantee the delay of each packet passing through the service chain (SC), a SC deployment algorithm for deterministic end-to-end delay upper bound was proposed.First, the end-to-end delay bound of the SC was derived based on network calculus.Then, the deterministic end-to-end delay bound of the SC was achieved by collaboratively optimizing the routing of SC and the resource allocation of the virtual network function nodes in the SC.The experimental results show that the proposed algorithm can effectively improve the volume of accepted SC while guaranteeing that the end-to-end delay of each packet satisfies the delay requirements.

Key words: end-to-end delay, service chain, network function virtualization, network calculus

CLC Number: 

No Suggested Reading articles found!