Evaluating the limit behavior of the ATM traffic within a network

被引:11
作者
DAmbrosio, M [1 ]
Melen, R [1 ]
机构
[1] POLITECN MILAN, DIPARTIMENTO ELETTRON, I-20133 MILAN, ITALY
关键词
D O I
10.1109/90.477728
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper is concerned with the ATM traffic characterization within the network. Most of the work performed up to now has studied the effects of traffic on the access multiplexor and the first switch of an ATM network. Various source models were assumed to generate the ATM traffic. So, while the performance of a single switch node has been exhaustively examined, the statistical behavior of the traffic modified as it crosses the network has not been thoroughly analyzed yet. This paper, through an analysis of a network of cascaded queues, indicates that limit distributions exist in the statistical behavior of the traffic streams and in the queue performance, although a formal proof is believed to be very hard to obtain. The first modelling step consists of deriving the exact interdeparture time distribution for the cells of a reference-connection arriving to the output queue of a switch node with a general interarrival time distribution and multiplexed with a background traffic stream. The analysis is iterated through a long sequence of cascaded output queues, until the interdeparture time distribution converges. Simulations show that the analytical results are accurate at each stage of the network under the hypothesis of independent queues, and are also good approximations in the case of correlated queues. This study shows that the queue performance at the limit point is always better than the M/D/1 case. The distributions found in this way depend only on the connection bandwidth and on the background traffic behavior. The initial characteristics of a connection (burst length distributions and burst interarrival time distributions) only influence the convergence speed, not the limit distribution.
引用
收藏
页码:832 / 841
页数:10
相关论文
共 20 条
[1]   THE INPUT-OUTPUT MAP OF A MONOTONE DISCRETE-TIME QUASI-REVERSIBLE NODE [J].
ANANTHARAM, V .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (02) :543-552
[2]  
Anantharam V, 1993, ANN APPL PROBAB, V3, P154
[3]  
BONOMI F, 1992, P IEEE INFOCOM FLOR, P544
[4]   THE OUTPUT OF A QUEUING SYSTEM [J].
BURKE, PJ .
OPERATIONS RESEARCH, 1956, 4 (06) :699-704
[5]  
CHANG CS, 1994, UNPUB INPUT OUTPUT M
[6]  
CHEN JSC, 1991, IEEE J SELECT AR APR, V9
[7]  
D'Ambrosio M., 1992, CSELT Technical Reports, V20, P265
[8]  
DAMROSIO M, 1990, RR90598 CSELT INT RE
[9]  
DAVIE BS, 1989, BELL COMMUN RES JUL
[10]  
HLUCHYI M, 1988, IEEE J SELECT AREAS, V6