A Cost-Effective Dynamic Redundant Bitonic Sorting Network for ATM Switching


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 7, No. 4, pp. 1073-1081, Apr. 2000
10.3745/KIPSTE.2000.7.4.1073,   PDF Download:

Abstract

This paper proposes a new fault -tolerant technique for bilonic sorting networks which can be used for designing ATM switches based on Batcher-Banyan network. The main goal in this paper is to design a cost-cficctive fault-lolerant butome sorting network. In order to recover a fault, addional comparison elements and addional links are used A Dynamic Redundant Bilonic Sortig (DRBS) network is based on the Dynamic Redundant network and can be constructed with several different vanations. The proposed fault-tolerant sorting network offers high fault-tolerance; low time delays, maintenance of cell sequence, simple routing; and`` regularity and modulatity.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. D. Lee, J. H. Kim, H. I. Choi, "A Cost-Effective Dynamic Redundant Bitonic Sorting Network for ATM Switching," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 4, pp. 1073-1081, 2000. DOI: 10.3745/KIPSTE.2000.7.4.1073.

[ACM Style]
Jae Dong Lee, Jae Hong Kim, and Hong In Choi. 2000. A Cost-Effective Dynamic Redundant Bitonic Sorting Network for ATM Switching. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 4, (2000), 1073-1081. DOI: 10.3745/KIPSTE.2000.7.4.1073.