Pseudo-isochronous cell forwarding

被引:23
作者
Li, CS
Ofek, Y
Segall, A
Sohraby, K
机构
[1] Synchrodyne Inc, Riverdale, NY 10463 USA
[2] IBM Corp, Thomas J Watson Res Ctr, Yorktown Heights, NY 10598 USA
[3] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
[4] Univ Missouri, CSTP, Kansas City, MO 64110 USA
来源
COMPUTER NETWORKS AND ISDN SYSTEMS | 1998年 / 30卷 / 24期
关键词
real-time traffic; traffic integration; flow control; congestion control; asynchronous transfer mode (ATM); quality of service (QoS); deterministic QoS; jitter; end-to-end delay; blocking probability; scheduling algorithm; global time reference; GPS (glonal positioning system) time; clock synchronization;
D O I
10.1016/S0169-7552(98)00258-X
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper shows how to design a packet switched network, for real-time traffic, such that under full network load: (i) the end-to-end delay bound of a low-rate voice connection is minimized, (ii) the bound on the delay uncertainty or jitter is a fixed network parameter - independent of the network size and the connection rate, and (iii) the required buffer sizes (inside the network) to ensure congestion-free routing is minimized. In addition, this design can be generalized to accommodate either variable bit rate (VBR) traffic with statistical multiplexing or the integration of available bit rate (ABR) traffic [7,12]. The isochronous timing information (can be provided by the global positioning system (GPS) [II]) is used for pacing the packet/cell forwarding inside the network. This means that a cell is forwarded from one switch to another not at a specific time but within a time frame of a relatively long duration as compared with the cell transmission time. This time frame is an independent network parameter, which determines the delay and jitter bounds inside the network. A study of the blocking probability of this approach is presented. (Blocking is defined as the impossibility of allocating bandwidth for a new connection while capacity is still available, but not in the proper time frames.) The study includes both analytical and simulation results, which demonstrate an important trade-off between the blocking probability and the end-to-end delay bound. (C) 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:2359 / 2372
页数:14
相关论文
共 14 条
[1]  
DANA PH, 1997, GLOBAL POSITIONING S
[2]  
DEMERS A, 1989, ACM COMPUTER COMMUNI, P3
[3]   A SCHEME FOR REAL-TIME CHANNEL ESTABLISHMENT IN WIDE-AREA NETWORKS [J].
FERRARI, D ;
VERMA, DC .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1990, 8 (03) :368-379
[4]  
GOLESTANI SJ, 1991, IEEE T COMMUN, V39, P1802, DOI 10.1109/26.120166
[5]   REAL-TIME COMMUNICATION IN MULTIHOP NETWORKS [J].
KANDLUR, DD ;
SHIN, KG ;
FERRARI, D .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1994, 5 (10) :1044-1056
[6]   FAST SWITCHING AND FAIR CONTROL OF CONGESTED FLOW IN BROAD-BAND NETWORKS [J].
KATEVENIS, MGH .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1987, 5 (08) :1315-1326
[7]  
Li C., 1996, IEEE INFOCOM 96
[8]  
Ofek Y., 1987, 7th International Conference on Distributed Computing Systems (Cat. No.87CH2439-8), P307
[9]  
OFEK Y, 1994, IEEE INFOCOM SER, P802, DOI 10.1109/INFCOM.1994.337658
[10]  
OFEK Y, 1994, IEEE T COMMUN MAY, P2179