Competitive queue policies for differentiated services

DOI10.1016/J.JALGOR.2004.04.004MaRDI QIDQ3022750zbMATH OpenOpenAlexWikidataFDO

Authors Yishay Mansour, S. Rajagopolan, Adi Rosén, William Aiello

Publication date 30 June 2005

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2004.04.004

zbMATH Keywords

FIFO queue

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2079410
• scientific article; zbMATH DE number 1717155
• Relative priority policies for minimizing the cost of queueing systems with service discrimination
• Service Competition with General Queueing Facilities
• Comparison of Policies for Routing Customers to Parallel Queueing Systems
• Competitive analysis of constrained queueing systems
• A closed queueing network with strategic service differentiation
• Pricing, routing, and incentive compatibility in multiserver queues
• Service-level differentiation in many-server service systems via queue-ratio routing

Cited in

(28)

• Lower and upper bounds on FIFO buffer management in QoS switches
• Comparison-based buffer management in QoS switches
• Harmonic buffer management policy for shared memory switches
• Admission control in shared memory switches
• The impact of processing order on performance: a taxonomy of semi-FIFO policies
• Maximizing throughput in multi-queue switches
• Scheduling with deadlines and buffer management with processing requirements
• Online competitive algorithms for maximizing weighted throughput of unit jobs
• Online scheduling FIFO policies with admission and push-out
• The loss of serving in the dark
• scientific article; zbMATH DE number 1717155 (Why is no real title available?)
• Optimal buffer management for 2-frame throughput maximization
• Tight Analysis of Priority Queuing for Egress Traffic
• Buffer management for packets with processing times
• Essential traffic parameters for shared memory switch performance
• Better bounds for online \(k\)-frame throughput maximization in network switches
• Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
• Competitive buffer management with packet dependencies
• Loss-bounded analysis for differentiated services
• scientific article; zbMATH DE number 2079410 (Why is no real title available?)
• An optimal lower bound for buffer management in multi-queue switches
• Differentiating Services with Noncongestive Queuing (NCQ)
• A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines
• Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms
• Competitive management of non-preemptive queues with multiple values
• An optimal algorithm for 2-bounded delay buffer management with lookahead
• Buffer management for colored packets with deadlines
• An experimental study of new and known online packet buffering algorithms

This page was built for publication: Competitive queue policies for differentiated services

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