Related papers: Minimizing the externalities variance in a LCFS-PR…
We study network revenue management problems motivated by applications such as railway ticket sales and hotel room bookings. Requests, each requiring a resource for a consecutive stay, arrive sequentially with known arrival probabilities.…
This paper considers a parallel system of queues fed by independent arrival streams, where the service rate of each queue depends on the number of customers in all of the queues. Necessary and sufficient conditions for the stability of the…
This article deals with asynchronous server vacation and customer retrial facility in a multi-server queueing-inventory system. The Poisson process governs the arrival of a customer. The system is comprised of c identical servers, a…
We consider $M/G/\infty$ queues with gated service and obtain results on the distribution of the stage length and the number of customers served in a stage when the system is stationary. The stage length density is expressed as an infinite…
We study a multiclass M/M/1 queueing control problem with finite buffers under heavy-traffic where the decision maker is uncertain about the rates of arrivals and service of the system and by scheduling and admission/rejection decisions…
Motivated by timeouts in Internet services, we consider networks of infinite server queues in which routing decisions are based on deadlines. Specifically, at each node in the network, the total service time equals the minimum of several…
The discrete time queueing system is highly applicable to modern telecommunication systems, where it provides adaptive packet handling, congestion controlled security/inspection, energy efficient operation, and supports bursty traffic…
In this paper we propose primal-dual algorithms for different variants of the online resource allocation problem with departures. In the basic variant, requests (items) arrive over time to a set of resources (knapsacks) and upon arrival,…
In this contribution, we establish a model for multichannel cognitive radio networks (CRNs) using the theory of priority queues. This model enables us to conduct a performance analysis in the most general form by the derivation of the…
We consider the $M/G/1$ queue with a processor sharing server. We study the conditional sojourn time distribution, conditioned on the customer's service requirement, as well as the unconditional distribution, in various asymptotic limits.…
We consider a Markovian single server queue in which customers are preemptively scheduled by exogenously assigned priority levels. The novelty in our model is that the priority levels are randomly assigned from a continuous probability…
The single server queue with multiple customer types and semi-Markovian service times, sometimes referred to as the $M/SM/1$ queue, has been well-studied since its introduction by Neuts in 1966. In this paper, we apply an extension of this…
A "scheduled" arrival process is one in which the n th arrival is scheduled for time n, but instead occurs at a different time. The difference between the scheduled time and the arrival time is called the perturbation. The sequence of…
This paper considers the problem of obtaining bounded time-average expected queue sizes in a single-queue system with a partial-feedback structure. Time is slotted; in slot $t$ the transmitter chooses a rate $V(t)$ from a continuous…
We consider the coflow scheduling problem in the non-clairvoyant setting, assuming that flow sizes are realized on-line according to given probability distributions. The goal is to minimize the weighted average completion time of coflows in…
A classical problem in appointment scheduling, with applications in health care, concerns the determination of the patients' arrival times that minimize a cost function that is a weighted sum of mean waiting times and mean idle times. One…
In this paper we consider a single-server polling system with switch-over times. We introduce a new service discipline, mixed gated/exhaustive service, that can be used for queues with two types of customers: high and low priority…
We consider an extension of the classical machine-repair model, where we assume that the machines, apart from receiving service from the repairman, also serve queues of products. The extended model can be viewed as a layered queueing…
In this paper we study the maximum queue length $M$ (in terms of the number of customers present) in a busy cycle in the M/G/1 queue. Assume that the service times have a logconvex density. For such (heavy-tailed) service-time distributions…
The supermarket model refers to a system with a large number of queues, where new customers choose d queues at random and join the one with the fewest customers. This model demonstrates the power of even small amounts of choice, as compared…