Skip to main content

Smoothing the Input Process in a Batch Queue

  • Conference paper
  • First Online:
Information Sciences and Systems 2015

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 363))

  • 654 Accesses

Abstract

We state some stochastic comparison results for the loss probabilities and the time to live in a tandem network with two queues. We consider such a network under batch arrivals and constant service time. We show that making the service capacity of the first queue finite will improve the performance. More precisely, we derive stochastic bounds for the accumulated number of losses without any assumptions on the input traffic.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and 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
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Aït-Salaht, F., Castel-Taleb, H., Fourneau, J., Pekergin, N.: Stochastic bounds and histograms for network performance analysis. In: Computer Performance Engineering—10th European Workshop, EPEW Italy, volume 8168 of Lecture Notes in Computer Science, pp. 13–27. Springer, New York (2013)

    Google Scholar 

  2. Chang, C.-S.: Smoothing point processes as a means to increase throughput. Oper. Res. 43(1), 117–129 (1995)

    Article  Google Scholar 

  3. Dupuis, A., Hébuterne, G.: Dimensioning the continuous state leaky bucket for geometric arrivals. In: Data Communications and their Performance, Proceedings of the Sixth IFIP WG6.3 Conference on Performance of Computer Networks, Istanbul, Turkey, (1995), volume 36 of IFIP Conference Proceedings, pp. 289–301. Chapman and Hall (1995)

    Google Scholar 

  4. Fourneau, J.-M., Le Coz, M., Pekergin, N., Quessette, F.: An open tool to compute stochastic bounds on steady-state distributions and rewards. In: 11th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS: Orlando. IEEE Computer Society, FL (2003)

    Google Scholar 

  5. Friedman, H.D.: Reduction methods for tandem queuing systems. Oper. Res. 13(1), 121–131 (1965)

    Article  MATH  Google Scholar 

  6. Hernández-Orallo, E., Vila-Carbó, J.: Network queue and loss analysis using histogram-based traffic models. Comput. Commun. 33(2), 190–201 (2010)

    Article  Google Scholar 

  7. Muller, A., Stoyan, D.: Comparison Methods for Stochastic Models and Risks. Wiley, New York (2002)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to J. M. Fourneau .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Salaht, F.A., Taleb, H.C., Fourneau, J.M., Mautor, T., Pekergin, N. (2016). Smoothing the Input Process in a Batch Queue. In: Abdelrahman, O., Gelenbe, E., Gorbil, G., Lent, R. (eds) Information Sciences and Systems 2015. Lecture Notes in Electrical Engineering, vol 363. Springer, Cham. https://doi.org/10.1007/978-3-319-22635-4_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22635-4_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22634-7

  • Online ISBN: 978-3-319-22635-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics