Concurrent fair queueing: Fair service for virtual web sites

MaRDI QIDQ2751909zbMATH OpenFDO

Authors J. Fritz Barnes

Publication date 21 October 2001

zbMATH Keywords

concurrent fair queueingweb pages

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

• How fair is fair queuing
• Revisiting unfairness in Web server scheduling
• Fair Queuing and Other Probabilistic Allocation Methods
• Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
• Overload control in QoS-aware web servers.

Cited in

(8)

• Preferential treatment for short flows to reduce web latency.
• Overload control in QoS-aware web servers.
• RFQ: Redemptive Fair Queuing
• How fair is fair queuing
• scientific article; zbMATH DE number 1969717 (Why is no real title available?)
• Euro-Par 2004 Parallel Processing
• Revisiting unfairness in Web server scheduling
• Interactivity vs. fairness in networked Linux systems

This page was built for publication: Concurrent fair queueing: Fair service for virtual web sites

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