RAZAN: A high-performance switch architecture for ATM networks

被引:0
作者
Abd-El-Barr, M
Al-Tawil, K
Youssef, H
Al-Jarad, T
机构
[1] King Fahd Univ Petr & Minerals, Dept Comp Engn, Dhahran 31261, Saudi Arabia
[2] Univ Saskatchewan, Dept Comp Sci, Saskatoon, SK S7N 0W0, Canada
[3] Univ Saskatchewan, Dept Elect Engn, Saskatoon, SK S7N 0W0, Canada
关键词
B-ISDN; ATM switch architecture; multistage interconnection networks (MINs); performance evaluation; analytical model; simulation;
D O I
10.1002/(SICI)1099-1131(199807/08)11:4<275::AID-DAC367>3.0.CO;2-9
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper a high-performance packet switch architecture based on the improved logical neighbourhood (ILN) interconnection network, called RAZAN, is presented. RAZAN is an NxN multistage interconnection network (MIN) which consists of n stages, where n = log(2)N, of switching elements. Each stage consists of a column of N switching elements and (n + 1) x N links. Each switch has n + 1 inputs and n + 1 outputs. Every switching element j is connected to those n + 1 neighbouring switches in the next stage whose binary addresses differ by at most 1 bit from the binary address of switch j. The performance of RAZAN is evaluated both analytically and via simulation under uniform traffic load. The analytical and simulation performance evaluation results are compared. The performance of RAZAN is compared with a number of existing ATM switch architectures such as Benes, parallel banyan and Tagle networks. It is shown that RAZAN exhibits better performance in terms of both the rate of cell loss and throughput. This advantage of RAZAN over existing ATM switch architectures has been achieved at the expense of a moderate increase in switch complexity. In addition, an important characteristic which RAZAN possesses and which distinguishes it further from most existing ATM switch architectures is its ability to achieve very high throughput (higher than 80 per cent) in the presence of faulty switches and/or links. In this paper the fault tolerance characteristics of RAZAN are presented. However, space constraints do not allow us to present a detailed analysis of the fault tolerance and reliability features of RAZAN. These aspects are elaborated in a separate publication. (C) 1998 John Wiley & Sons, Ltd.
引用
收藏
页码:275 / 285
页数:11
相关论文
共 50 条
[31]   A HIGH-SPEED-RETRY BANYAN SWITCH ARCHITECTURE FOR GIGA-BIT-RATE BISDN NETWORKS [J].
GENDA, K ;
YAMANAKA, N ;
ARAI, Y ;
KATAOKA, H .
INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 1994, 7 (03) :223-229
[32]   PERFORMANCE EVALUATION OF STATISTICAL MULTIPLEXING SCHEMES IN ATM NETWORKS [J].
SYKAS, ED ;
VLAKOS, KM ;
ANEROUSIS, NG .
COMPUTER COMMUNICATIONS, 1991, 14 (05) :273-286
[33]   Performance analysis of an output queueing ATM switch with heterogeneous traffic and multiple QoS [J].
Park, CY ;
Chung, H ;
Un, CK .
IEE PROCEEDINGS-COMMUNICATIONS, 1996, 143 (06) :356-362
[34]   Early deployment of ATM in access networks: A node architecture which supports evolution [J].
Calierno, M ;
Cohen, JL ;
Cullen, AM ;
Dellacasa, S ;
Ghiggino, P .
GEC JOURNAL OF RESEARCH, 1995, 12 (03) :153-162
[35]   High-performance manufacturing [J].
Guo, Dongming .
INTERNATIONAL JOURNAL OF EXTREME MANUFACTURING, 2024, 6 (06)
[36]   Efficient Shading Device as an Important Part of Daylightophil Architecture; a Designerly Framework of High-Performance Architecture for an Office Building in Tehran [J].
Bazazzadeh, Hassan ;
Swit-Jankowska, Barbara ;
Fazeli, Nasim ;
Nadolny, Adam ;
Safar Ali Najar, Behnaz ;
Hashemi Safaei, Seyedeh Sara ;
Mahdavinejad, Mohammadjavad .
ENERGIES, 2021, 14 (24)
[37]   A HIGH-SPEED ATM SWITCH WITH INPUT AND CROSS-POINT BUFFERS [J].
DOI, Y ;
YAMANAKA, N .
IEICE TRANSACTIONS ON COMMUNICATIONS, 1993, E76B (03) :310-314
[39]   P3FA: Unified Unicast/Multicast Forwarding Algorithm for High-Performance Router/Switch [J].
Jin, Zhu ;
Jia, Wen-Kang .
IEEE TRANSACTIONS ON CONSUMER ELECTRONICS, 2022, 68 (04) :327-335
[40]   Evaluating high-performance computers [J].
Vetter, JS ;
de Supinski, BR ;
Kissel, L ;
May, J ;
Vaidya, S .
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2005, 17 (10) :1239-1270