Pipelined heap (priority queue) management for advanced scheduling in high-speed networks

IEEE International Conference on Communications

Volumn 7, Issue , 2001, Pages 2043-2047

  Ioannou, A ^a   Katevenis, M ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Greece)

Author keywords

High speed network scheduling; Pipelined hardware heap; Priority queue; Synthesizable core; Weighted fair queueing; Weighted round robin

Indexed keywords

ALGORITHMS; DATA STRUCTURES; PACKET NETWORKS; QUALITY OF SERVICE; ROUTERS; SCHEDULING; SWITCHING;

PIPELINED HEAP MANAGEMENT; SCHEDULING ALGORITHNMS;

QUEUEING NETWORKS;

EID: 0034857343     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Hierarchical packet fair queueing algorithms
2. Fast and scalable priority queue architecture for high-speed network switches
3. Calendar queues: A fast O(1) priority queue implementation for the simulation event set problem
4. A novel architecture for queue management in the ATM network
5. Design of packet-fair queueing schedulers using a RAM-based searching engine
6. An empirical comparison of priority-queue and event-set implementations
7. Fast switching and fair control of congested flow in broad-band networks
8. Weighted round-robin cell multiplexing in a general-purpose ATM switch chip
9. Multi-queue management and scheduling for improved QoS in communication networks
10. Efficient per-flow queueing in DRAM at OC-192 line rate using out-of-order execution techniques
11. Beyond best effort: Router architectures for the differentiated services of tomorrow's internet
12. Implementing scheduling algorithms in high-speed networks
13. Service disciplines for guaranteed performance in packet switching networks