Hostname: page-component-89b8bd64d-nlwjb Total loading time: 0 Render date: 2026-05-07T09:46:10.990Z Has data issue: false hasContentIssue false
  • English
  • Français

Asymptotic Analysis for Buffer Behavior in Communication Systems

Published online by Cambridge University Press:  27 July 2009

H. C. Tijms  and
J. C. W. Van Ommeren
H. C. Tijms
Affiliation:
Institute for Econometrics Vrije Universiteit Amsterdam, The Netherlands
J. C. W. Van Ommeren
Affiliation:
Institute for Econometrics Vrije Universiteit Amsterdam, The Netherlands
Get access Rights & Permissions [Opens in a new window]

Abstract

An important problem in computer communication systems is the design of finite buffers such that a small overflow probability is achieved. For the case of batch input and general service times, we derive an asymptotically exponential expansion for the overflow probability when the batch-arrival process is Poissonian. Next, the results are extended to handle applications with periodic service opportunities and random interruptions in service. A convenient model to handle these types of applications is the versatile queueing model with exceptional first services.

Information

Type
Articles
Information
Probability in the Engineering and Informational Sciences , Volume 3 , Issue 1 , January 1989 , pp. 1 - 12
Copyright
Copyright © Cambridge University Press 1989

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.)

Article purchase

Temporarily unavailable

References

Bruneel, H. (1983). On the behavior of buffers with random server interruptions. Performance Evaluation 3: 165–175.CrossRefGoogle Scholar
Heines, T.S. (1979). Buffer behavior in computer communication systems. IEEE Transactions on Communication 28: 573–576.CrossRefGoogle Scholar
Ross, S.M. (1983). Stochastic processes. New York: Wiley.Google Scholar
Tijms, H.C. (1986). Stochastic modeling and analysis: A computational approach. New York: Wiley.Google Scholar
Woodside, C.M. & Ho, E.D.S. (1987). Engineering calculation of overflow probabilities in buffers with Markov-interrupted service. IEEE Transactions on Communication 35: 1272–1277.CrossRefGoogle Scholar