Intra-flow fairness in work-conserving flow aggregation

zbMATH Open1157.68305MaRDI QIDQ3619396FDOQ3619396

Authors: Jorge A. Cobb, Zhe Xu 

Publication date: 3 April 2009

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

zbMATH Keywords

real-time schedulingquality of serviceflow aggregation

Mathematics Subject Classification ID

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

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Suppressing Maximum Burst Size Throughout the Path with Non-work Conserving Schedulers
• Tight arrival curve at the output of a work-conserving blind multiplexing server
• Title not available (Why is that?)
• Title not available (Why is that?)

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)