Sample path methods in the control of queues
From MaRDI portal
Publication:1923637
DOI10.1007/BF01149166zbMATH Open0855.60094MaRDI QIDQ1923637FDOQ1923637
Authors: Zhen Liu, Don Towsley, Philippe Nain 
Publication date: 14 January 1997
Published in: Queueing Systems (Search for Journal in Brave)
Recommendations
controlqueueing systemschedulingdiscrete event systemstochastic comparisonsample path argumentsmathematical formalism
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Markov and semi-Markov decision processes (90C40)
Cites Work
- Title not available (Why is that?)
- Extensions of the multiarmed bandit problem: The discounted case
- Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal
- The cμ rule revisited
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A simple dynamic routing problem
- On the optimal assignment of customers to parallel servers
- A new ordering for stochastic majorization: theory and applications
- Optimality of the shortest line discipline
- Optimality of the round-robin routing policy
- K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
- Optimality of routing and servicing in dependent parallel processing systems
- Branching Bandit Processes
- On the Optimality of the Generalized Shortest Queue Policy
- Deciding Which Queue to Join: Some Counterexamples
- Time-Sharing Service Systems. I
- Optimal load balancing on distributed homogeneous unreliable processors
- On optimal polling policies
- Technical Note—An Inequality for the Variance of Waiting Time under a General Queuing Discipline
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interchange arguments in stochastic scheduling
- Optimal scheduling in a machine with stochastic varying processing rate
- Interchange arguments for classical scheduling problems in queues
- Optimal routing and buffer allocation for a class of finite capacity queueing systems
- Rearrangement Inequalities
- Extremal scheduling of parallel processing with and without real-time constraints
- On the duality between routing and scheduling systems with finite buffer space
- The µc-rule is not optimal in the second node of the tandem queue: a counterexample
- An extremal property of FIFO discipline in G/IFR/1 queues
- A new proof of finite moment conditions for GI/G/1 busy periods
- Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplines
- Effects of service disciplines in \(G/GI/s\) queueing systems
- Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates
- Sample Path Criteria for Weak Majorization
- Routing with limited state information in queueing systems with blocking
- Comparisons of service disciplines in a tandem queueing network with real time constraints
- Stochastic Scheduling in in-Forest Networks
Cited In (12)
- Erlang arrivals joining the shorter queue
- Perfect sampling of GI/GI/\(c\) queues
- Job assignment in large-scale service systems with affinity relations
- Title not available (Why is that?)
- Partial flexibility in routeing and scheduling
- Optimal threshold policies in a two-class preemptive priority queue with admission and termination control
- Dynamic admission control for loss systems with batch arrivals
- Monotonicity properties for multi-class queueing systems
- Sample path properties of the G/D/\(m\) queue
- An overview for Markov decision processes in queues and networks
- Scheduling in a multi-class series of queues with deterministic service times
- On the optimality of the earliest due date rule in stochastic scheduling and in queueing
This page was built for publication: Sample path methods in the control of queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923637)
