Abstract— Output queued switches are appealing because they have better latency and throughput th... more Abstract— Output queued switches are appealing because they have better latency and throughput than input queued switches. However, they are difficult to build: a direct implementation of an N,N output-queued switch requires the switching fabric and the packet memories at the outputs to run at N times the line rate. Attempts have been made to implement output queuing with slow
Page 1. A reconfigurable architecture and associated synthesis methodology for high speed packet ... more Page 1. A reconfigurable architecture and associated synthesis methodology for high speed packet classification Amit Prakash Ramakrishna Kotla Tanmoy Mandal Adnan Aziz Department of Electrical and Computer Engineering ...
A traffic matrix is an |S| times |T| matrix M, where Mij is a non-negative integer encoding the n... more A traffic matrix is an |S| times |T| matrix M, where Mij is a non-negative integer encoding the number of packets to be transferred from source i to sink j. Chang et al. (2001) have shown how to efficiently compute an optimum schedule for transferring packets from sources to sinks when the sources and sinks are connected via a rearrangeable fabric such as crossbar. We address the same problem when the switch fabric is not rearrangeable. Specifically, we (1) prove that the optimum scheduling problem is NP-hard for general switch fabrics, (2) identify a sub-class of fabrics for which the problem is polynomial-time solvable, and (3) develop a heuristic for the general case
Abstract— Output queued switches are appealing because they have better latency and throughput th... more Abstract— Output queued switches are appealing because they have better latency and throughput than input queued switches. However, they are difficult to build: a direct implementation of an N,N output-queued switch requires the switching fabric and the packet memories at the outputs to run at N times the line rate. Attempts have been made to implement output queuing with slow
Page 1. A reconfigurable architecture and associated synthesis methodology for high speed packet ... more Page 1. A reconfigurable architecture and associated synthesis methodology for high speed packet classification Amit Prakash Ramakrishna Kotla Tanmoy Mandal Adnan Aziz Department of Electrical and Computer Engineering ...
A traffic matrix is an |S| times |T| matrix M, where Mij is a non-negative integer encoding the n... more A traffic matrix is an |S| times |T| matrix M, where Mij is a non-negative integer encoding the number of packets to be transferred from source i to sink j. Chang et al. (2001) have shown how to efficiently compute an optimum schedule for transferring packets from sources to sinks when the sources and sinks are connected via a rearrangeable fabric such as crossbar. We address the same problem when the switch fabric is not rearrangeable. Specifically, we (1) prove that the optimum scheduling problem is NP-hard for general switch fabrics, (2) identify a sub-class of fabrics for which the problem is polynomial-time solvable, and (3) develop a heuristic for the general case
Uploads
Papers by Amit Prakash