Skip to main content
Log in

Scheduling real-time and non-real-time traffic under nonstationary conditions

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this paper a statistical multiplexer that processes a mixture of real-time and non-real-time traffic is studied under bursts of traffic. Different scheduling algorithms are compared under conditions when one of the classes of traffic has a sudden increase in its arrival rate during a short period of time. The results show a difference in the way the scheduling disciplines studied behave under short overloads of traffic even though the scheduling algorithms had been set up to give similar performance under steady-state arrivals. The lifetime of real-time packets is shown to have a great effect on the way in which the performance of the scheduling algorithms compare.

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. S. Li, Overload control in a finite message storage buffer,Proc. 1988 IEEE INFOCOM, New Orleans (March 1988).

  2. S.J. Golestani, Congestion free transmission of real-time traffic in packet networks,Proc. 1990 IEEE INFOCOM, San Francisco (June 1990).

  3. R. Chipalkatti, J.F. Kurose and D. Towsley, Scheduling policies for real-time and non-real-time traffic in a statistical multiplexer,Proc. 1989 IEEE INFOCOM, Ottawa, Canada (April 1989).

  4. J.L. Hammond and J.D. Spragins, Rapidly reconfiguring computer communication networks, definition and major issues,Proc. 1987 IEEE INFOCOM, San Francisco, CA (1987).

  5. W. Lovegrove, J. Hammond and D. Tipper, Simulation methods for studying nonstationary behavior of computer networks, IEEE J. Sel. Areas Commun. (December 1990).

  6. D. Tipper and M.K. Sundareshan, Numerical methods for modeling computer networks under nonstationary conditions, IEEE J. Sel. Areas Commun. (December 1990).

  7. A. Weiss and D. Mitra, A transient analysis of a data network with a processor sharing switch, AT&T Tech. J. (September/October 1988).

  8. H. Ohnishi, T. Okada and K. Noguchi, Flow control schemes and delay loss tradeoff in ATM networks, IEEE J. Sel. Areas Commun. (December 1988).

  9. J.F. Kurose, An exact analysis of customer loss under minimum laxity scheduling in discrete-time queueing systems, submitted to Perf. Eval.

  10. Law and Kelton,Simulation Modeling and Analysis (McGraw-Hill, 1982).

  11. P. Welch, The statistical analysis of simulation results, in:Computer Performance Modeling Handbook, ed. S. Lavenberg (Academic Press, 1983) pp. 286–287.

  12. A.B. Pritsker and C.D. Pegden,Introduction to Simulation and Slam (Systems Publ., 1979).

  13. Gross and Harris,Fundamentals of Queueing Theory, 2nd ed. (Wiley, 1985) pp. 34–42.

  14. R.B. Cooper,Introduction to Queueing Theory, 2nd ed. (North-Holland, 1981) pp. 36–37.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Robert Lackman is an IBM employee in the IBM Resident Study Program.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lackman, R.A., Spragins, J.D. & Tipper, D. Scheduling real-time and non-real-time traffic under nonstationary conditions. Ann Oper Res 36, 193–224 (1992). https://doi.org/10.1007/BF02094330

Download citation

  • Issue Date:

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

Keywords

Navigation