Advertisement

Analysis of Shuffle-Exchange Networks under Permutation Trafic

Chapter
Part of the Network Theory and Applications book series (NETA, volume 5)

Abstract

Multistage interconnection networks (MINs) such as shuffle-exchange, baseline, and banyan networks have been widely investigated for use in parallel processing systems and high speed communication switches. Among the main advantages of a shuffle-exchange type network are self-routing, low hardware complexity compared to crossbar switch, distributed control, suitable for VLSI implementation, modular and scalable. The main disadvantage of an n-stage shuffle-exchange type network with N inputs and N outputs is to have a limited number of connection patterns bacause of internal conflicts in switching elements, where N = 2 n .

Keywords

Output Port Input Port Packet Loss Rate Permutation Matrix Asynchronous Transfer Mode 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    C.S. Raghavendra and A. Varma, “R,earrangeability of the five stage Shuffle-Exchange network for N=8,” IEEE Trans. on Commun., Vol. com-35, pp. 808–812, Aug. 1987.MathSciNetCrossRefGoogle Scholar
  2. [2]
    N. Linial and M. Tarsi, “Interpolation between bases and the Shuffle-Exchange network,” Europ. J. Combinatorics, Vol. 10, pp. 29–39, 1989.MathSciNetzbMATHGoogle Scholar
  3. [3]
    H.S. Stone, “Parallel processing with the perfect shuffle,” IEEE Trans. on Comput., Vol. c-20, pp. 153–161, Feb. 1971.CrossRefGoogle Scholar
  4. [4]
    D.S. Parker, “Notes on shuffle/exchange-type switching networks,” IEEE Trans. Comput., Vol. C-29, pp. 213–222, March 1980.CrossRefGoogle Scholar
  5. [5]
    H.J. Siegel, “The universality of various types of SIMD machine interconnection networks,” Proceedings of the,nth Annual Symposium on Computer Architecture, pp. 70–79, March 1977.Google Scholar
  6. [6]
    C. Wu and T.Y. Feng, “On a class of multistage interconenction networks,” IEEE Trans. on Comput., Vol. C-29, pp. 696–702, 1980.Google Scholar
  7. [7]
    C.S. Babu and C.S. Raghavendra, “On the invariants of shuffle/exchange networks,” Proceedings of the First IEEE Symp. on Parallel and Distributed Processing, pp. 249–256, May 1989.Google Scholar
  8. [8]
    C. Wu and T.-Y. Feng, “The universality of the shuffle-exchange network,” IEEE Trans. on Comput., Vol. C-30, pp. 324–331, May 1981.MathSciNetCrossRefGoogle Scholar
  9. [9]
    S.T. Huang and S. K. Tripathi, “Finite state model and compatibility theory: new analysis tools foe permutation networks, ”IEEE Trans. On Comput., Vol. C-35, pp. 591–601, July 1986.CrossRefGoogle Scholar
  10. [10]
    C.S. Raghavendra, “On the rearrangeability conjecture of (2log2N —1)-stage shuffle/exchange network (Position Paper),” Computer Architecture Technical Committee Newsletter, pp. 10–12, Winter 1994–1995.Google Scholar
  11. [11]
    M.K. Kim, H. Yoon and S.R. Maeng, “On the correctness of inside-out routing algorithm,” IEEE Trans. on Comput.. Vol 46, no 7, pp. 820–823, July 1997.CrossRefGoogle Scholar
  12. [12]
    V.E. Benes, “Proving the rearrangeability of connecting networks by group calculations,” Bell System Tech. J., 45, pp. 421–434. 1975.MathSciNetGoogle Scholar
  13. [13]
    F.K. Hwang, “A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks.” Operations Research Letters, Vol. 8, no. 2, pp. 85–87, 1989.MathSciNetzbMATHCrossRefGoogle Scholar
  14. [14] Hasan çam, “Rearrangeability of (2n - 1)-Stage Shuffle-Exchange Networks,” To appear in SIAM.Journall on Computing.Google Scholar
  15. [15]
    M.G. Hluchyj and M.J. Karol, “Queueing in high-performance packet switching,” IEEE J. Select. Areas Commun., Vol. 6, No. 9, pp. 1587–1597, Dec. 1988.CrossRefGoogle Scholar
  16. [16]
    Y. Tamir and G.L. Frazier, “High-performance multi-queue buffers for VLSI communication switches,” in Proc. of the 15th Annual Int. Symp. on Computer Architecture, pp. 343–354, 1988.Google Scholar
  17. [17]
    Y.S. Yeh, M.G. Hluchyj and A.S. Acampora. “The knockout switch: a simple, modular architecture for high-performance packet switching.” IEEE J. Select. Areas Commun., Vol. SAC-5. No. 8, pp. 1274–1283, Oct. 1987.Google Scholar
  18. [18]
    J. Hui and E. Arthurs, “A broadband packet switch for integrated transport,” IEEE J. Select. Areas Commun., Vol. 5, No. 8. pp. 1264–1273, Oct. 1987.CrossRefGoogle Scholar
  19. [19]
    M. Akata, S. Karube, T. Sakarnoto, T. Saito, S. Wakasugi, S. Yoshida, H. Matsuno and H. Shibata, “A scheduling content-addressable memory for ATM space-division switch control,” in ISSCC Dig. Tech. Papers, pp. 244–245, 1991.Google Scholar
  20. [20]
    B. Bingham and H. Bussey, “Reservation-based contention resolution mechanism for hatcher-banyan packet switches,” Electron. Lett.. Vol. 24, No. 13, pp. 772–773, June 1988.CrossRefGoogle Scholar
  21. [21]
    M.J. Karol, M.G. Hluchyj and S.P. Morgan, “Input versus output queueing on a space-division packet switch,” IEEE Trans. Commun., Vol. com-35, No. 12, pp. 1347–1356, Dec. 1987.CrossRefGoogle Scholar
  22. [22]
    T.T. Lee, “A modular architecture for very large packet switches,” in Proc. GLOBECOM, pp. 1801–1809, 1989.Google Scholar
  23. [23]
    A. Pattavina, “Multichannel bandwidth allocation in a broadband packet switch,” IEEE J. Select. Areas Commun., Vol. 6, No. 9, pp. 1489–1499, Dec. 1988.CrossRefGoogle Scholar
  24. [24]
    K.W. Sarkies, “The bypass queue in fast packet switching,” IEEE Trans. Commun., Vol. 39, No. 5, pp. 766–774, May 1991.CrossRefGoogle Scholar
  25. [25]
    J.S. Turner, “Queueing analysis of buffered switching networks,” IEEE Trans. Commun., Vol. 41, No. 2, pp. 412–420, Feb. 1993.zbMATHCrossRefGoogle Scholar
  26. [26]
    J.H. Huang and Y.S. Su, “Analysis and design of banyan and crossbar switches with bypass queues,” Computer Communications, Vol. 20, pp. 115–124, 1997.CrossRefGoogle Scholar
  27. [27]
    H. Çam and J.A.B. Fortes, “Frames: a simple characterization of permutations realized by frequently used networks,” IEEE Trans. on Comput., Vol. 44, No. 5, pp. 695–697, May 1995.zbMATHCrossRefGoogle Scholar
  28. [28]
    Hasan Çam, “Balanced Permutations and Multistage Interconnection Networks,” International Journal of Computer Mathematics, vol. 73, no. 1, pp. 125–137, Nov. 1999.MathSciNetzbMATHCrossRefGoogle Scholar
  29. [29]
    Hasan Çam, “Preventing Internal and External Conflicts in an Input Buffering Reverse Baseline ATM Switch,” Int. Journal of Communication Systemsvol. 13, no. 4, pp. 317–334, June 2000.CrossRefGoogle Scholar
  30. [30]
    Hasan Çam, “A High-Performance ATM Switch Based on Modified Shuffle-Exchange Network,” Computer Communications, vol. 22, no. 2, pp. 110–118, 25 Jan. 1999.Google Scholar
  31. [31]
    J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, North-Holland, New York, 1979.Google Scholar
  32. [32]
    S.F. Oktug and M.U. Çaglayan, “Design and performance evaluation of a banyan network based interconnection structure for ATM switches,” IEEE Journal on Selected Areas in Communications, Vol. 15, No. 5, pp. 807–816, June 1997.CrossRefGoogle Scholar
  33. [33]
    D. Basak, A.K. Choudhury and E.L. Hahne, “Sharing memory in banyan-based ATM switches,” IEEE Journal on Selected Areas in Communications, Vol. 15, No. 5, pp. 881–891, June 1997.CrossRefGoogle Scholar
  34. [34]
    M.D. Marco and A. Pattavina, “Distributed routing protocols for ATM extended banyan networks,” IEEE Journal on Selected Areas in Communications, Vol. 15, No. 5, pp. 925–937, June 1997.CrossRefGoogle Scholar
  35. [35]
    G.D. Stamoulis, M.E. Anagnostou and A.D. Georgantas, “Traffic source models for ATM networks: a survey,” Computer Communications, Vol. 17, pp. 428–438, 1994.CrossRefGoogle Scholar
  36. [36]
    R.Y. Awdeh and H.T. Mouftah, “MS4 - A high performance output buffering ATM switch,” Computer Commun., Vol. 18, No. 9, pp. 631643, Sept. 1995.Google Scholar
  37. [37]
    F.A. Tobagi, T. Kwok and F.M. Chiussi, “Architecture, performance, and implementation of the tandem banyan fast packet switch, ” IEEE J. Select. Areas Commun., Vol. 9, No. 8, pp. 1173–1193. Oct. 1991.CrossRefGoogle Scholar
  38. [38]
    S. Urushidani, “Rerouting network: a high-perfbrrnance self-routing switch for B-ISDN,” IEEE.I. Select. Areas Commun., Vol. 9, No. 8, pp. 1194–1204, Oct. 1991.CrossRefGoogle Scholar
  39. [39]
    F. Ayadi, J.F. Hayes and M. Kavehrad, “Performance analysis of the bilayered ShuffleNet and SR_Net under deflection routing,” Computer Communications, Vol. 20, pp. 125–137, 1997.CrossRefGoogle Scholar
  40. [40]
    T.H. Lee, “Design and analysis of a new self-routing network,” IEEE Trans. on Commun., Vol. 40. pp. 171–177, Jan. 1992.zbMATHCrossRefGoogle Scholar
  41. [41]
    R.Y. Awdeh and H.T. Mouftah, “Survey of ATM switch architectures,” Computer Networks and ISDN Systems, Vol. 27, pp. 1567–1613, 1995.CrossRefGoogle Scholar
  42. [42]
    K.J. Schultz and P.G. Gulak, “Multicast contention resolution with single-cycle windowing using content addressable FIFO’s,” IEEE/ACM Trans. Networking, Vol. 4, No. 5, pp. 731–742, Oct. 1996.CrossRefGoogle Scholar
  43. [43]
    Y.K. Park and G. Lee, “NN based ATM cell scheduling with queue length-based priority scheme,” IEEE J. Select. Areas Commun., Vol. 15, No. 2, pp. 261–270, Feb. 1997.CrossRefGoogle Scholar
  44. [44]
    A. Pattavina, “Nonblocking architectures for ATM switching,” IEEE Commun. Mag., No. 2, pp. 38–48, Feb. 1993.CrossRefGoogle Scholar
  45. [45]
    A. Mekkittikul and N. McKeown, “A practical scheduling algorithm to achieve 100% throughput in input-queued switches,” in Proc. of the INFOCOM’92, pp. 792–799, 1998.Google Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  1. 1.Computer Science and Computer Engineering DepartmentUniversity of ArkansasFayettevilleUSA

Personalised recommendations