Skip to main content

Comparisons of Service Disciplines in a Queueing System with Delay Dependent Customer Behaviour

  • Chapter
Applied Probability— Computer Science: The Interface

Part of the book series: Progress in Computer Science ((PCS,volume 3))

Abstract

In a variety of data processing and call processing systems the customer, unknown to the system, turns ‘bad’ at a random time after its arrival. That is, serving a customer with waiting time in excess of this random time results in a ‘bad’ (unsuccessful) service. If the performance of such systems is measured by the rate at which it serves good customers (‘goodput’), then this performance is determined by the delay distribution and the distribution of the time at which the customer turns bad. Given the offered load, the service demand of the customers and the customer behavior, the performance is determined by the service discipline. It is then of interest to identify the best discipline and compare its performance with that of other disciplines. These problems are studied here for an M/G/1 queue. Optimal disciplines are derived for two special cases of the customer behavior. For a more complex customer behavior, the ‘goodputs’ under three different disciplines are numerically compared and a desired discipline is identified.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brill, P. H. and Posner, M. J. M. (1977), “Level Crossings in Point Processes Applied to Queues: Single Server Case,” Oper. Res., 25, 662–674.

    Article  Google Scholar 

  2. Cooper, R. B. (1972), Introduction to Queueing Theory, MacMillan, New York.

    Google Scholar 

  3. Forys, L., Fredericks, A. A. and Kersten, P., “Improving the Overload Performance of Local Switching System,” to be submitted to Bell System Tech. J.

    Google Scholar 

  4. Forys, L., Fredericks, A. A., Hejny, G. and Borchering, J., “Coping with Overloads,” Bell Labs Record, July–August, 1981.

    Google Scholar 

  5. Ross, S. (1970), “Average Cost semi-Markov Decision Processes,” J. Appl. Probab., 7, 649–656.

    Article  Google Scholar 

  6. Vasićek, O. A. (1977), “An Inequality for the Variance of Waiting Time Under a General Queueing Discipline,” Oper. Res., 25, 879–884.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer Science+Business Media New York

About this chapter

Cite this chapter

Doshi, B.T., Lipper, E.H. (1982). Comparisons of Service Disciplines in a Queueing System with Delay Dependent Customer Behaviour. In: Disney, R.L., Ott, T.J. (eds) Applied Probability— Computer Science: The Interface. Progress in Computer Science, vol 3. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-5798-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-5798-1_13

  • Publisher Name: Birkhäuser, Boston, MA

  • Print ISBN: 978-0-8176-3093-5

  • Online ISBN: 978-1-4612-5798-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics