Analysis of Buffer Reservation Models with Mixed Renewal and Poisson Inputs
Summary :
This paper reports on studies of queueing systems having finite waiting buffers and many processors with two input streams, one of which is given preference over the other by buffer reservation. The arrival patterns for the two streams are different. One stream is described by a renewal process and the other is Poissonian. The former is called a GI call, and the latter a Poisson call. The buffer reservation model in this paper is an analogy from a trunk reservation model for telephone network. Two models are considered, giving priority to either Poisson calls or GI calls. The buffer reservation models have some practical applications to packet switched network and integrated communication systems such as voice and data systems. The models are analyzed using piecewise Markov process theory and transient solutions for an M/M/S/K queueing model. In addition, some numerical results are shown for loss probability and mean waiting time, as well as throughput rate. Traffic characteristics are consequently clarified.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E66-E No.9 pp.527-534
- Publication Date
- 1983/09/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Switching Systems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Konosuke KAWASHIMA, "Analysis of Buffer Reservation Models with Mixed Renewal and Poisson Inputs" in IEICE TRANSACTIONS on transactions,
vol. E66-E, no. 9, pp. 527-534, September 1983, doi: .
Abstract: This paper reports on studies of queueing systems having finite waiting buffers and many processors with two input streams, one of which is given preference over the other by buffer reservation. The arrival patterns for the two streams are different. One stream is described by a renewal process and the other is Poissonian. The former is called a GI call, and the latter a Poisson call. The buffer reservation model in this paper is an analogy from a trunk reservation model for telephone network. Two models are considered, giving priority to either Poisson calls or GI calls. The buffer reservation models have some practical applications to packet switched network and integrated communication systems such as voice and data systems. The models are analyzed using piecewise Markov process theory and transient solutions for an M/M/S/K queueing model. In addition, some numerical results are shown for loss probability and mean waiting time, as well as throughput rate. Traffic characteristics are consequently clarified.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e66-e_9_527/_p
Copy
@ARTICLE{e66-e_9_527,
author={Konosuke KAWASHIMA, },
journal={IEICE TRANSACTIONS on transactions},
title={Analysis of Buffer Reservation Models with Mixed Renewal and Poisson Inputs},
year={1983},
volume={E66-E},
number={9},
pages={527-534},
abstract={This paper reports on studies of queueing systems having finite waiting buffers and many processors with two input streams, one of which is given preference over the other by buffer reservation. The arrival patterns for the two streams are different. One stream is described by a renewal process and the other is Poissonian. The former is called a GI call, and the latter a Poisson call. The buffer reservation model in this paper is an analogy from a trunk reservation model for telephone network. Two models are considered, giving priority to either Poisson calls or GI calls. The buffer reservation models have some practical applications to packet switched network and integrated communication systems such as voice and data systems. The models are analyzed using piecewise Markov process theory and transient solutions for an M/M/S/K queueing model. In addition, some numerical results are shown for loss probability and mean waiting time, as well as throughput rate. Traffic characteristics are consequently clarified.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - Analysis of Buffer Reservation Models with Mixed Renewal and Poisson Inputs
T2 - IEICE TRANSACTIONS on transactions
SP - 527
EP - 534
AU - Konosuke KAWASHIMA
PY - 1983
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E66-E
IS - 9
JA - IEICE TRANSACTIONS on transactions
Y1 - September 1983
AB - This paper reports on studies of queueing systems having finite waiting buffers and many processors with two input streams, one of which is given preference over the other by buffer reservation. The arrival patterns for the two streams are different. One stream is described by a renewal process and the other is Poissonian. The former is called a GI call, and the latter a Poisson call. The buffer reservation model in this paper is an analogy from a trunk reservation model for telephone network. Two models are considered, giving priority to either Poisson calls or GI calls. The buffer reservation models have some practical applications to packet switched network and integrated communication systems such as voice and data systems. The models are analyzed using piecewise Markov process theory and transient solutions for an M/M/S/K queueing model. In addition, some numerical results are shown for loss probability and mean waiting time, as well as throughput rate. Traffic characteristics are consequently clarified.
ER -
English
