Title :
Performance analysis of a robust scheduling algorithm for scalable input-queued switches
Author :
Elhanany, Itamar ; Sadot, Dan
Author_Institution :
Dept. of Electr. & Comput. Eng., Ben-Gurion Univ. of the Negev, Beer-Sheva, Israel
Abstract :
In this paper a high-performance, robust and scalable scheduling algorithm for input-queued switches, called distributed sequential allocation (DISA), is presented and analyzed. Contrary to pointer-based arbitration schemes, the algorithm proposed is based on a synchronized channel reservation cycle whereby each input selects a designated output, considering both its local requests as well as global channel availability information. The distinctiveness of the algorithm is in its ability to offer high-performance when multiple cells are transmitted within each switching intervals. The subsequent relaxed switching-time requirement allows for the utilization of commercially available crosspoint switches, yielding a pragmatic and scalable solution for high port-density switching platforms. The efficiency of the algorithms and its robustness is established through analysis and computer simulations addressing diverse traffic scenarios.
Keywords :
packet switching; queueing theory; scheduling; telecommunication traffic; crosspoint switches; distributed sequential allocation; global channel availability; high port density switching platforms; multiple cells; nonuniform destination distribution; packet scheduling algorithms; relaxed switching time requirement; robust scheduling algorithm; scalable input-queued switches; switch fabric; synchronized channel reservation cycle; Algorithm design and analysis; Availability; Bandwidth; Fabrics; Packet switching; Performance analysis; Robustness; Scheduling algorithm; Switches; Traffic control;
Conference_Titel :
Communications, 2003. ICC '03. IEEE International Conference on
Print_ISBN :
0-7803-7802-4
DOI :
10.1109/ICC.2003.1204244