Skip to main content

Advertisement

Log in

A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

As network speeds increase and the data traffic becomes more diverse, the need arises for service disciplines that offer fair treatment to diverse applications, while efficiently using resources at high speeds. Disciplines that approximate round-robin or processor-sharing service per channel are well suited for data networks because, over a wide range of time scales, they allocate bandwidth fairly among channels without needing to distinguish between different types of applications. This study is among the few to address head-of-line processor sharing. In most previous models of processor-sharing disciplines, the system immediately serves any arriving message at a rate depending only on the number of messages in the system regardless of how these messages are distributed among the channels. This model is commonly called pure processor sharing. In our model, the server completes the work from a given channel at a rate depending on the number of other channels with work in the system. That is, the service rate depends on how messages are distributed among the channels, and only indirectly on the total number of messages in the system. In this paper, we contrast the buffer requirements of shared and non-shared buffer schemes, when both types of schemes provide head-of-the-line processor-sharing service among channels. We formulate the problem as a system of functions representing the cumulative input and cumulative lost (potential) output to parts of the queueing system and model the vector of input functions as a multi-dimensional Brownian motion. The resulting heavy-traffic approximations predict much larger benefits from sharing buffers than those predicted by pure processor sharing.

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

Access this article

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Similar content being viewed by others

References

  1. S. Brumelle, A generalization of Erlang's loss system to state dependent arrival and service rates, Math. Oper. Res. 3 (1977) 10–16.

    Google Scholar 

  2. J. Cohen, The multiple phase service network with generalized processor sharing, Acta Informatica 12 (1979) 245–284.

    Google Scholar 

  3. M. Cottrell, J.-C. Fort and G. Malgouyres, Large deviations and rare events in the study of stochastic algorithms, IEEE Trans. Aut. Contr. AC-28 (1983) 907–920.

    Google Scholar 

  4. J.G. Dai and J.M. Harrison, Reflected Brownian motion in an orthant: numerical methods for steady-state analysis, to appear in Ann. Appl. Prob.

  5. J.G. Dai and J.M. Harrison, Steady-state analysis of RBM in a rectangle: numerical methods and queueing applications, to appear in Ann. Appl. Prob.

  6. J.G. Dai and T.G. Kurtz, The sufficiency of the basic adjoint relationship, preprint.

  7. J.G. Dai, L.M. Taylor and R.J. Williams, Semimartingale reflected Brownian motion in a polyhedral domain, preprint.

  8. A. Demers, S. Keshav and S. Shenker, Analysis and simulation of a fair queueing algorithm,Proc. ACM SIGCOMM (1989).

  9. G. Fayolle, I. Mitrani and R. Iasnogorodski, Sharing a processor among many job classes, JACM 27 (1980) 519–532.

    Google Scholar 

  10. K. Fendick, V.R. Saksena and W. Whitt, Dependence in packet queues, IEEE Trans. Comm. COM-37 (1989) 1173–1185.

    Google Scholar 

  11. K.W. Fendick and W. Whitt, Measurements and approximations to describe the offered traffic and predict the average workload in a single-server queue,Proc. IEEE 77 (1989) pp. 171–94. Also in:Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (North-Holland,1990).

    Google Scholar 

  12. K.W. Fendick, V.R. Saksena and W. Whitt, Approximating the mean workload in packet queues with the index of dispersion for work, to appear in IEEE Trans. Comm.

  13. M.J. Fischer, Analysis and design of loop service systems via a diffusion approximation, Oper. Res. 25 (1977).

  14. P.F. Fleming, An approximate analysis of sojourn times in theM/G/1 queue with roundrobin service discipline, AT&T Bell Labs. Tech. J. 63 (1984) 1521–1535.

    Google Scholar 

  15. A.G. Fraser and S.P. Morgan, Queueing and framing disciplines for a mixture of data traffic types, AT&T Bell Labs. Tech. J. 63 (1984) 1061–1087.

    Google Scholar 

  16. A.G. Greenberg and N. Madras, Comparison of a fair queueing discipline to processor sharing,Proc. PERFORMANCE'90 (North-Holland) pp. 193–207.

  17. A.G. Greenberg and W. Whitt, Fixed-point approximations for systems with many queues served by the head-of-the-line processor-sharing discipline, preprint.

  18. S. Halfin and W. Whitt, An extremal property of the FIFO discipline via an ordinal version ofL=λW, Comm. Statist.-Stochastic Models 5 (1989) 515–529.

    Google Scholar 

  19. J.M. Harrison and M.I. Reiman, On the distribution of multidimensional reflected Brownian motion, SIAM J. Appl. Math. 41 (October 1981).

  20. J.M. Harrison and M.I. Reiman, Reflected Brownian motion on an orthant, Ann. Prob. 9 (1981) 302–308.

    Google Scholar 

  21. J.M. Harrison,Brownian Motion and Stochastic Flow Systems (Wiley, New York, 1985).

    Google Scholar 

  22. J.M. Harrison and R.J. Williams, Brownian models of open queueing networks with homogeneous customer population, Stochastics 22 (1987) 77–115.

    Google Scholar 

  23. J.M. Harrison and Vien Nguyen, The QNET method for two-moment analysis of open queueing networks, Queueing Systems 6 (1990) 1–32.

    Google Scholar 

  24. D.L. Iglehart and W. Whitt, Multichannel queues in heavy traffic, I and II, Adv. Appl. Prob. 2 (1970) 150–177 and 355–369.

    Google Scholar 

  25. F.P. Kelly,Reversibility and Stochastic Networks (Wiley, 1979).

  26. G. Kimura and Y. Takahashi, Diffusion approximation for a token ring system with nonexhaustive service, IEEE J. Sel. Areas Comm. SAC-4 (Sept. 1986).

  27. J.F. Kingman, Queue disciplines in heavy traffic, Math. Oper. Res. 7 (1982) 262–271.

    Google Scholar 

  28. L. Kleinrock, R.R. Muntz and E. Rodemich, The processor-sharing queueing model for time-shared systems with bulk arrivals, Networks 1 (1971) 1–13.

    Google Scholar 

  29. L. Kleinrock,Queueing Systems, vol. 2 (Wiley, 1976).

  30. C. Knessl, On the diffusion approximation to two parallel queues with processor sharing, Applied Mathematics Research Paper, Number AM 88-01, University of Illinois at Chicago (June 1988).

  31. A.G. Konheim, I. Meilijson and A. Melkman, Processor-sharing of two parallel lines, J. Appl. Prob. 18 (1981) 952–956.

    Google Scholar 

  32. P. Kuehn, Multiqueue systems with nonexhaustive cyclic service, B.S.T.J., 58 (1979) 671–698.

    Google Scholar 

  33. D. Mitra, Optimal design of windows for high speed data networks,Proc. IEEE INFOCOM'90 (IEEE Computer Society Press, 1990) pp. 1156–1163.

  34. D. Mitra and I. Mitrani, Asymptotic optimality of the go-back-n protocol in high speed data networks with small buffers,Proc. 4th Int. Conf. on Data Communications Systems and Their Performance, IFIP, Barcelona (1990) pp. 17–31.

    Google Scholar 

  35. D. Mitra and K.G. Ramakrishnan, A numerical investigation into the optimal design of congestion controls for high speed data networks,Proc. 10th Int. Conf. on Computer Communication (ICCC 90) (1990) pp. 362–369.

  36. D. Mitra and J.B. Seery, Dynamic adaptive windows for high speed data networks: theory and simulations,Proc. ACM SIGCOMM (1990) pp. 30–40.

  37. J.A. Morrison, Head of the line processor sharing for two symmetric queues, preprint.

  38. J.A. Morrison and D. Mitra, Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes, Adv. Appl. Prob. 17 (1985) 163–185.

    Google Scholar 

  39. T. Ott, The sojourn-time distribution in theM/G/1 queue with processor sharing, J. Appl. Prob. 21 (1984) 360–378.

    Google Scholar 

  40. M.I. Reiman, Open queueing networks in heavy traffic, Math. Oper. Res. 9 (1984) 441–458.

    Google Scholar 

  41. M.I. Reiman, A multiclass feedback queue in heavy traffic, Adv. Appl. Prob. 20 (1988) 179–207.

    Google Scholar 

  42. K. Sriram and W. Whitt, Characterizing superposition arrival processes in packet multiplexers for voice and data, IEEE J. Sel. Areas Comm. SAC-4 (1986) 833–846.

    Google Scholar 

  43. H. Takagi, Mean message waiting times in symmetric multi-queue systems with cyclic service, Perf. Eval. 5 (1985) 271–277.

    Google Scholar 

  44. H. Takagi, Queueing analysis of polling models: an update, in:Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (Elsevier Science/North-Holland, 1990).

    Google Scholar 

  45. S.R.S. Varadhan and R.J. Williams, Brownian motion in a wedge with oblique reflection, Comm. Pure Appl. Math. 38 (1985) 405–443.

    Google Scholar 

  46. A. Weiss, A new technique for analyzing large traffic systems, Adv. Appl. Prob. 18 (1986) 506–532.

    Google Scholar 

  47. W. Whitt, Heavy traffic limit theorems for queues: a survey, in:Mathematical Methods in Queueing Theory, Lecture Notes in Economic and Mathematical Systems no. 98 (Springer, New York, 1974).

    Google Scholar 

  48. W. Whitt, Approximations for departure processes and queues in series, Naval Res. Log. Quart. 31 (1984) 499–521.

    Google Scholar 

  49. W. Whitt, Heavy-traffic approximations for service systems with blocking, AT&T Bell Labs. Techn. J. 63 (May–June, 1984).

  50. R.J. Williams, Reflected Brownian motion in a wedge: semimartingale property, Z. Wahrscheinlichkeitstheorie verw. Gebiete 69 (1985) 161–176.

    Google Scholar 

  51. R.W. Wolff, Time sharing with priorities, SIAM J. Appl. Math. 19 (1970) 566–574.

    Google Scholar 

  52. S. Yashkov, Processor-sharing queues: some progress in analysis, Queueing Systems 2 (1987) 1–17.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fendick, K.W., Rodrigues, M.A. A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline. Queueing Syst 9, 163–190 (1991). https://doi.org/10.1007/BF01158796

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation