{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T07:44:52Z","timestamp":1768722292648,"version":"3.49.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2016,2,22]],"date-time":"2016-02-22T00:00:00Z","timestamp":1456099200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM Trans. Model. Perform. Eval. Comput. Syst."],"published-print":{"date-parts":[[2016,3,31]]},"abstract":"<jats:p>We study a multiclass time-sharing discipline with relative priorities known as discriminatory processor sharing (DPS), which provides a natural framework to model service differentiation in systems. The analysis of DPS is extremely challenging, and analytical results are scarce. We develop closed-form approximations for the mean conditional (on the service requirement) and unconditional sojourn times. The main benefits of the approximations lie in its simplicity, the fact that it applies for general service requirements with finite second moments, and that it provides insights into the dependency of the performance on the system parameters. We show that the approximation for the mean conditional and unconditional sojourn time of a customer is decreasing as its relative priority increases. We also show that the approximation is exact in various scenarios, and that it is uniformly bounded in the second moments of the service requirements. Finally, we numerically illustrate that the approximation for exponential, hyperexponential, and Pareto service requirements is accurate across a broad range of parameters.<\/jats:p>","DOI":"10.1145\/2812807","type":"journal-article","created":{"date-parts":[[2016,5,21]],"date-time":"2016-05-21T22:27:38Z","timestamp":1463869658000},"page":"1-31","source":"Crossref","is-referenced-by-count":4,"title":["Sojourn Time Approximations for a Discriminatory Processor Sharing Queue"],"prefix":"10.1145","volume":"1","author":[{"given":"A.","family":"Izagirre","sequence":"first","affiliation":[{"name":"CNRS-LAAS, Univ. de Toulouse, UPV-EHU"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"Ayesta","sequence":"additional","affiliation":[{"name":"CNRS-LAAS, Ikerbasque, UPV-EHU"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. M.","family":"Verloop","sequence":"additional","affiliation":[{"name":"CNRS-IRIT, Univ. de Toulouse"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,2,22]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-006-7586-8"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the IEEE INFOCOM Conference.","author":"Altman E.","unstructured":"E. Altman , T. Jimenez , and D. Kofman . 2004. DPS queues with stationary ergodic service times and the performance of TCP in overload . In Proceedings of the IEEE INFOCOM Conference. E. Altman, T. Jimenez, and D. Kofman. 2004. DPS queues with stationary ergodic service times and the performance of TCP in overload. In Proceedings of the IEEE INFOCOM Conference."},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the IEEE INFOCOM Conference.","author":"Avrachenkov K. E.","unstructured":"K. E. Avrachenkov , U. Ayesta , P. Brown , and R. N\u00fa\u00f1ez-Queija . 2005. Discriminatory processor sharing revisited . In Proceedings of the IEEE INFOCOM Conference. K. E. Avrachenkov, U. Ayesta, P. Brown, and R. N\u00fa\u00f1ez-Queija. 2005. Discriminatory processor sharing revisited. In Proceedings of the IEEE INFOCOM Conference."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-006-7585-9"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2004.11.010"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aeue.2005.11.007"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/378420.378786"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the ITC-19 Conference.","author":"Cheung S. K.","unstructured":"S. K. Cheung , J. L. van den Berg, R. J. Boucherie, R. Litjens, and F. Roijers. 2005. An analytical packet\/flow-level modelling approach for wireless LANs with quality-of-service support . In Proceedings of the ITC-19 Conference. S. K. Cheung, J. L. van den Berg, R. J. Boucherie, R. Litjens, and F. Roijers. 2005. An analytical packet\/flow-level modelling approach for wireless LANs with quality-of-service support. In Proceedings of the ITC-19 Conference."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/322203.322212"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383068"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.2307\/1427484"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0359-0"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11422778_66"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the IEEE INFOCOM Conference.","author":"Izagirre A.","unstructured":"A. Izagirre , U. Ayesta , and I. M. Verloop . 2014. Sojourn time approximations in a multi-class time-sharing system . In Proceedings of the IEEE INFOCOM Conference. A. Izagirre, U. Ayesta, and I. M. Verloop. 2014. Sojourn time approximations in a multi-class time-sharing system. In Proceedings of the IEEE INFOCOM Conference."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2015.06.005"},{"key":"e_1_2_1_17_1","volume-title":"Stochastic Networks and Reversibility","author":"Kelly F. P.","unstructured":"F. P. Kelly . 1979. Stochastic Networks and Reversibility . Wiley , Chichester, UK . F. P. Kelly. 1979. Stochastic Networks and Reversibility. Wiley, Chichester, UK."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460080106"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the IEEE INFOCOM Conference.","author":"Kherani A. A.","unstructured":"A. A. Kherani and R. N\u00fa\u00f1ez-Queija . 2006. TCP as an implementation of age-based scheduling: Fairness and performance . In Proceedings of the IEEE INFOCOM Conference. A. A. Kherani and R. N\u00fa\u00f1ez-Queija. 2006. TCP as an implementation of age-based scheduling: Fairness and performance. In Proceedings of the IEEE INFOCOM Conference."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/321386.321388"},{"key":"e_1_2_1_21_1","volume-title":"Queueing Systems","author":"Kleinrock L.","unstructured":"L. Kleinrock . 1976. Queueing Systems , Vol. 2 . John Wiley & Sons . L. Kleinrock. 1976. Queueing Systems, Vol. 2. John Wiley & Sons."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.44.4.653"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.36.3.454"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1080\/15326348808807079"},{"key":"e_1_2_1_25_1","first-page":"26","article-title":"Open queueing systems in light traffic","volume":"14","author":"Reiman M. I.","year":"1989","unstructured":"M. I. Reiman and B. Simon . 1989 . Open queueing systems in light traffic . Operations Research 14 , 1, 26 -- 59 . M. I. Reiman and B. Simon. 1989. Open queueing systems in light traffic. Operations Research 14, 1, 26--59.","journal-title":"Operations Research"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2004.03.010"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the IEEE INFOCOM Conference.","author":"van Kessel G.","unstructured":"G. van Kessel , R. N\u00fa\u00f1ez-Queija , and S. C. Borst . 2005. Differentiated bandwidth sharing with disparate flow sizes . In Proceedings of the IEEE INFOCOM Conference. G. van Kessel, R. N\u00fa\u00f1ez-Queija, and S. C. Borst. 2005. Differentiated bandwidth sharing with disparate flow sizes. In Proceedings of the IEEE INFOCOM Conference."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1110.0914"},{"key":"e_1_2_1_29_1","volume-title":"An Introduction to Queueing Networks","author":"Walrand J.","unstructured":"J. Walrand . 1988. An Introduction to Queueing Networks . Prentice Hall , Englewood Cliffs, NJ . J. Walrand. 1988. An Introduction to Queueing Networks. Prentice Hall, Englewood Cliffs, NJ."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2012.121212"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01182931"}],"container-title":["ACM Transactions on Modeling and Performance Evaluation of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2812807","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2812807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:32Z","timestamp":1750223252000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2812807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,22]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,3,31]]}},"alternative-id":["10.1145\/2812807"],"URL":"https:\/\/doi.org\/10.1145\/2812807","relation":{},"ISSN":["2376-3639","2376-3647"],"issn-type":[{"value":"2376-3639","type":"print"},{"value":"2376-3647","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,22]]}}}