BSFQ: Bin sort fair queueing

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 2002, Pages 1640-1649

  Cheung, Shun Y ^a   Pencea, Corneliu S ^a  

^a EMORY UNIVERSITY   (United States)

Author keywords

BSFQ; Delay guarantee; Fairness guarantee; Quality of service; WFQ

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); PACKET NETWORKS; QUALITY OF SERVICE; SCHEDULING; TELECOMMUNICATION TRAFFIC;

BIN SORT FAIR QUEUEING; DEFICIT ROUND ROBIN METHOD; END TO END DELAYS; FAIRNESS GUARANTEE; NONCONFORMANT TRAFFIC; PACKET SCHEDULING ALGORITHMS; WEIGHTED FAIR QUEUEING;

QUEUEING NETWORKS;

EID: 0036349366     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. A generalized processor sharing approach to flow control in integrated services networks: The single node case
2. WF2Q: Worst-case fair weighted fair queueing
3. Service disciplines for guaranteed performance service in packet-switching networks
4. Rate-proportional servers: A design methodology for fair queueing algorithms
5. Virtual clock: A new traffic control algorithm for packet switching networks
6. A self-clocked fair queueing scheme for broadband applications
7. Leap forward virtual clock: A new fair queueing scheme with guaranteed delays and throughput fairness
8. Efficient fair queueing using deficit round robin
9. Efficient fair queueing for ATM networks using uniform round robin
10. Delay guarantee of virtual clock server
11. Determining end-to-end delay bounds in heterogeneous networks
12. Probability metrics and the stability of stochastic models
13. Pipelined sections: A new buffer management discipline for scalable QoS provision