G/D/1 Queueing Analysis by Discrete Time Modeling
Summary :
G/D/1 is a theoretic model for ATM network queueing based on processing cells. We investigate the G/D/1 system by discrete time modeling. Takacs' combinatorial methods are applied to analyze the system performance. An approximation for the survivor function P[Q > q], which is the probability that the queue length Q in the stationary state exceeds q, is obtained. The obtained formula requires only very small computational complexity and gives good approximation for the true value of P[Q > q].
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E79-A No.3 pp.415-417
- Publication Date
- 1996/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Communication Theory and Signals
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
Kenji NAKAGAWA, "G/D/1 Queueing Analysis by Discrete Time Modeling" in IEICE TRANSACTIONS on Fundamentals,
vol. E79-A, no. 3, pp. 415-417, March 1996, doi: .
Abstract: G/D/1 is a theoretic model for ATM network queueing based on processing cells. We investigate the G/D/1 system by discrete time modeling. Takacs' combinatorial methods are applied to analyze the system performance. An approximation for the survivor function P[Q > q], which is the probability that the queue length Q in the stationary state exceeds q, is obtained. The obtained formula requires only very small computational complexity and gives good approximation for the true value of P[Q > q].
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e79-a_3_415/_p
Copy
@ARTICLE{e79-a_3_415,
author={Kenji NAKAGAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={G/D/1 Queueing Analysis by Discrete Time Modeling},
year={1996},
volume={E79-A},
number={3},
pages={415-417},
abstract={G/D/1 is a theoretic model for ATM network queueing based on processing cells. We investigate the G/D/1 system by discrete time modeling. Takacs' combinatorial methods are applied to analyze the system performance. An approximation for the survivor function P[Q > q], which is the probability that the queue length Q in the stationary state exceeds q, is obtained. The obtained formula requires only very small computational complexity and gives good approximation for the true value of P[Q > q].},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - G/D/1 Queueing Analysis by Discrete Time Modeling
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 415
EP - 417
AU - Kenji NAKAGAWA
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E79-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 1996
AB - G/D/1 is a theoretic model for ATM network queueing based on processing cells. We investigate the G/D/1 system by discrete time modeling. Takacs' combinatorial methods are applied to analyze the system performance. An approximation for the survivor function P[Q > q], which is the probability that the queue length Q in the stationary state exceeds q, is obtained. The obtained formula requires only very small computational complexity and gives good approximation for the true value of P[Q > q].
ER -
English
