DocumentCode
3598938
Title
Design and evaluation of a parallel-polled virtual output queued switch
Author
Christensen, K.J.
Author_Institution
Dept. of Comput. Sci. & Eng., Univ. of South Florida, Tampa, FL, USA
Volume
1
fYear
2001
Firstpage
112
Abstract
Input-buffered switches with virtual output queueing require crossbar switch matrix scheduling algorithms. Existing scheduling algorithms are non-deterministic and are based on parallel and iterative request-grant-accept arbitration schemes. This presents challenges to flow-level scheduling for guaranteed throughput and bounded delay services and also to scalability. In this paper, the parallel-polled virtual output queued (PP-VOQ) switch is presented. Using parallel token passing, the PP-VOQ switch has deterministic and bounded scheduling delay and is implementable for 16 or 32 ports of 10-Gigabit Ethernet. The PP-VOQ switch is shown, via simulation, to perform very similar to an iSLIP switch. The PP-VOQ switch is extended to a “cube switch” design that decouples input port VOQ selection from output port selection to reduce the scheduling delay and improve scalability. This decoupled parallel polling is very scalable and is shown to result in better performance than an iSLIP switch
Keywords
buffer storage; delays; local area networks; packet switching; parallel architectures; protocols; queueing theory; 10 Gbit/s; Ethernet; PP-VOQ switch; bounded scheduling delay; crossbar switch matrix scheduling algorithms; cube switch design; decoupled parallel polling; deterministic scheduling delay; flow-level scheduling; guaranteed bounded delay services; guaranteed throughput services; iSLIP switch; input port VOQ selection; input-buffered switches; iterative request-grant-accept arbitration; nondeterministic algorithm; output port selection; parallel request-grant-accept arbitration; parallel token passing; parallel-polled virtual output queued switch; scalability; scheduling delay reduction; simulation; Computer science; Delay; Ethernet networks; Packet switching; Quality of service; Scalability; Scheduling algorithm; Stability; Switches; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2001. ICC 2001. IEEE International Conference on
Print_ISBN
0-7803-7097-1
Type
conf
DOI
10.1109/ICC.2001.936284
Filename
936284
Link To Document