The incremental deployability of core-stateless fair queuing

DOI10.1007/3-540-47734-9_26MaRDI QIDQ2777249zbMATH OpenFDO

Authors Yannick Blanpain, Hung-Yun Hsieh, Raghupathy Sivakumar

Publication date 7 March 2002

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/2094/20940259

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies and applications (68U99)

Recommendations

• Improvements to core stateless fair queueing
• Rainbow fair queueing: theory and applications
• Stateless core: A scalable approach for quality of service in the internet. Wining thesis of the 2001 ACM doctoral dissertation competition.
• Queue length based fair queueing in core-stateless networks
• A control-theoretical approach for fair share computation in core-stateless networks

Cited in

(2)

• Guaranteeing Fair Service to Persistent Dependent Tasks
• Improvements to core stateless fair queueing

This page was built for publication: The incremental deployability of core-stateless fair queuing

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