We present a new input-queued switch architecture designed to support deadline-ordered scheduling at extremely high-speeds. In particular, deadline-ordered scheduling is enabled through a combination of hardware-based sorted priority queues called P-heaps and a round-robin crossbar scheduler. The priority queues are implemented using a novel scalable pipelined heap-based architecture. Using a 0.35 micron CMOS standard-cell technology, we demonstrate a 32-port switch capable of sustaining 10 Gb/s line rates
Abstract-- High performance packet switches frequently use a centralized scheduler (also known as an...
This dissertation deals with the design of scheduling algorithms for high-speed switches. The analys...
Abstract—Internet traffic has increased at a very fast pace in recent years. The traffic demand requ...
Switches today provide a small menu of scheduling algorithms. While we can tweak scheduling paramete...
The need for better quality of service is growing as new quality sensitive services are becoming mor...
Modern integrated networks can support the diverse quality-of-service requirements of current and em...
Abstract—To support the Internet’s explosive growth and expansion into a true integrated services ne...
Crossbars are frequently used as the switching fabric for high-performance packet switches (IP route...
Abstract—All recently proposed packet-scheduling algorithms for output-buffered switches that suppor...
Packet switching fabrics constitute a fundamental building block of all Internet routers. As a core ...
This thesis presents a number of new approaches for designing fast, scalable queuing structures in ...
As we entered the new millennium, we swiftly moved from an industrial economy into an information ec...
This research investigates packet switching with gigabit-per-second ports for integrated broadband s...
grantor: University of TorontoBroadband integrated services networks should support a wide...
rajk gt ¢ ieee.org ShareStreams (Scalable Hardware Architectures for Stream Schedulers) is a unified...
Abstract-- High performance packet switches frequently use a centralized scheduler (also known as an...
This dissertation deals with the design of scheduling algorithms for high-speed switches. The analys...
Abstract—Internet traffic has increased at a very fast pace in recent years. The traffic demand requ...
Switches today provide a small menu of scheduling algorithms. While we can tweak scheduling paramete...
The need for better quality of service is growing as new quality sensitive services are becoming mor...
Modern integrated networks can support the diverse quality-of-service requirements of current and em...
Abstract—To support the Internet’s explosive growth and expansion into a true integrated services ne...
Crossbars are frequently used as the switching fabric for high-performance packet switches (IP route...
Abstract—All recently proposed packet-scheduling algorithms for output-buffered switches that suppor...
Packet switching fabrics constitute a fundamental building block of all Internet routers. As a core ...
This thesis presents a number of new approaches for designing fast, scalable queuing structures in ...
As we entered the new millennium, we swiftly moved from an industrial economy into an information ec...
This research investigates packet switching with gigabit-per-second ports for integrated broadband s...
grantor: University of TorontoBroadband integrated services networks should support a wide...
rajk gt ¢ ieee.org ShareStreams (Scalable Hardware Architectures for Stream Schedulers) is a unified...
Abstract-- High performance packet switches frequently use a centralized scheduler (also known as an...
This dissertation deals with the design of scheduling algorithms for high-speed switches. The analys...
Abstract—Internet traffic has increased at a very fast pace in recent years. The traffic demand requ...