rajk gt ¢ ieee.org ShareStreams (Scalable Hardware Architectures for Stream Schedulers) is a unified hardware architecture for realizing a range of wire-speed packet scheduling disciplines for output link scheduling. This paper presents opportunities to exploit parallelism, design issues, tradeoffs and evaluation of the FPGA hardware architecture for use in switch network interfaces. The architecture uses processor resources for queueing & data movement and FPGA hardware resources for accelerating decisions and priority updates. The hardware architecture stores state in Register base blocks, stream service attributes are compared using single-cycle decision blocks arranged in a novel single-stage recirculating network. The architecture ...
High-speed ASIC switches hold great promise for offloading complex packet processing pipelines direc...
Abstract—To support the Internet’s explosive growth and expansion into a true integrated services ne...
Summarization: One of the main bottlenecks when designing a network system is very often its memory ...
ShareStreams (Scalable Hardware Architectures for Stream Schedulers) is a canonical architecture f...
We present an architecture and hardware for scheduling gigabit packet streams in server clusters tha...
We present an architecture and hardware for scheduling gigabit packet streams in server clusters th...
Modern integrated networks can support the diverse quality-of-service requirements of current and em...
1) Scheduling of packet streams in real-time (as opposed to virtual-time) is necessary to make class...
Packet switching fabrics constitute a fundamental building block of all Internet routers. As a core ...
A module to provide Quality of Service (QoS) has been developed to perform customizable packet sched...
In this paper we propose an FPGA implementation of a multi protocol Weighted Fair (WF) queuing algor...
Packet processing is the enabling technology of networked information systems such as the Internet ...
We present a new input-queued switch architecture designed to support deadline-ordered scheduling a...
Switches today provide a small menu of scheduling algorithms. While we can tweak scheduling paramete...
The data plane is in a continuous state of flux. Every few months, researchers publish the design of...
High-speed ASIC switches hold great promise for offloading complex packet processing pipelines direc...
Abstract—To support the Internet’s explosive growth and expansion into a true integrated services ne...
Summarization: One of the main bottlenecks when designing a network system is very often its memory ...
ShareStreams (Scalable Hardware Architectures for Stream Schedulers) is a canonical architecture f...
We present an architecture and hardware for scheduling gigabit packet streams in server clusters tha...
We present an architecture and hardware for scheduling gigabit packet streams in server clusters th...
Modern integrated networks can support the diverse quality-of-service requirements of current and em...
1) Scheduling of packet streams in real-time (as opposed to virtual-time) is necessary to make class...
Packet switching fabrics constitute a fundamental building block of all Internet routers. As a core ...
A module to provide Quality of Service (QoS) has been developed to perform customizable packet sched...
In this paper we propose an FPGA implementation of a multi protocol Weighted Fair (WF) queuing algor...
Packet processing is the enabling technology of networked information systems such as the Internet ...
We present a new input-queued switch architecture designed to support deadline-ordered scheduling a...
Switches today provide a small menu of scheduling algorithms. While we can tweak scheduling paramete...
The data plane is in a continuous state of flux. Every few months, researchers publish the design of...
High-speed ASIC switches hold great promise for offloading complex packet processing pipelines direc...
Abstract—To support the Internet’s explosive growth and expansion into a true integrated services ne...
Summarization: One of the main bottlenecks when designing a network system is very often its memory ...