G/D/1 queueing analysis by discrete time modeling

被引：0
|
作者：
Nakagawa, K
机构：
来源：
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 1996年 / E79A卷 / 03期
关键词：
queueing; discrete time approximation; G/D/1; ATM;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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].
引用
收藏
页码：415 / 417
页数：3
相关论文
共 50 条
12345