{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:15:05Z","timestamp":1773656105849,"version":"3.50.1"},"reference-count":40,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"vor","delay-in-days":2142,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Trans Emerging Tel Tech"],"published-print":{"date-parts":[[2002,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diverse performance requirements. With this discipline, however, packets at higher priority levels can starve packets at lower priority levels. To resolve this starvation problem, we propose to assign a parameter to each priority queue in the SP discipline. The assigned parameter determines the probability or extent by which its corresponding queue is served when the queue is polled by the server. We thus form a new packet service discipline, referred to as the Probabilistic Priority (PP) discipline. By properly adjusting the assigned parameters, not only is the performance of higher priority classes satisfied, but also the performance of lower priority classes can be improved. This paper analyzes the delay performance of the PP discipline. A decomposition approach is proposed for calculating the average waiting times and their bounds are studied. Two approximation approaches are proposed to estimate the waiting times. Simulation results that validate the numerical analysis are presented and examined. A numerical example which demonstrates the use of the PP discipline to achieve service differentiation is presented. This example also shows how the assigned parameters can be determined from the results of analysis mentioned above.<\/jats:p>","DOI":"10.1002\/ett.4460130603","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T13:41:44Z","timestamp":1221226904000},"page":"563-577","source":"Crossref","is-referenced-by-count":17,"title":["Delay analysis of a probabilistic priority discipline"],"prefix":"10.1002","volume":"13","author":[{"given":"Yuming","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Chen\u2010Khong","family":"Tham","sequence":"additional","affiliation":[]},{"given":"Chi\u2010Chung","family":"Ko","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Priority Queues","author":"Jaiswal N. K.","year":"1968"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/5.259431"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03612-9"},{"key":"e_1_2_1_5_2","volume-title":"An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network","author":"Keshav S.","year":"1997"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/5.469298"},{"key":"e_1_2_1_7_2","volume-title":"Queueing Systems","author":"Kleinrock L.","year":"1975"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/9.403"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"K.Nichols V.Jacobson andL.Zhang A two\u2010bit differentiated services architecture for the internet.IETF Internet Draft April1999.","DOI":"10.17487\/rfc2638"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/49.772446"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/49.414637"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/90.556345"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/90.502234"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/9.8648"},{"key":"e_1_2_1_15_2","doi-asserted-by":"crossref","unstructured":"C.Dovrolis D.Stiliadis andP.Ramanaman Proportional differentiated services: Delay differentiation and packet scheduling. InACM SIGCOMM '99 1999.","DOI":"10.1145\/316188.316211"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.2307\/3214016"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.99140"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.8940"},{"issue":"3","key":"e_1_2_1_19_2","doi-asserted-by":"crossref","first-page":"236","DOI":"10.15807\/jorsj.35.236","article-title":"Analysis of a two\u2010class priority queue with Bernoulli schedules","volume":"35","author":"Katayama T.","year":"1992","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"e_1_2_1_20_2","unstructured":"D. S.Lee Generalized longest queue first: An adaptive scheduling discipline for ATM networks. InIEEE Info\u2010com'97 1997."},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/0140-3664(90)90158-D"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.1986.1146396"},{"key":"e_1_2_1_23_2","doi-asserted-by":"crossref","unstructured":"J. C. R.BennettandH.Zhang WF2Q: Worst\u2010case fair weighted fair queueing. InIEEE Infocom'96 pages120\u2013128 1996.","DOI":"10.1109\/INFCOM.1996.497885"},{"key":"e_1_2_1_24_2","doi-asserted-by":"crossref","unstructured":"P.Goyal H. M.Vin andH.Cheng Start\u2010time fair queueing: A scheduling algorithm for integrated services packet switching networks. InACM SIGCOMM'96 pages157\u2013168 1996.","DOI":"10.1145\/248157.248171"},{"key":"e_1_2_1_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/90.502236"},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(90)90017-D"},{"key":"e_1_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019185509235"},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.2307\/3215185"},{"key":"e_1_2_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.87178"},{"key":"e_1_2_1_30_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.5.885"},{"key":"e_1_2_1_31_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.44.5.758"},{"key":"e_1_2_1_32_2","unstructured":"D. J.Daley A. Y.Kreinin andC. D.Trengove Inequalities concerning the waiting\u2010time in single\u2010server queues: a survey.Queueing and related methods.U.N. Bhat and I.V. Basawa editors pages177\u2013223. Oxford 1992."},{"key":"e_1_2_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/4234.917105"},{"key":"e_1_2_1_34_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1937-5956.1993.tb00094.x"},{"key":"e_1_2_1_35_2","unstructured":"Y.Jiang C. K.Tham andC. C.Ko A probabilistic priority scheduling discipline for multi\u2010service networks. InIEEE ISCC'2001 July2001."},{"key":"e_1_2_1_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(87)90057-5"},{"key":"e_1_2_1_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/s005300050148"},{"key":"e_1_2_1_38_2","unstructured":"B.Walke Improved bounds and an approximation for a dynamic priority queue. InProc. 3rd Int. Symp. Modeling and Perform. Eval. Comput. Syst. pages321\u2013346. North\u2010Holland 1978."},{"key":"e_1_2_1_39_2","first-page":"241","volume-title":"Performance of Computer Systems","author":"Walke B.","year":"1979"},{"key":"e_1_2_1_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1980.230477"},{"key":"e_1_2_1_41_2","doi-asserted-by":"crossref","unstructured":"S.Delas R. R.Mazumdar andC.Rosenberg Cell loss asymptotics in priority queues accessed by a large number of independent stationary sources. InIEEE Infocom'99 pages551\u2013558 1999.","DOI":"10.1109\/INFCOM.1999.751389"}],"container-title":["European Transactions on Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fett.4460130603","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/ett.4460130603","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:36:44Z","timestamp":1738363004000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1002\/ett.4460130603"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":40,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["10.1002\/ett.4460130603"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1002\/ett.4460130603","archive":["Portico"],"relation":{},"ISSN":["1124-318X","1541-8251"],"issn-type":[{"value":"1124-318X","type":"print"},{"value":"1541-8251","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}