Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-26T10:22:07.998Z Has data issue: false hasContentIssue false
  • English
  • Français

Fluid Models with Burst Arrivals: A Sample Path Analysis

Published online by Cambridge University Press:  27 July 2009

Karl Sigman  and
Genji Yamazaki
Karl Sigman
Affiliation:
Department of Industrial Engineering and Operations Research Columbia University, New York, New York 10027
Genji Yamazaki
Affiliation:
Tokyo Metropolitan Institute of Technology Tokyo 191, Japan
Get access Rights & Permissions [Opens in a new window]

Abstract

Motivated by packetwise transmission of data in telecommunications, we introduce a fluid model with a continuous burst arrival process ψ = {(tn, Sn):n ≥ 0}. Each epoch, tn, begins a burst of length Sn that is, a continuous flow of fluid (work, information, etc.) at rate 1 to a system. The system processes fluid at rate 1. The model more generally can be used to approximate a storage system where fluid arrives over time due to many different (unrelated) sources. We analyze the model using sample path techniques (ψ is assumed deterministic, having arisen as a sample path from some underlying probability space) and by doing so obtain a variety of expressions for such quantities as average work inc system and average work in service as well as the empirical distribution for work in service. The expressions are given in terms of familiar quantities (such as customer delay) from the corresponding classic single- and infinite-channel queues that we construct from the same arrival sample path. In particular, we obtain an interesting decomposition of work in terms of the work in these two wellknown queueing models. In our final remarks, we also point out the optimality features of this model when compared to other models having different rules regulating the flow of burst work. In addition, we also give some stochastic ordering results when comparing two burst systems of the M/GI/1 or GI/M/1 type.

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 6 , Issue 1 , January 1992 , pp. 17 - 27
Copyright
Copyright © Cambridge University Press 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Brandt, A., Brandt, M., & Sulanke, H. (1990). A single server model for packetwise transmission of messages. Queueing Systems 6: 287–310.CrossRefGoogle Scholar
Brockwell, P.J., Resnick, S.I., & Tweedie, R.L. (1982). Storage processes with general release rule and additive inputs. Advances in Applied Probability 14: 392–433.CrossRefGoogle Scholar
Browne, S. & Sigman, K. (1992). Work-modulated queues with applications to storage processes. Journal of Applied Probability (to appear).CrossRefGoogle Scholar
Mitra, D. (1988). Stochastic fluid models. In Performance '87. Amsterdam: Elsevier Science Publishers B.V. (North-Holland), pp. 39–51.Google Scholar
Miyazawa, M. & Yamazaki, G. (1992). Loss probability of a burst arrival finite queue with synchronized service. Probability in the Engineering and Informational Sciences 6: 201–216.CrossRefGoogle Scholar
Pan, H., Okazaki, H., & Kino, I. (1989). Analysis of bursty traffic in ATM. Proceedings of the 13th International Teletraffic Congress, Copenhagen, pp. 795–800.Google Scholar
Perros, H.G. (1991). Performance issues in ATM networks–A literature review (technical report).Google Scholar
Prabhu, N.U. (1965). Queues and inventories. New York: John Wiley & Sons, Inc.Google Scholar
Prabhu, N.U. (1980). Stochastic storage processes. New York: Springer-Verlag.CrossRefGoogle Scholar
Wolff, R.W. (1989). Stochastic modeling and the theory of queues. Englewood Cliffs, NJ: Prentice-Hall.Google Scholar