Restless bandit marginal productivity indices II: multiproject case and scheduling a multiclass make-to-order/-stock M/G/1 queue [PDF]
, 2004 This paper develops a framework based on convex optimization and economic ideas to formulate and solve approximately a rich class of dynamic and stochastic resource allocation problems, fitting in a generic discrete-state multi-project restless bandit ...
Niño Mora, José
core
Heavy-Traffic Analysis of the M/G/1 Queue With Priority Classes [PDF]
AMS classifications: 60K25, 90B22.M=G=1 queue;priority;heavy-tailed service time distribution;regular variation;waiting time distribution;heavy-traffic limit theorem;heavy-traffic ...
Boxma, O.J., Cohen, J.W., Deng, Q.
core +1 more source
Necessary condition for null controllability in many-server heavy traffic
, 2015 Throughput sub-optimality (TSO), introduced in Atar and Shaikhet [Ann. Appl. Probab. 19 (2009) 521-555] for static fluid models of parallel queueing networks, corresponds to the existence of a resource allocation, under which the total service rate ...
Shaikhet, Gennady
core +1 more source
Performance analysis of downlink shared channels in a UMTS network [PDF]
, 2002 In light of the expected growth in wireless data communications and the commonly anticipated up/downlink asymmetry, we present a performance analysis of downlink data transfer over \textsc{d}ownlink \textsc{s}hared \textsc{ch}annels (\textsc{dsch}s ...
Boucherie, R.J., Litjens, R.
core +1 more source
Wait-and-see strategies in polling models [PDF]
, 2010 We consider a general polling model with $N$ stations. The stations are served exhaustively and in cyclic order. Once a station queue falls empty, the server does not immediately switch to the next station.
Aurzada, Frank +2 more
core
Stabilization of an overloaded queueing network using measurement-based admission control
, 2006 Admission control can be employed to avoid congestion in queueing networks subject to overload. In distributed networks the admission decisions are often based on imperfect measurements on the network state.
Asmussen, Lasse Leskelä, Neuts
core +1 more source
Diffusion limit of a modified Erlang-B system with sensing time of secondary users. [PDF]
Ann Oper Res, 2022 Abe K, Phung-Duc T.
europepmc +1 more source
Invariance of fluid limits for the Shortest Remaining Processing Time and Shortest Job First policies [PDF]
, 2010 We consider a single-server queue with renewal arrivals and i.i.d. service times, in which the server employs either the preemptive Shortest Remaining Processing Time (SRPT) policy, or its non-preemptive variant, Shortest Job First (SJF).
Gromoll, H. Christian, Keutel, Martin
core
Heavy traffic limits for queues with non-stationary path-dependent arrival processes. [PDF]
Queueing Syst, 2022 Fendick K, Whitt W.
europepmc +1 more source
An M/PH/1 queue with workload-dependent processing speed and vacations. [PDF]
Queueing Syst, 2021 Sakuma Y, Boxma O, Phung-Duc T.
europepmc +1 more source