{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:14:17Z","timestamp":1773656057998,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"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":[[1994,9]]},"DOI":"10.1007\/bf01158767","type":"journal-article","created":{"date-parts":[[2005,2,16]],"date-time":"2005-02-16T21:12:50Z","timestamp":1108588370000},"page":"333-351","source":"Crossref","is-referenced-by-count":20,"title":["A decomposition theorem and related results for the discriminatory processor sharing queue"],"prefix":"10.1007","volume":"18","author":[{"given":"Kiran M.","family":"Rege","sequence":"first","affiliation":[]},{"given":"Bhaskar","family":"Sengupta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"910","DOI":"10.2307\/3213604","volume":"20","author":"B.K. Asare","year":"1983","unstructured":"B.K. Asare and F.G. Foster, Conditional response time in theM\/G\/1 processor-sharing system, J. Appl. Probl. 20 (1983) 910?915.","journal-title":"J. Appl. Probl."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/321556.321568","volume":"17","author":"E.G. Coffman","year":"1970","unstructured":"E.G. Coffman, R.R. Muntz and H. Trotter, Waiting time distributions for processor-sharing systems, J. ACM 17 (1970) 123?130.","journal-title":"J. ACM"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1145\/322203.322212","volume":"27","author":"G. Fayolle","year":"1980","unstructured":"G. Fayolle, I. Mitrani and R. Iasnogorodski, Sharing a processor among many job classes, J. ACM 27 (1980) 519?532.","journal-title":"J. ACM"},{"key":"CR4","volume-title":"Stochastic Models in Operations Research, Vol. 1","author":"D.P. Heyman","year":"1982","unstructured":"D.P. Heyman and M.J. Sobel,Stochastic Models in Operations Research, Vol. 1 (McGraw-Hill, New York, 1982)."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1145\/321386.321388","volume":"14","author":"L. Kleinrock","year":"1967","unstructured":"L. Kleinrock, Time-shared systems: A theoretical treatment, J. ACM 14 (1967) 242?261.","journal-title":"J. ACM"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/75372.75394","volume":"17","author":"D. Mitra","year":"1989","unstructured":"D. Mitra and A. Weiss, A closed network with a discriminatory processor-sharing server,1989 ACM Sigmetrics and Performance '89, Perf. Eval. Rev. 17 (1989) 200?208.","journal-title":"Perf. Eval. Rev."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF00276184","volume":"8","author":"I. Mitrani","year":"1977","unstructured":"I. Mitrani and J.H. Hine, Complete parameterised families of job scheduling strategies, Acta Inf. 8 (1977) 61?73.","journal-title":"Acta Inf."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01158797","volume":"9","author":"J.A. Morrison","year":"1991","unstructured":"J.A. Morrison, Asymptotic analysis of a large closed queueing network with discriminatory processor sharing, Queueing Syst. 9 (1991) 191?213.","journal-title":"Queueing Syst."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"1232","DOI":"10.1287\/opre.22.6.1232","volume":"22","author":"T.M. O'Donovan","year":"1974","unstructured":"T.M. O'Donovan, Direct solutions ofM\/G\/1 processor-sharing models, Oper. Res. 22 (1974) 1232?1235.","journal-title":"Oper. Res."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"360","DOI":"10.2307\/3213646","volume":"21","author":"T.J. Ott","year":"1984","unstructured":"T.J. Ott, The sojourn time distribution in theM\/G\/1 queue with processor sharing, J. Appl. Prob. 21 (1984) 360?378.","journal-title":"J. Appl. Prob."},{"key":"CR11","first-page":"417","volume-title":"Modelling and Performance Evaluation of ATM Technology","author":"K.M. Rege","year":"1993","unstructured":"K.M. Rege and B. Sengupta, TheM\/G\/1 processor-sharing queue with bulk arrivals, in:Modelling and Performance Evaluation of ATM Technology (North-Holland, Amsterdam, 1993) pp. 417?432."},{"key":"CR12","unstructured":"K.M. Rege and B. Sengupta, A decomposition theorem and related results for the discriminatory processor sharing queue, NEC USA Tech. Rep. No. 92-C018-4-5007-5, also AT&T Bell Laboratories Internal Publication (1992)."},{"key":"CR13","unstructured":"M. Sakata, S. Noguchi and J. Oizumi, Analysis of a processor shared queueing model for time sharing systems,Proc. 2nd Hawaii Int. Conf. on Systems Sciences (1969) pp. 625?627."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"202","DOI":"10.2307\/1427231","volume":"16","author":"R. Schassberger","year":"1984","unstructured":"R. Schassberger, A new approach to theM\/G\/1 processor-sharing queue, Adv. Appl. Prob. 16 (1984) 202?213.","journal-title":"Adv. Appl. Prob."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF01159223","volume":"9","author":"J.L. Berg Van den","year":"1991","unstructured":"J.L. Van den Berg and O.J. Boxma, TheM\/G\/1 queue with processor sharing and its relation to a feedback queue, Queueing Syst. 9 (1991) 365?402.","journal-title":"Queueing Syst."},{"key":"CR16","first-page":"133","volume":"12","author":"S.F. Yashkov","year":"1983","unstructured":"S.F. Yashkov, A derivation of response time distribution for anM\/G\/1 processor-sharing queue, Probl. Cont. Inf. Theory 12 (1983) 133?148.","journal-title":"Probl. Cont. Inf. Theory"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01182931","volume":"2","author":"S.F. Yashkov","year":"1987","unstructured":"S.F. Yashkov, Processor sharing queues: Some progress in analysis, Queueing Syst. 2 (1987) 1?17.","journal-title":"Queueing Syst."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01158767.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01158767\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01158767","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,23]],"date-time":"2024-01-23T14:18:35Z","timestamp":1706019515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01158767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":17,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["BF01158767"],"URL":"https:\/\/doi.org\/10.1007\/bf01158767","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}