Premium
A fast parallel‐tree switch architecture for ATM networks
Author(s) -
AlMouhamed Mayez,
Youssef Habib,
Hasan Wasif
Publication year - 1998
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/(sici)1099-1131(199801/02)11:1<59::aid-dac344>3.0.co;2-w
Subject(s) - computer science , tree (set theory) , architecture , parallel computing , computer network , parallel architecture , computer architecture , distributed computing , art , mathematical analysis , mathematics , visual arts
Abstract In this paper we present a novel fast packet switch architecture based on Banyan interconnection networks, called parallel‐tree Banyan switch fabric (PTBSF). It consists of parallel Banyans (multiple outlets) arranged in a tree topology. The packets enter at the topmost Banyan. Internal conflicts are eliminated by using a conflict‐free 3 × 4 switching element which distributes conflicting cells over different Banyans. Thus, cell loss may occur only at the lowest Banyan. Increasing the number of Banyans leads to a noticeable decrease in cell loss rate. The switch can be engineered to provide arbitrarily high throughput and low cell loss rate without the use of input buffering or cell pre‐processing. The performance of the switch is evaluated analytically under uniform traffic load and by simulation, under a variety of asynchronous transfer mode (ATM) traffic loads. Compared to other proposed architectures, the switch exhibited stable and excellent performance with respect to cell loss and switching delay for all studied conditions as required by ATM traffic sources. The advantages of PTBSF are modularity, regularity, self‐routing, low processing overhead, high throughput and robustness, under a variety of ATM traffic conditions. © 1998 John Wiley & Sons, Ltd.