Skip to main content
SpringerLink
Log in

Queues with Message Discard at Non-zero Cost

  • Conference paper
Managing Traffic Performance in Converged Networks (ITC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4516))

Included in the following conference series:

Abstract

Some systems discard messages that wait in the queue longer than a certain threshold. Identifying such messages and discarding them takes the processor a fixed amount of time. That time is considerably smaller than an average service time, but greater than zero, therefore the models for queuing systems with reneging do not apply. This paper provides a model for such queues. It describes a method of deriving exact formulas for the distribution of waiting times, and proposes simple, yet accurate approximations. The paper then analyzes the model and discusses the properties of such systems.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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.

Similar content being viewed by others

References

  1. Doshi, B.T., Heffes, H.: Overload Performance of Several Processor Queueing Disciplines for the M/M/1 Queue. IEEE Transactions on Communications com-34(6), 538–546 (1986)

    Article  Google Scholar 

  2. Movaghar, A.: On queueing with customer impatience until the beginning of service. In: Proc. of IEEE Int. Comp. Perf. And Depenability Symposium, pp. 150–157. IEEE Computer Society Press, Los Alamitos (1996)

    Chapter  Google Scholar 

  3. Posner, M.J.: Single-server Queues with Service Time Dependent on Waiting Time. Operations Research 21, 610–616 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  4. Leung, K.K.: Load-Dependent Service Queues With Applications to Congestion Control in Broadband Networks. In: Proc. of IEEE Globecom’97, pp. 1674–1679 (1997)

    Google Scholar 

  5. Brill, P.H., Posner, M.J.: Level Crossings in Point Processes Applied to Queues: Single-Server Case. Operations Research 25, 662–674 (1977)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Nortel, 3500 Carling Avenue, Ottawa, ON, K2H 8E9, Canada

    Tadeusz Drwiega

Authors
  1. Tadeusz Drwiega
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lorne Mason Tadeusz Drwiega James Yan

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Drwiega, T. (2007). Queues with Message Discard at Non-zero Cost. In: Mason, L., Drwiega, T., Yan, J. (eds) Managing Traffic Performance in Converged Networks. ITC 2007. Lecture Notes in Computer Science, vol 4516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72990-7_65

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72990-7_65

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72989-1

  • Online ISBN: 978-3-540-72990-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation