Skip to main content

M/G/1 Queues with FCFS Negative Arrivals

  • Chapter
Quantitative Methods in Parallel Systems

Part of the book series: Esprit Basic Research Series ((ESPRIT BASIC))

  • 57 Accesses

Summary

The generating function of the equilibrium queue length probability distribution in a single server queue with general service times and independent Poisson arrival streams of both positive and negative customers is investigated. The queueing discipline first come first served is chosen for the positive customers together with a killing strategy in which the last customer in the queue is removed by a negative customer. This killing strategy leads to complex mathematical analysis and, ultimately, to a Fredholm integral equation of the first kind. This type of equation has no known reliable numerical solution method except in special cases. We derive an alternative, iterative method involving the numerical inversion of Laplace transforms.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. H. Dubner and J. Abate, “Numerical inversion of Laplace transforms by relating them to the finite Fourier Cosine transform”, JACM, 1510, pp. 115–123, 1968.

    Article  MathSciNet  MATH  Google Scholar 

  2. E. Gelenbe, P. Glynn and K. Sigman, “Queues with negative arrivals”, J. Appl. Prob., 28, pp. 245–250, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  3. E. Gelenbe, “Product form networks with negative and positive customers”, J. Appl. Prob., 28, pp. 656–663, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  4. E. Gelenbe and R. Schassberger., “Stability of product form G-networks”, Probability in the Engineering and Informational Sciences, 6, pp. 271–276, 1992.

    Article  MATH  Google Scholar 

  5. P.G. Harrison and E. Pitel, “Sojourn times in single server queues with negative customers”, Journal of Applied Probability, 30, pp. 943–963, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  6. P.G. Harrison and E. Pitel, “The M/G/1 queue with negative customers”, Accepted for publication in Advances in Applied Probability, 33, June 1996.

    Google Scholar 

  7. W. Henderson, “Queueing networks with negative customers and negative queue length”, Journal of Applied Probability, 30 3, 1993.

    Google Scholar 

  8. E. Pitel, “Queues with negative customers”, PhD Thesis, Dept. of Computing, Imperial College, London, 1994.

    Google Scholar 

  9. S. Wolfram, “Mathematica”, Addison-Wesley, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1995 ECSC-EC-EAEC, Brussels-Luxembourg

About this chapter

Cite this chapter

Harrison, P.G., Pitel, E. (1995). M/G/1 Queues with FCFS Negative Arrivals. In: Baccelli, F., Jean-Marie, A., Mitrani, I. (eds) Quantitative Methods in Parallel Systems. Esprit Basic Research Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79917-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-79917-4_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-79919-8

  • Online ISBN: 978-3-642-79917-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics