{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:14:06Z","timestamp":1773656046220,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2008,8,1]],"date-time":"2008-08-01T00:00:00Z","timestamp":1217548800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s11134-008-9086-5","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T17:08:07Z","timestamp":1221239287000},"page":"297-319","source":"Crossref","is-referenced-by-count":7,"title":["Waiting times for M\/M systems under state-dependent processor sharing"],"prefix":"10.1007","volume":"59","author":[{"given":"Andreas","family":"Brandt","sequence":"first","affiliation":[]},{"given":"Manfred","family":"Brandt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,9,13]]},"reference":[{"key":"9086_CR1","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02100270","volume":"4","author":"B. Avi-Itzhak","year":"1989","unstructured":"Avi-Itzhak, B., Halfin, S.: Response times in gated M\/G\/1 queues: The processor-sharing case. Queueing Syst. 4, 263\u2013279 (1989)","journal-title":"Queueing Syst."},{"key":"9086_CR2","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s11134-005-1666-z","volume":"50","author":"K. Avrachenkov","year":"2005","unstructured":"Avrachenkov, K., Ayesta, U., Brown, P.: Batch arrival processor-sharing with application to multi-level processor-sharing scheduling. Queueing Syst. 50, 459\u2013480 (2005)","journal-title":"Queueing Syst."},{"key":"9086_CR3","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0166-5316(02)00110-4","volume":"49","author":"T. Bonald","year":"2002","unstructured":"Bonald, T., Prouti\u00e8re, A.: Insensitivity in processor-sharing networks. Perform. Eval. 49, 193\u2013209 (2002)","journal-title":"Perform. Eval."},{"key":"9086_CR4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1023237129453","volume":"43","author":"S. Borst","year":"2003","unstructured":"Borst, S., Boxma, O., Jelenkovic, P.: Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows. Queueing Syst. 43, 273\u2013306 (2003a)","journal-title":"Queueing Syst."},{"key":"9086_CR5","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1239\/aap\/1059486830","volume":"35","author":"S. Borst","year":"2003","unstructured":"Borst, S., Mandjes, M., van Uitert, M.: Generalized processor sharing queues with heterogeneous traffic classes. Adv. Appl. Probab. 35, 806\u2013845 (2003b)","journal-title":"Adv. Appl. Probab."},{"key":"9086_CR6","unstructured":"Braband, J.: Wartezeitverteilungen f\u00fcr M\/M\/N-Processor-Sharing-Modelle. Ph.D. Thesis, Technical University at Brunswick (1992)"},{"key":"9086_CR7","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1080\/15326349408807309","volume":"10","author":"J. Braband","year":"1994","unstructured":"Braband, J.: Waiting time distributions for M\/M\/N processor sharing queues. Commun. Stat. Stoch. Models 10, 533\u2013548 (1994)","journal-title":"Commun. Stat. Stoch. Models"},{"key":"9086_CR8","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01194397","volume":"47","author":"A. Brandt","year":"1998","unstructured":"Brandt, A., Brandt, M.: On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers. Math. Methods Oper. Res. 47, 181\u2013220 (1998)","journal-title":"Math. Methods Oper. Res."},{"key":"9086_CR9","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1023\/A:1019155524681","volume":"32","author":"A. Brandt","year":"1999","unstructured":"Brandt, A., Brandt, M.: A note on the stability of the many-queue head-of-the-line processor-sharing system with permanent customers. Queueing Syst. 32, 363\u2013381 (1999)","journal-title":"Queueing Syst."},{"key":"9086_CR10","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s11134-006-6264-1","volume":"52","author":"A. Brandt","year":"2006","unstructured":"Brandt, A., Brandt, M.: A sample path relation for the sojourn times in G\/G\/1\u2212PS systems and its applications. Queueing Syst. 52, 281\u2013286 (2006)","journal-title":"Queueing Syst."},{"key":"9086_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11134-007-9022-0","volume":"56","author":"A. Brandt","year":"2007","unstructured":"Brandt, A., Brandt, M.: On the stability of the multi-queue multi-server processor sharing with limited service. Queueing Syst. 56, 1\u20138 (2007)","journal-title":"Queueing Syst."},{"key":"9086_CR12","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s11134-006-7583-y","volume":"53","author":"S.-K. Cheung","year":"2006","unstructured":"Cheung, S.-K., van den Berg, H., Boucherie, R.J.: Insensitive bounds for the moments of the sojourn time distribution in the M\/G\/1 processor-sharing queue. Queueing Syst. 53, 7\u201318 (2006)","journal-title":"Queueing Syst."},{"key":"9086_CR13","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/321556.321568","volume":"17","author":"E.G. Coffman","year":"1970","unstructured":"Coffman, E.G., Muntz, R.R., Trotter, H.: Waiting time distributions for processor-sharing systems. J.\u00a0Assoc. Comput. Mach. 17, 123\u2013130 (1970)","journal-title":"J.\u00a0Assoc. Comput. Mach."},{"key":"9086_CR14","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF00264581","volume":"12","author":"J.W. Cohen","year":"1979","unstructured":"Cohen, J.W.: The multiple phase service network with generalized processor sharing. Acta Inf. 12, 245\u2013284 (1979)","journal-title":"Acta Inf."},{"key":"9086_CR15","doi-asserted-by":"crossref","unstructured":"Elwalid, A., Mitra, D.: Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes. INFOCOM\u201999. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE 3, pp.\u00a01220\u20131230 (1999)","DOI":"10.1109\/INFCOM.1999.751679"},{"key":"9086_CR16","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1239\/aap\/1086957584","volume":"36","author":"F. Guillemin","year":"2004","unstructured":"Guillemin, F., Robert, P., Zwart, B.: Tail asymptotics for processor-sharing queues. Adv. Appl. Probab. 36, 525\u2013543 (2004)","journal-title":"Adv. Appl. Probab."},{"key":"9086_CR17","first-page":"211","volume":"4","author":"M.Y. Kitaev","year":"1978","unstructured":"Kitaev, M.Y., Yashkov, S.F.: Distribution of the conditional sojourn time of requests in shared-processor systems. Izv. Akad. Nauk SSSR Tekh. Kibernet. 4, 211\u2013215 (1978)","journal-title":"Izv. Akad. Nauk SSSR Tekh. Kibernet."},{"key":"9086_CR18","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1145\/321386.321388","volume":"14","author":"L. Kleinrock","year":"1967","unstructured":"Kleinrock, L.: Time-shared systems: A theoretical treatment. J.\u00a0Assoc. Comput. Mach. 14, 242\u2013261 (1967)","journal-title":"J.\u00a0Assoc. Comput. Mach."},{"key":"9086_CR19","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1023\/A:1019138827659","volume":"15","author":"L. Massouli\u00e9","year":"2000","unstructured":"Massouli\u00e9, L., Roberts, J.W.: Bandwidth sharing and admission control for elastic traffic. Telecommun. Syst. 15, 185\u2013201 (2000)","journal-title":"Telecommun. Syst."},{"key":"9086_CR20","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1137\/0145007","volume":"45","author":"J.A. Morrison","year":"1985","unstructured":"Morrison, J.A.: Response-time distribution for a processor-sharing system. SIAM J. Appl. Math. 45, 152\u2013167 (1985)","journal-title":"SIAM J. Appl. Math."},{"key":"9086_CR21","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01153535","volume":"14","author":"J.A. Morrison","year":"1993","unstructured":"Morrison, J.A.: Head of the line processor sharing for many symmetric queues with finite capacity. Queueing Syst. 14, 215\u2013237 (1993)","journal-title":"Queueing Syst."},{"key":"9086_CR22","unstructured":"N\u00fa\u00f1ez Queija, R.: Processor-sharing models for integrated-services networks. Ph.D. Thesis, Eindhoven University of Technology (2000)"},{"issue":"3","key":"9086_CR23","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/90.234856","volume":"1","author":"A.K. Parekh","year":"1993","unstructured":"Parekh, A.K., Gallager, R.G.: A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE\/ACM Trans. Netw. 1(3), 344\u2013357 (1993)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9086_CR24","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF02100269","volume":"4","author":"K.M. Rege","year":"1989","unstructured":"Rege, K.M., Sengupta, B.: A single server queue with gated processor-sharing discipline. Queueing Syst. 4, 249\u2013261 (1989)","journal-title":"Queueing Syst."},{"key":"9086_CR25","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1002\/j.1538-7305.1985.tb00440.x","volume":"64","author":"B. Sengupta","year":"1985","unstructured":"Sengupta, B., Jagerman, D.L.: A conditional response time of M\/M\/1 processor-sharing queue. AT&T Bell Lab. Techn. J. 64, 409\u2013421 (1985)","journal-title":"AT&T Bell Lab. Techn. J."},{"key":"9086_CR26","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s11134-005-0372-1","volume":"50","author":"B. Sericola","year":"2005","unstructured":"Sericola, B., Guillemin, F., Boyer, J.: Sojourn times in the M\/PH\/1 processor sharing queue. Queueing Syst. 50, 109\u2013130 (2005)","journal-title":"Queueing Syst."},{"key":"9086_CR27","doi-asserted-by":"crossref","unstructured":"Tolmachev, A.L.: Insensitivity in queueing networks with generalized processor-sharing discipline. Probability theory and applications, Proc. World Congr. Bernoulli Soc., Tashkent 1986, vol.\u00a01, pp.\u00a0283\u2013286 (1987)","DOI":"10.1515\/9783112314227-037"},{"key":"9086_CR28","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF01159223","volume":"9","author":"J.L. Berg van den","year":"1991","unstructured":"van den Berg, J.L., Boxma, O.J.: The M\/G\/1 queue with processor sharing and its relation to a feedback queue. Queueing Syst. 9, 365\u2013401 (1991)","journal-title":"Queueing Syst."},{"key":"9086_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01182931","volume":"2","author":"S.F. Yashkov","year":"1987","unstructured":"Yashkov, S.F.: Processor-sharing queues: Some progress in analysis. Queueing Syst. 2, 1\u201317 (1987)","journal-title":"Queueing Syst."},{"key":"9086_CR30","first-page":"3","volume":"29","author":"S.F. Yashkov","year":"1990","unstructured":"Yashkov, S.F.: Mathematical problems in the theory of shared-processor systems. Itogi Nauki Tekh., Ser. Teor. Veroyatn. Mat. Sta. Teor. Kibern. 29, 3\u201382 (1990)","journal-title":"Itogi Nauki Tekh., Ser. Teor. Veroyatn. Mat. Sta. Teor. Kibern."},{"key":"9086_CR31","first-page":"20","volume":"14","author":"S.F. Yashkov","year":"1980","unstructured":"Yashkov, S.F., Kitaev, M.Y.: One analytical model of shared-use systems. Autom. Control Comput. Sci. 14, 20\u201323 (1980) (translation from Avtom. Vychisl. Tekh. 1, 22\u201325 (1980))","journal-title":"Autom. Control Comput. Sci."},{"issue":"2","key":"9086_CR32","first-page":"128","volume":"3","author":"A.S. Yashkova","year":"2003","unstructured":"Yashkova, A.S., Yashkov, S.F.: Distribution of the virtual sojourn time in the M\/G\/1 processor sharing queue. Inf. Process. 3(2), 128\u2013137 (2003)","journal-title":"Inf. Process."},{"issue":"4","key":"9086_CR33","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/190809.190321","volume":"24","author":"Z.L. Zhang","year":"1994","unstructured":"Zhang, Z.L., Towsley, D., Kurose, J.: Statistical analysis of generalized processor sharing scheduling discipline. ACM SIGCOMM Comput. Commun. Rev. 24(4), 68\u201377 (1994)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-008-9086-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-008-9086-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-008-9086-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T11:01:05Z","timestamp":1631790065000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-008-9086-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":33,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["9086"],"URL":"https:\/\/doi.org\/10.1007\/s11134-008-9086-5","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}