Queue length based fair queueing in core-stateless networks

DOI10.1007/3-540-45508-6_14MaRDI QIDQ4473816zbMATH OpenFDO

Authors Mingyu Zhai, G. Q. Gu, Yuan Yuan

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2216/22160193.htm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computing methodologies and applications (68U99)

Recommendations

• Improvements to core stateless fair queueing
• Rainbow fair queueing: theory and applications
• A stateless active queue management scheme for approximating fair bandwidth allocation and stabilized buffer occupation
• Beyond CHOKe: Stateless Fair Queueing
• How fair is fair queuing

Cited in

(6)

• The incremental deployability of core-stateless fair queuing
• Beyond CHOKe: Stateless Fair Queueing
• A control-theoretical approach for fair share computation in core-stateless networks
• A stateless active queue management scheme for approximating fair bandwidth allocation and stabilized buffer occupation
• Improvements to core stateless fair queueing
• Rainbow fair queueing: theory and applications

This page was built for publication: Queue length based fair queueing in core-stateless networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473816)