SMM Clos-Network Switches under SD Algorithm

• Autorzy: Kleban J. , Warczyński J.

Identyfikatory

DOI

10.26636/jtit.2018.123017

• Języki publikacji: EN

Abstrakty

EN

This paper is devoted to evaluating the performance of Space-Memory-Memory (SMM) Clos-network switches under a packet dispatching scheme employing static connection patterns, referred to as Static Dispatching (SD). The control algorithm with static connection patterns can be easily implemented in the SMM fabric due to bufferless switches in the first stage. Stability is one of the very important performance factors of packet switching nodes. In general, a switch is stable for a particular arrival process if the expected length of the packet queues does not increase without limitation. To prove the stability of the SMM Clos-network switches considered under the SD packet dispatching scheme the discrete Markov chain model of the switch is used and Foster’s criteria to extend Lyapunov’s second (direct) method of stability investigation of discrete time stochastic systems are used. The results of simulation experiments, in terms of average cell delay and packet queue lengths, are shown as well.

Słowa kluczowe

EN

clos-network switch; packet dispatching algorithms; packet switching networks; stability of switching network

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2018
• Tom: nr 1
• Strony: 24--31
• Opis fizyczny: Bibliogr. 22 poz., rys.

Twórcy

autor

Kleban J.

• Faculty of Electronics and Telecommunications, Poznan University of Technology, Poznań, Poland

autor

Warczyński J.

• Faculty of Electrical Engineering, Poznan University of Technology, Poznań, Poland

Bibliografia

• [1] H. J. Chao and B. Liu, High Performance Switches and Routers. Wiley-Interscience, New Jersey, USA: Wiley, 2007.
• [2] Router-Switch.com, Cisco CRS-X Core Router to Offer 10 Times Capacity of Original [Online]. Available: http://blog.routerswitch.com/2013/06/cisco-crs-x-core-router-to-offer-10-timescapacity-of-original/ (accessed on February 14 , 2018).
• [3] C. Clos, “A Study of Non-Blocking Switching Networks”, Bell Sys. Tech. Jour., vol. 32, no. 2 pp. 406–424, 1953.
• [4] W. Kabaciński, Nonblocking Electronic and Photonic Switching Fabrics, Berlin: Springer, 2005.
• [5] V. E. Beneš, Mathematical Theory of Connecting Networks and Telephone Traffc, New York: Academic Press, 1965.
• [6] V. E. Beneš, “Semilattice characterization of nonblocking networks”. The Bell System Techn. J., vol. 52, no. 5, pp. 697–706, 1973.
• [7] H. M. Ackroyd, “Call repacking in connecting networks”, IEEE Transact. on Commun., vol. 27, no. 3, pp. 589–591, 1979.
• [8] A. Jajszczyk and G. Jekel, “A New Concept – Repackable Networks”, IEEE Transact. on Commun., vol. 41, no. 8, pp. 1232–1237, 1993.
• [9] E. Oki, Z. Jing, R. Rojas-Cessa, and H. J. Chao, “Concurrent round-robin-based dispatching schemes for Clos-network switches”, IEEE/ACM Transact. on Network., vol. 10, no. 6, pp. 830–844, 2002.
• [10] J. Kleban and A. Wieczorek, “CRRD-OG: A Packet Dispatching Algorithm with Open Grants for Three-Stage Buffered Clos-Network Switches”, in Proc. 2006 Workshop on High Performance Switching and Routing HPSR2006, Poznań, Poland, 2006, pp. 315–320.
• [11] J. Kleban, “Packet dispatching using module matching in the modified MSM Clos-network switch”, Telecommun. Sys,, vol. 66, no. 3, pp 505–513, 2017.
• [12] X. Li., Z. Zhou, and M. Hamdi, “Space-Memory-Memory architecture for Clos-network packet switches”. in Proc. IEEE Int. Conf. on Commun. – ICC 2005, Seoul, Korea (South), 2005, vol. 2, pp. 1031–1035.
• [13] A. V. Manolova, S. Ruepp, A. Rytlig, M. Berger, H. Wessing, and L. Dittmann, “Internal backpressure for terabit switch fabrics”, IEEE Commun. Let., vol. 16, no. 2, pp. 265–267, 2012.
• [14] J. Kleban and U. Suszyńska, “Static Dispatching with Internal Backpressure Scheme for SMM Clos-Network Switches”, in Proc. The Eighteenth IEEE Symp. on Computers and Commun., ISCC’13, Split, Croatia, 2013, pp. 654–658 (doi:10.1109/iscc.2013.6755022).
• [15] K. Yoshigoe, “The Crosspoint-Queued Switches with Virtual Crosspoint Queueing”. in Proc. 5th Int. Conf. on Signal Proces. and Commun. Sys. ICSPCS 2011), Honolulu, HI, USA, 2012, pp. 277–281.
• [16] K. Liu, J. Yan, and J. Lu, “Fault-tolerant Cell Dispatching for Onboard Space-Memory-Memory Clos-Network Packet Switches”, in Proc. 16th Int. Conf. on High Performance Switching and Routing HPSR, Budapest, Hungary, 2015 (doi:10.1109/HPSR.2015.7483090).
• [17] J. Kleban and H. Santos, “Packet Dispatching Algorithms with the Static Connection Patterns Scheme for Three-Stage Buffered ClosNetwork Switches”, in Proc. IEEE Int. Conf. on Commun. 2007 ICC-2007, Glasgow, United Kingdom, 2007 (doi:10.1109/ICC.2007.1046).
• [18] A. M. Lyapunov, “The General Problem of the Stability of Motion”, Int. J. of Control, vol. 55, no. 3, pp. 531–773, 1992 (doi: 10.1080/00207179208934253).
• [19] J. Kleban and J. Warczyński, “Stabilność buforowanych pól komutacyjnych Closa”, Przegląd Telekomunikacyjny i Wiadomości Telekomunikacyjne, no. 8–9, pp. 976–981, 2016 (in Polish).
• [20] F. G. Foster, “On the stochastic matrices associated with certain queuing processes”. Ann. Math. Statistics. vol. 24, np. 3, pp. 355–360, 1953.
• [21] S. Meyn and R. Tweedie, Markov Chains and Stochastic Stability, New York, USA: Springer, 1993.
• [22] N. McKeown, A. Mekkittikul, V. Anantharam, and J. Walrand, “Achieving 100% Throughput in an Input-queued Switch”, IEEE Transact. on Commun., vol. 47, no. 8, pp. 1260–1267, 1999 (doi: 10.1109/26.780463).

Uwagi

Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2018).