Parallel shared memory (PSM) routers represent an architectural approach for addressing the high memory bandwidth requirements dictated by output-queued switches. A fundamental related challenge pertains to the design of the high-speed memory management algorithm which is responsible for placing arriving packets into nonconflicting memories. In previous work, we have extended PSM results by introducing the concept of Fabric on a Chip (FoC). The latter advocates the consolidation of core packet switching functions on a single chip. This paper further develops the underlying technology for high-capacity FoC designs by incorporating a speedup factor coupled with a multiple packet placement process. This yields a substantial reduction in the overall memory requirements, paving the way for the implementation of large scale FoCs. We further provide analysis for establishing an upper bound on the sufficient number of memories along with a description of an 80Gbps switch implementation on an Altera Stratix II FPGA.
[1]
Nick McKeown,et al.
The iSLIP scheduling algorithm for input-queued switches
,
1999,
TNET.
[2]
George Varghese,et al.
Efficient fair queueing using deficit round robin
,
1995,
SIGCOMM '95.
[3]
Rui Zhang,et al.
Routers with a single stage of buffering
,
2002,
SIGCOMM 2002.
[4]
Y. Tamir,et al.
High-performance multi-queue buffers for VLSI communications switches
,
1988,
ISCA '88.
[5]
Adnan Aziz,et al.
Randomized parallel schedulers for switch-memory-switch routers: analysis and numerical studies
,
2004,
IEEE INFOCOM 2004.
[6]
Adnan Aziz,et al.
A near optimal scheduler for switch-memory-switch routers
,
2003,
SPAA '03.
[7]
Itamar Elhanany,et al.
Fabric on a Chip: Towards Consolidating Packet Switching Functions on Silicon
,
2006,
2006 IEEE International Conference on Communications.