Abstract
-
11.1 Introduction
-
11.2 On the Ross conjecture in discrete-time
-
11.3 A comparison lemma and its applications
-
11.3.1 Application 1: two i.i.d. MAP-sources perform better than 2 completely coupled Map-sources
-
11.3.2 Application 2: a fixed batch size is better than random batch sizes
-
11.3.3 Application 3: Fluid scaling improves the performance
-
-
11.4 A second comparison lemma
-
11.5 A stochastic lower bound on the traveling times
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Altman, E., Gaujal, B., Hordijk, A. (2003). Part IV: 11 Comparison of queues with discrete-time arrival processes. In: Discrete-Event Control of Stochastic Networks: Multimodularity and Regularity. Lecture Notes in Mathematics, vol 1829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39705-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-39705-2_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20358-2
Online ISBN: 978-3-540-39705-2
eBook Packages: Springer Book Archive