A CELL SELECTION POLICY FOR AN INPUT-BUFFERED PACKET SWITCH

A. Bilami, M. Lalam, M. Daoui, and B. Djamah

References

  1. [1] R. Cessa, E. Oki, Z. Jing, & H.J. Chao, cixb-1: Combined input-once-cell-crosspoint buffered switch, IEEE Workshop on High Performance Switching and Routing, Dallas, TX, 2001, 324–329. doi:10.1109/HPSR.2001.923655
  2. [2] M. Ajmone Marsan, A. Bianco, P. Giaccone, E. Leonardi, & F. Neri, Packet scheduling in input-queued cell-based switches, IEEE INFOCOM, Ankorage, Alaska, 2001, 1085–1094. doi:10.1109/INFCOM.2001.916302
  3. [3] I. Keslassy, M. Kodialam, T.V. Lakshman, & D. Stiliadis, On guaranteed smooth scheduling for input-queued switches, IEEE INFOCOM, San Francisco, CA, 2003, 1384–1394. doi:10.1109/INFCOM.2003.1208974
  4. [4] S.T. Chuang, A. Goel, N. McKeown, & B. Prabhakar, Matching output queuing with a combined input output queued switch, INFOCOM 99, New York, 1999, 1169–1178.
  5. [5] T. Brown, A high performance two-stage packet switch architecture, IEEE Trans. on Communication, 47 (8), 1999, 1792–1795. doi:10.1109/26.809698
  6. [6] G. Kornaros, D. Pnevmatikas, P. Vatsolaki, G. Kalokerios, C. Xanthaki, D. Mavroidis, D. Serparos, & M. Katerimis, Implementation of ATLAS 1: A single chip ATM switch 241 with backpressure, Proc. IEEE Hot Interconnects VI Symp., Stanford, CA, 1998, 85–96.
  7. [7] D. Tutsch, M. Hendler, & G. Hommel, Multicast performance of multistage interconnection networks with shared buffering, ICN 2001, in P. Lorenz (Ed.), Berlin, Heidelberg, 2001, 478–487. doi:10.1007/3-540-47728-4_47
  8. [8] S. Lyer & N. McKeown, Techniques for fast shared memory switches, HPNG Tech. Report TR01-HPNG-081501, Stanford University, Stanford, CA, 2001.
  9. [9] J. Garcia, J. Corbal, L. Cerda, & M. Valero, Design and implementation of high-performance memory systems for future packet buffers, IEEE Proc. 36th Int. Symp. on Microarchitecture, San Diego, CA, 2003, 373–386.
  10. [10] M. Yang & S.Q. Zheng, An efficient scheduling algorithm for CIOQ switches with space-division multiplexing expansion, IEEE INFOCOM, San Francisco, CA, 2003, 1643–1650.
  11. [11] Y. Joo & N. McKeown, Doubling memory bandwidth for network buffers, IEEE INFOCOM, 2, San Francisco, 1998, 808–815. doi:10.1109/INFCOM.1998.665104
  12. [12] S. Lyer & N. McKeown, Analysis of the parallel packet switch architecture, IEEE/ACM Trans. on Networking, 11 (2), 2003, 314–324. doi:10.1109/TNET.2003.810315
  13. [13] M. Karol, M. Hluchyj, & S. Morgan, Input versus output queuing on space division switch, IEEE Trans. on Communications, 35(12), 1987, 1347–1356. doi:10.1109/TCOM.1987.1096719
  14. [14] R.V. Boppana & C.S. Raghavendra, Designing efficient Benes and banyan based input-buffered ATM switches, ICC’99, Vancouver, 1999, 1826–1830.
  15. [15] N. McKeown, A. Mekkittikul, A. Venkat, & J. Walrand, Achieving 100% throughput in an input-queued switch, IEEE Trans. on Communications, 47 (8), 1999, 1260–1267. doi:10.1109/26.780463
  16. [16] I. Keslassy & N. McKeown, Analysis of scheduling algorithms that provide 100% throughput in input-queued switches, Proc. 39th Annual Allerton Conf. on Communications, Control, and Computing, Monticello, IL, 2001, 593–602.
  17. [17] C. Kolias & L. Kleinrock, The odd-even input queuing ATM switch: Performance evaluation, ICC’96, Dallas, Texas, 1996, 1674–1679. doi:10.1109/ICC.1996.535292
  18. [18] L. Yihan, P. Shivendra, & H.J. Chao, On the performance of a dual round-robin switch, IEEE INFOCOM, 2001, 1688–1697. doi:10.1109/INFCOM.2001.916666
  19. [19] N. McKeown, iSLIP: A scheduling algorithm for input-queued switches, IEEE/ACM Trans. on Networking, 7 (2), 1999, 188– 201. doi:10.1109/90.769767
  20. [20] H. Cam, Preventing internal and external conflicts in an input buffering reverse baseline ATM switch, International Journal of Communication Systems, 13 (4), 2000, 317–334. doi:10.1002/1099-1131(200006)13:4<317::AID-DAC423>3.0.CO;2-I
  21. [21] W.M. Moh & Y.F. Chung, Design and evaluation of cell scheduling algorithms for ATM switches, Proc. IEEE Singapore Int. Conf. on Networks, Singapore, 1997, 355–369.
  22. [22] J.Y. Hui & E. Arthurs, A broadband packet switch for integrated transport, IEEE Journal on Selected Areas in Communications, 5 (8), 1987, 1264–1273. doi:10.1109/JSAC.1987.1146650
  23. [23] B. Beauquier & E. Darot, On arbitrary Waksman networks and their vulnerability, Tech. Report 3788, INRIA, 1997.
  24. [24] J. Lenfant, Parallel permutations of data: A Benes network control algorithm for frequently used permutations, IEEE Trans. on Computers, 27 (7), 1978, 637–647. doi:10.1109/TC.1978.1675164
  25. [25] D. Nassimi & S. Sahni, Parallel permutation and sorting algorithms and new generalized connection network, Journal of the ACM, 29(3), 1982, 642–667. doi:10.1145/322326.322329
  26. [26] R.V. Boppana & C.S. Raghavendra, Optimal self-routing of linear-complement permutations in hypercubes, 5th Distributed Memory Computing Conf. (DMCC-5), South Carolina, 1990, 800–808. doi:10.1109/DMCC.1990.556285
  27. [27] N. Das, K. Mukhopadhyaya, & J. Dattagupta, Self routing in Benes network, Tech. Report E/02/92, Indian Statistical Institute, Calcutta, 1992.
  28. [28] C.S. Raghavendra & V. Boppana, On self routing in Benes and shuffle-exchange networks, IEEE Trans. on Computers, 40 (9), 1991, 1057–1064. doi:10.1109/12.83649

Important Links:

Go Back