Skip to main content
Log in

The multiple phase service network with generalized processor sharing

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

An analysis is given of multiple phase service facilities of which queueing networks are special models, for the case of a service discipline to be denoted as generalized processor sharing. Under this discipline requests are served simultaneously with a rate depending on the phase and the number of requests present here. The model is of a very general type, its analysis is given for arbitrary routing matrices and absolutely continuous required service time distributions. The mathematical technique used is that of the supplementary variable. Generalisations of known results for closed and open networks are obtained and new results about the average sojourn time of a request in the system are derived, in particular for requests with given route and given processing times at the nodes of the route. Some basic results about reversed processes and departure processes are discussed. For a special but important model the workload is discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Disney, R.L.: Random flow in queueing networks, a review and critique. AIIE Transact. 7, 268–288 (1975)

    Google Scholar 

  2. Gelenbe, E., Muntz, R.R.: Probabilistic models of computer systems, I. Acta Informatica 7, 35–60 (1976)

    Google Scholar 

  3. Kleinrock, L.: Queueing Systems, I, II. New York: Wiley 1975, 1976

    Google Scholar 

  4. Palm, C.: Analysis of the Erlang traffic formula for busy signal arrangements. Ericsson Technics 6, 39–58 (1938)

    Google Scholar 

  5. Kosten, L.: On the validity of the Erlang-Engset loss formulae. Het P.T.T. Bedrijf 2, 42–45 (1948)

    Google Scholar 

  6. Cohen, J.W.: The generalized Engset formulae. Philips Telecommunication Review 18, 158–170 (1957)

    Google Scholar 

  7. Fortet, R., Grandjean, Ch.: Blockierungen in einem Verlustsystem bei denen einige Belegungen mehrere Schaltglieder gleichzeitig beanspruchen, Elektrisches Nachrichtenwesen 39, 566–579 (1964) see also: Study of the congestion in a loss system, Proc. 4th International Teletraffic Congress, London, 1964

    Google Scholar 

  8. Syski, R.: Introduction to Congestion Theory in Telephone Systems. London: Oliver & Boyd 1962

    Google Scholar 

  9. König, D.: Verallgemeinerungen der Formeln von Engset und Cohen, Thesis Humboldt Univ., Berlin, 1964

    Google Scholar 

  10. König, D., Matthes, K., Nawrotzki, K.: Verallgemeinerungen der Erlangschen und Engsetschen Formeln. Berlin: Akademie Verlag 1967

    Google Scholar 

  11. König, D., Jansen, U.: Eine Invarianzeigenschaft zufälliger Bedienungsprozesse mit positiven Geschwindigkeiten. Math. Nachrichten 70, 321–364 (1975)

    Google Scholar 

  12. Schassberger, R.: Insensitivity of steady-state distributions of generalized semi-Markov processes, part 1. Ann. Prob. 5, 87–99 (1977)

    Google Scholar 

  13. Kelly, F.P.: Networks of queues. Adv. Appl. Prob. 8, 416–432 (1976)

    Google Scholar 

  14. Barbour, A.D.: Networks of queues and the method of stages. Adv. Appl. Prob. l8, 584–591 (1976)

    Google Scholar 

  15. Chandy, K.M., Howard, H.J., Towsley, D.F.: Product form and local balance in queueing networks. Journ. A.C.M. 24, 250–263 (1977)

    Google Scholar 

  16. Cohen, J.W.: On Regenerative Processes in Queueing Theory. Lect. Notes in Econ. and Math. Systems, 121, Berlin-Heidelberg-New York: Springer 1976

    Google Scholar 

  17. Khinchine, A.Y.: Mathematical Methods in the Theory of Queueing. London: Griffin 1960

    Google Scholar 

  18. Hordijk, A., Schassberger, R.: Weak convergence for generalized semi-Markov processes, Sept. '75, report Math. Inst. Univ. of Leiden, in press 1979

  19. Nozaki, S.A., Ross, S.M.: Approximations in finite-capacity multiserver queues with poisson arrivals. J. Appl. Prob. 15, 826–834 (1978)

    CAS  PubMed  Google Scholar 

  20. Oakes, D.: Random overlapping intervals, a generalisation of Erlang's loss formula. Ann. Prob. 4, 940–946 (1976)

    Google Scholar 

  21. Baskett, F., Chandy, K.M., Muntz, R.R., Palacios, F.G.: Open, closed and mixed networks of queues with different classes of customers. Journ. A.C.M. 22, 248–260 (1975)

    Google Scholar 

  22. Shanbhag, D.N., Tambouratzis, D.G.: Erlang's loss formula and some results on the departure process for a loss system. J. Appl. Prob. 10, 233–240 (1973)

    Google Scholar 

  23. Stoyan, D.: Approximations for M/G/s queues. Math. Operationsforschung und Statistik 7, 587- 594 (1976)

    Google Scholar 

  24. Cohen, J.W.: On networks with generalized processor sharing (and a new property of the Erlang B-formula). To be presented at Ninth International Teletraffic Congress, Torremolinos, Spain, 1979

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cohen, J.W. The multiple phase service network with generalized processor sharing. Acta Informatica 12, 245–284 (1979). https://doi.org/10.1007/BF00264581

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00264581

Key words

Navigation