Improvements to core stateless fair queueing

DOI10.1007/3-540-47828-0_11MaRDI QIDQ4739268zbMATH OpenFDO

Authors Cristel Pelsser, Stefaan de Cnodder

Publication date 12 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/2334/23340164.htm

Mathematics Subject Classification ID

Network protocols (68M12) Computing methodologies and applications (68U99)

Recommendations

• The incremental deployability of core-stateless fair queuing
• Queue length based fair queueing in core-stateless networks
• 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.
• A control-theoretical approach for fair share computation in core-stateless networks

Cited in

(5)

• The incremental deployability of core-stateless fair queuing
• Providing deterministic end-to-end fairness guarantees in core-stateless networks
• Queue length based fair queueing in core-stateless networks
• A core-stateless utility based rate allocation framework
• Rainbow fair queueing: theory and applications

This page was built for publication: Improvements to core stateless fair queueing

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