Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleOctober 2020
A survey on skill-based routing with applications to service operations management
Queueing Systems: Theory and Applications (QSYS), Volume 96, Issue 1-2Pages 53–82https://doi.org/10.1007/s11134-020-09669-5AbstractService systems often feature multiple classes of customers with different service needs and multiple pools of servers with different skillsets. How to efficiently match customers of different classes with servers of different skillsets is of ...
- research-articleOctober 2019
Redundancy scheduling with scaled Bernoulli service requirements
Queueing Systems: Theory and Applications (QSYS), Volume 93, Issue 1-2Pages 67–82https://doi.org/10.1007/s11134-019-09621-2AbstractRedundancy scheduling has emerged as a powerful strategy for improving response times in parallel-server systems. The key feature in redundancy scheduling is replication of a job upon arrival by dispatching replicas to different servers. Redundant ...
-
- articleAugust 2016
Whittle index approach to size-aware scheduling for time-varying channels with multiple states
Queueing Systems: Theory and Applications (QSYS), Volume 83, Issue 3-4Pages 195–225https://doi.org/10.1007/s11134-016-9484-zWe consider the optimal opportunistic scheduling problem for downlink data traffic in a wireless cell with time-varying channels. The scheduler itself operates at a very fast time scale of milliseconds, but the objective function is related to ...
- articleAugust 2015
Wireless scheduling with partial channel state information: large deviations and optimality
Queueing Systems: Theory and Applications (QSYS), Volume 80, Issue 4Pages 293–340https://doi.org/10.1007/s11134-015-9439-9We consider a server serving a time-slotted queued system of multiple packet-based flows, where not more than one flow can be serviced in a single time slot. The flows have exogenous packet arrivals and time-varying service rates. At each time, the ...
- articleMarch 2013
The single-server scheduling problem with convex costs
Queueing Systems: Theory and Applications (QSYS), Volume 73, Issue 3Pages 261–294https://doi.org/10.1007/s11134-012-9316-8Being probably one of the oldest decision problems in queuing theory, the single-server scheduling problem continues to be a challenging one. The original formulations considered linear costs, and the resulting policy is puzzling in many ways. The main ...
- articleJune 2012
Queueing systems with hard delay constraints: a framework for real-time communication over unreliable wireless channels
Queueing Systems: Theory and Applications (QSYS), Volume 71, Issue 1-2Pages 151–177https://doi.org/10.1007/s11134-012-9293-yWe provide an account of recent work that formulates and addresses problems that arise when employing wireless networks to serve clients that generate real-time flows. From a queueing systems perspective, these problems can be described as single-server ...
- articleDecember 2011
Stability with file arrivals and departures in multichannel cellular wireless networks
Queueing Systems: Theory and Applications (QSYS), Volume 69, Issue 3-4Pages 259–291https://doi.org/10.1007/s11134-011-9262-xThis paper studies scheduling in multichannel wireless networks with flow-level dynamics. We consider a downlink network with a single base station, M channels (frequency bands), and multiple mobile users (flows). We also assume mobiles dynamically join ...
- articleDecember 2008
Sojourn times in (discrete) time shared systems and their continuous time limits
Queueing Systems: Theory and Applications (QSYS), Volume 60, Issue 3-4Pages 171–191https://doi.org/10.1007/s11134-008-9092-7We study the mean sojourn times in two M/G/1 weighted round-robin systems: the weight of a customer at any given point in time in the first system is a function of its age (imparted service), while in the second system the weight is a function of the ...
- articleOctober 2008
Loss bounds for a finite-capacity queue based on interval-wise traffic observation
Queueing Systems: Theory and Applications (QSYS), Volume 60, Issue 1-2Pages 153–170https://doi.org/10.1007/s11134-008-9091-8We study a single-server finite-capacity queue with batch fluid inputs. We assume that the input traffic is observed in an interval-wise basis; that is, along the time axis divided into fixed-length intervals, with the amount of work brought into the ...
- articleOctober 2008
Dynamic scheduling for switched processing systems with substantial service-mode switching times
Queueing Systems: Theory and Applications (QSYS), Volume 60, Issue 1-2Pages 87–109https://doi.org/10.1007/s11134-008-9088-3Switched Processing Systems (SPS) represent canonical models for many communication and computer systems. Over the years, much research has been devoted to developing the best scheduling policies to optimize the various performance metrics of interest. ...
- articleAugust 2008
Waiting times for M/M systems under state-dependent processor sharing
Queueing Systems: Theory and Applications (QSYS), Volume 59, Issue 3-4Pages 297–319https://doi.org/10.1007/s11134-008-9086-5We consider a system where the arrivals form a Poisson process and the required service times of the requests are exponentially distributed. The requests are served according to the state-dependent (Cohen's generalized) processor sharing discipline, ...
- articleAugust 2008
Exit problems for the difference of a compound Poisson process and a compound renewal process
Queueing Systems: Theory and Applications (QSYS), Volume 59, Issue 3-4Pages 271–296https://doi.org/10.1007/s11134-008-9084-7In this paper we solve a two-sided exit problem for a difference of a compound Poisson process and a compound renewal process. More specifically, we determine the Laplace transforms of the joint distribution of the first exit time, the value of the ...
- articleAugust 2008
Optimal balking strategies and pricing for the single server Markovian queue with compartmented waiting space
Queueing Systems: Theory and Applications (QSYS), Volume 59, Issue 3-4Pages 237–269https://doi.org/10.1007/s11134-008-9083-8We consider the single server Markovian queue and we assume that arriving customers decide whether to enter the system or balk based on a natural reward-cost structure, which incorporates their desire for service as well as their unwillingness to wait.
...
- articleAugust 2008
A note on the event horizon for a processor sharing queue
Queueing Systems: Theory and Applications (QSYS), Volume 59, Issue 3-4Pages 185–190https://doi.org/10.1007/s11134-008-9081-xIn this note we identify a phenomenon for processor sharing queues that is unique to ones with time-varying rates. This property was discovered while correcting a proof in Hampshire, Harchol-Balter and Massey (Queueing Syst. 53(1---2), 19---30, 2006). ...
- articleMay 2008
On Kelly networks with shuffling
Queueing Systems: Theory and Applications (QSYS), Volume 59, Issue 1Pages 53–61https://doi.org/10.1007/s11134-008-9075-8We consider Kelly networks with shuffling of customers within each queue. Specifically, each arrival, departure or movement of a customer from one queue to another triggers a shuffle of the other customers at each queue. The shuffle distribution may ...
- articleMay 2008
Large Deviations of Queues Sharing a Randomly Time-Varying Server
Queueing Systems: Theory and Applications (QSYS), Volume 59, Issue 1Pages 1–35https://doi.org/10.1007/s11134-008-9072-yWe consider a discrete-time model where multiple queues, each with its own exogenous arrival process, are served by a server whose capacity varies randomly and asynchronously with respect to different queues. This model is primarily motivated by the ...
- articleApril 2008
Reduction of a polling network to a single node
Queueing Systems: Theory and Applications (QSYS), Volume 58, Issue 4Pages 303–319https://doi.org/10.1007/s11134-008-9071-zWe consider a discrete-time tree network of polling servers where all packets are routed to the same node (called node 0), from which they leave the network. All packets have unit size and arrive from the exterior according to independent batch ...