The Transactions of the Korea Information Processing Society (한국정보처리학회논문지)

Korea Information Processing Society (한국정보처리학회)
권호 표지

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

ATM 교환을 위한 비용 효율적인 동적 결함내성 bitonic sorting network

  • Published : 2000.04.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper proposes a new fault-tolerant technique for bitonic 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-effective fault-tolerant bitonic sorting network. In order to recover a fault, additional comparison elements and additional links are used. A Dynamic Redundant Bitonic Sorting (DRBS) network is based on the Dynamic Redundant network and can be constructed with several different variations. The proposed fault-tolerant sorting network offers high fault-tolerance; low time delays; maintenance of cell sequence; simple routing; and regularity and modularity.

Keywords

References

  1. 'Broadband aspects of ISDN.' CCITT recommendation, I.121, Nov. 1988
  2. H. Amano, 'A Fault Tolerant Batcher Network,' in Proceeding of the 1990 International Conference on Parallel Processing. Vol.I, pp.441-444. 1990
  3. S. Assaf and E Upfal, 'Fault-tolerant sorting network,' in Proceedings of the 31st Annual IEEE Symposium, on Foundations of Computer Science, pp.275-284, Oct 1990
  4. KE Batcher, 'Sorting networks and their apphcations.' 1968 Spring Joint Computer Conference, AFlPS Proc , Vol 32, pp.307 - 314
  5. Imagawa, H., Urushidani, S. and Hagishima, K, 'A new self-routing switch driven with input-output address difference' in Proc. GLOBECOM' 88, pp 1607-1611, Dec. 1988
  6. Giacopelli et al. J., 'Sunshine : A High-performance self-routing Broadband packet switch Architecture,' IEEE J. of selected Areas in Communications. Vol.9, No.8, pp.1289-1298, Oct. 1991 https://doi.org/10.1109/49.105175
  7. Pattavina, Achille, 'Non-blocking Architectures for ATM Switching.' IEEE Communications Magazine. pp 38-48, Feb. 1993
  8. L. Rudolph, 'A Robust sorting network,' IEEE Transactions on Computers Vol C-43, pp344- 354, 1985
  9. M Schummler and C Starke, 'A Correction network for N-sorters,' SIAM J. Comput. Vol 18. No.6, pp.1179-1187. Dcc. 1989 https://doi.org/10.1137/0218078
  10. H.J. Siegel, Interconnection networks for LargeScale Parallel Processing. Theory and Case Studies, Second Edition, McGraw-Hill,1990
  11. H.S. Stone, 'Parallel processing with the perfect ？shuffle,' IEEE Transactions on Computers. Vo1.C-20, pp.153-161, 1971
  12. A. C. Yao and F.F. Yao, 'On fault-tolerant networks for sorting,' SIAM J Comput vol.14 ,No.1, pp,120-128, Feb. 1985