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