{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:26:37Z","timestamp":1760243197669,"version":"build-2065373602"},"reference-count":18,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2015,12,29]],"date-time":"2015-12-29T00:00:00Z","timestamp":1451347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>Packet scheduling is key to quality of service (QoS) capabilities of broadband wired and wireless networks. In a heterogeneous traffic environment, a comprehensive QoS packet scheduler must strike a balance between flow fairness and access delay. Many advanced packet scheduling solutions have targeted fair bandwidth allocation while protecting delay-constrained traffic by adding priority queue(s) on top of a fair bandwidth scheduler. Priority queues are known to cause performance uncertainties and, thus, various modifications have been proposed. In this paper, we present a packet queueing engine dubbed Fractional Service Buffer (FSB), which, when coupled with a configurable flow scheduler, can achieve desired QoS objectives, such as fair throughputs and differentiated delay guarantees. Key performance metrics, such as delay limit and probability of delay limit violation, are derived as a function of key FSB parameters for each delay class in the packet queueing engine using diffusion approximations. OPNET simulations verify these analytical results.<\/jats:p>","DOI":"10.3390\/fi8010001","type":"journal-article","created":{"date-parts":[[2015,12,29]],"date-time":"2015-12-29T10:00:08Z","timestamp":1451383208000},"page":"1","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Priority Queues with Fractional Service for Tiered Delay QoS"],"prefix":"10.3390","volume":"8","author":[{"given":"Gary","family":"Chang","sequence":"first","affiliation":[{"name":"Department of EECS, Northwestern University, Evanston, IL 60201, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung-Chieh","family":"Lee","sequence":"additional","affiliation":[{"name":"Department of EECS, Northwestern University, Evanston, IL 60201, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2015,12,29]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1109\/TNET.2004.838601","article-title":"SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks","volume":"12","author":"Guo","year":"2004","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_2","unstructured":"Jiwasurat, S., Kesidis, G., and Miller, D. (December, January 28). Hierarchical shaped Deficit Round-Robin scheduling. Proceedings of the IEEE Global Telecommunications Conference, St. Louis, MO, USA."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1109\/71.993210","article-title":"Fair and efficient packet scheduling using elastic round robin","volume":"13","author":"Kanhere","year":"2002","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1109\/90.502236","article-title":"Efficient fair queuing using deficit round-robin","volume":"4","author":"Shreedhar","year":"1996","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Ramabhadran, S., and Pasquale, J. (2003, January 25\u201329). Stratified Round Robin: A low complexity packet scheduler with bandwidth fairness and bounded delay. Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Karlsruhe, Germany.","DOI":"10.1145\/863955.863983"},{"key":"ref_6","unstructured":"Zhang, H., and Ferrari, D. (April, January 28). Rate-Controlled Static-Priority Queueing. Proceedings of the Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies, San Francisco, CA, USA."},{"key":"ref_7","first-page":"113","article-title":"Stochastic fairness queueing","volume":"2","author":"McKenney","year":"1991","journal-title":"J. Internetworking Res. Exp."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Dovrolis, C., Stiliadis, D., and Ramanathan, P. (1999). Proportional Differentiated Services: Delay Differentiation and Packet Scheduling, ACM.","DOI":"10.1145\/316188.316211"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/90.234856","article-title":"A generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case","volume":"1","author":"Parekh","year":"1993","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_10","unstructured":"Kleinrock, L. (1976). Queuing Systems, Volume II: Computer Applications, Wiley-Interscience."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"4072","DOI":"10.1016\/j.comcom.2008.08.007","article-title":"Fair bandwidth sharing and delay differentiation: Joint packet scheduling with buffer management","volume":"31","author":"Zhou","year":"2008","journal-title":"Comput. Commun."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1109\/26.54979","article-title":"Analysis of a delay-dependent priority discipline in an integrated multiclass traffic fast packet switch","volume":"38","author":"Lim","year":"1990","journal-title":"IEEE Trans. Commun."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10479-008-0314-5","article-title":"Performance comparison of several priority schemes with priority jumps","volume":"162","author":"Maertens","year":"2008","journal-title":"Ann. Oper. Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1374","DOI":"10.1109\/5.469298","article-title":"Service disciplines for guaranteed performance service in packet-switching networks","volume":"83","author":"Zhang","year":"1995","journal-title":"IEEE Proc."},{"key":"ref_15","unstructured":"Avrachenkov, K., Ayesta, U., Brown, P., and Nyberg, E. (2004, January 7\u201311). Differentiation between short and long tcp flows: Predictability of the response time. Proceedings of the Twenty-Third AnnualJoint Conference of the IEEE Computer and Communications Societies, Hong Kong, China."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1109\/49.414642","article-title":"Optimal Buffer Sharing","volume":"13","author":"Cidon","year":"1995","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0377-2217(92)90241-Z","article-title":"Queueing models for performance analysis: Selection of single station models","volume":"58","author":"Springer","year":"1992","journal-title":"Eur. J. Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/321879.321888","article-title":"On approximate computer system models","volume":"22","author":"Gelenbe","year":"1975","journal-title":"J. ACM"}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/8\/1\/1\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T20:54:57Z","timestamp":1760216097000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/8\/1\/1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,29]]},"references-count":18,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2016,3]]}},"alternative-id":["fi8010001"],"URL":"https:\/\/doi.org\/10.3390\/fi8010001","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2015,12,29]]}}}