THE INFLUENCE OF CELL LOSS PATTERNS AND OVERHEADS ON RETRANSMISSION CHOICES IN BROAD-BAND ISDN

被引:5
作者
BONDI, AB [1 ]
LAI, WS [1 ]
机构
[1] AT&T BELL LABS,HOLMDEL,NJ 07733
来源
COMPUTER NETWORKS AND ISDN SYSTEMS | 1994年 / 26卷 / 05期
关键词
ASYNCHRONOUS TRANSFER MODE (ATM); B-ISDN; BANDWIDTH EFFICIENCY; BUNCHED (CORRELATED) CELL LOSSES; ERROR RECOVERY; SELECTIVE FRAME-BASED RETRANSMISSION;
D O I
10.1016/0169-7552(94)90069-8
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we consider retransmission-based error recovery schemes for broadband ISDN. Retransmission performance is affected by patterns of cell loss behaviour and by the amount of overhead required. In B-ISDN, data are transmitted in frames, each consisting of a number of ATM cells. When cell losses are detected within a frame, we may either request the retransmission of the cells that were lost (selective cell-based retransmission) or the retransmission of the frame in its entirety (selective frame-based retransmission). The former policy appears to result in the retransmission of fewer cells, but incurs a higher overhead per unit of user data transmitted. The latter policy may incur far less processing overhead per retransmission request, but also incurs the risk that cells may be lost during one or more reattempts at transmission also. We shall show that the bandwidth efficiency of selective cell-based retransmission is worse than that of selective frame-based retransmission when the cell loss rate is less than a reasonable threshold. This indicates that selective frame-based retransmission is the better policy in reasonable operating ranges. When the cell loss rate exceeds that threshold, the network service is so poor that there is little to choose between the two policies. However, a Markovian model of a space-division switch shows that cell losses tend to be bunched within frames, especially when the cell loss rate is high, suggesting that a selective frame-based retransmission policy is appropriate under heavy congestion also.
引用
收藏
页码:585 / 598
页数:14
相关论文
共 9 条
[1]  
[Anonymous], 1960, FINITE MARKOV CHAINS
[2]  
[Anonymous], 1968, INTRO PROBABILITY TH
[3]  
BONDI AB, 1991, DEC P GLOBECOM 91 PH
[4]   COMPUTATIONAL ALGORITHMS FOR CLOSED QUEUING NETWORKS WITH EXPONENTIAL SERVERS [J].
BUZEN, JP .
COMMUNICATIONS OF THE ACM, 1973, 16 (09) :527-531
[5]  
GOLDSTEIN FR, 1989, ANSI T1S1189317 STAN
[6]   INPUT VERSUS OUTPUT QUEUING ON A SPACE-DIVISION PACKET SWITCH [J].
KAROL, MJ ;
HLUCHYJ, MG ;
MORGAN, SP .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1987, 35 (12) :1347-1356
[7]  
LAI WS, 1991, JUN ICC 91 C REC DEN
[8]  
SHACHAM N, 1990, JUN P INFOCOM 90, P124
[9]  
1991, CCITT I363 DRAFT REC