Intra-flow fairness in work-conserving flow aggregation

MaRDI QIDQ3619396zbMATH OpenFDO

Authors Jorge A. Cobb, Zhe Xu

Publication date 3 April 2009

zbMATH Keywords

flow aggregationquality of servicereal-time scheduling

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• scientific article; zbMATH DE number 1617280
• Suppressing Maximum Burst Size Throughout the Path with Non-work Conserving Schedulers
• scientific article; zbMATH DE number 1717152
• Estimating aggregate resource reservation for dynamic, scalable, and fair distribution of bandwidth
• Tight arrival curve at the output of a work-conserving blind multiplexing server

Cited in

(6)

• scientific article; zbMATH DE number 1617280 (Why is no real title available?)
• scientific article; zbMATH DE number 1717152 (Why is no real title available?)
• Tight arrival curve at the output of a work-conserving blind multiplexing server
• scientific article; zbMATH DE number 2043506 (Why is no real title available?)
• scientific article; zbMATH DE number 2043507 (Why is no real title available?)
• Suppressing Maximum Burst Size Throughout the Path with Non-work Conserving Schedulers

This page was built for publication: Intra-flow fairness in work-conserving flow aggregation

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