Multi-priority scheduling using network calculus: Model and analysis

Jun Huang, Zi Xiong, Yanbing Liu, Qiang Duan, Yunlong He, Juan Lv, Jianyu Wang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations


Network Calculus (NC) is a powerful means to provide deep insight for flow problems in network performance analysis. Multi-priority scheduling as one of the fundamental models in NC has become an active research topic recently. However, existing works consider neither the arrival interval of the flows nor their arrival orders; thus limiting their applications to only a few delicate scenarios. In this paper, we address these two issues and propose a novel multi-priority model based on the non-preemptive priority scheduling. We derive the theoretical formulation for the service curve under this model, and then obtain the upper bounds of delay and backlog for multi-priority scheduling. We also use two representative case studies to show the correctness and effectiveness of the proposed model. The theoretical analysis is further validated by the numerical experiments. In addition, we discuss the factors that may affect the delay and backlog bounds according to the numerical results.

Original languageEnglish (US)
Title of host publication2013 IEEE Global Communications Conference, GLOBECOM 2013
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
ISBN (Print)9781479913534
StatePublished - 2013
Event2013 IEEE Global Communications Conference, GLOBECOM 2013 - Atlanta, GA, United States
Duration: Dec 9 2013Dec 13 2013

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference


Other2013 IEEE Global Communications Conference, GLOBECOM 2013
Country/TerritoryUnited States
CityAtlanta, GA

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering


Dive into the research topics of 'Multi-priority scheduling using network calculus: Model and analysis'. Together they form a unique fingerprint.

Cite this