Skip to main content
Log in

Interoutput times in processor sharing queues with feedback

  • Short Communications
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

While properties of the flows in isolated processor sharing queues are well understood, little is known about the flows in networks with processor sharing nodes. This paper analyzes the internal traffic processes in processor sharing queues with instantaneous Bernoulli feedback. The internal traffic does not inherit the insensitivity to the shape of the service requirement distribution from the external traffic. The interoutput time distribution is studied in the single server and infinite server processor sharing queues. For the systems we study, we show that when service requirement distributions with the same means are convexly ordered, so are interoutput time distributions.

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.

References

  1. F. Baskett and F. Palacios, Processor sharing in a central server queueing model of multiprogramming with applications, in: Proceedings of the Sixth Annual Princeton Conference on Information Sciences and Systems (Princeton University, Princeton, New Jersey, 1972) p. 598–603.

    Google Scholar 

  2. E. Cinlar, Superposition of point processes, in: Stochastic Point Processes: Statistical Analysis, Theory, and Applications, ed. P.A.W. Lewis (Wiley, New York, 1972).

    Google Scholar 

  3. E. Cinlar, Introduction to Stochastic Processes (Prentice Hall, Englewood Cliffs, New Jersey, 1975).

    Google Scholar 

  4. T. Kamae, U. Krengel and G.L. O'Brien, Stochastic inequalities on partially ordered spaces, Ann. Prob. 5 (1977) 899–912.

    Google Scholar 

  5. P.P. Kelly, Reversibility and Stochastic Networks (Wiley, New York, 1979).

    Google Scholar 

  6. L. Kleinrock, Queueing Systems, Vol. 2 (Wiley Interscience, New York, 1976).

    Google Scholar 

  7. P. Franken, D. König, U. Arndt and V. Schmidt, Queues and Point Processes (Akademie-Verlag, Berlin, 1981).

    Google Scholar 

  8. R.R. Muntz, Poisson departure processes and queueing networks, in: Proceedings of the Seventh Annual Princeton Conference on Information Sciences and Systems (Princeton University, Princeton, New Jersey, 1981) p. 435–440.

    Google Scholar 

  9. S.M. Ross, Stochastic Processes (Wiley, New York, 1983).

    Google Scholar 

  10. D. Stoyan, Comparison Methods for Queues and Other Stochastic Models (Wiley, New York, 1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was partially supported by the National Science Foundation under Grant ECS-8501217 and by the Graduate School of the University of Massachusetts under Faculty Research Grant 1-03205.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Klutke, GA., Kiessler, P.C. & Disney, R.L. Interoutput times in processor sharing queues with feedback. Queueing Syst 3, 363–376 (1988). https://doi.org/10.1007/BF01157856

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation