Congestion-dependent pricing of network services

IC Paschalidis, JN Tsitsiklis - IEEE/ACM transactions on …, 2000 - ieeexplore.ieee.org
We consider a service provider (SP) who provides access to a communication network or
some other form of on-line services. Users initiate calls that belong to a set of diverse service …

Delay-optimal opportunistic scheduling and approximations: The log rule

B Sadiq, SJ Baek, G De Veciana - IEEE/ACM transactions on …, 2010 - ieeexplore.ieee.org
This paper considers the design of multiuser opportunistic packet schedulers for users
sharing a time-varying wireless channel from performance and robustness points of view …

Effective bandwidths with priorities

AW Berger, W Whitt - IEEE/ACM Transactions on networking, 1998 - ieeexplore.ieee.org
The notion of effective bandwidths has provided a useful practical framework for connection
admission control and capacity planning in high-speed communication networks. The …

Effective capacity and QoS for wireless scheduling

S Shakkottai - IEEE Transactions on Automatic Control, 2008 - ieeexplore.ieee.org
Multiuser scheduling in a wireless context, where channel state information is exploited at
the base station, can result in significant throughput gains to users. However, when QoS …

A large deviations analysis of scheduling in wireless networks

L Ying, R Srikant, A Eryilmaz… - IEEE Transactions on …, 2006 - ieeexplore.ieee.org
In this correspondence, we consider a cellular network consisting of a base station and N
receivers. The channel states of the receivers are assumed to be identical and independent …

Probabilistic service level guarantees in make-to-stock manufacturing systems

D Bertsimas, IC Paschalidis - Operations Research, 2001 - pubsonline.informs.org
We consider a model of a multiclass make-to-stock manufacturing system. External demand
for each product class is met from the available finished goods inventory; unsatisfied …

Large deviations analysis of the generalized processor sharing policy

D Bertsimas, IC Paschalidis, JN Tsitsiklis - Queueing Systems, 1999 - Springer
In this paper we consider a stochastic server (modeling a multiclass communication switch)
fed by a set of parallel buffers. The dynamics of the system evolve in discrete-time and the …

On wireless scheduling algorithms for minimizing the queue-overflow probability

VJ Venkataramanan, X Lin - IEEE/ACM Transactions on …, 2010 - ieeexplore.ieee.org
In this paper, we are interested in wireless scheduling algorithms for the downlink of a single
cell that can minimize the queue-overflow probability. Specifically, in a large-deviation …

Due-date scheduling: Asymptotic optimality of generalized longest queue and generalized largest delay rules

JA Van Mieghem - Operations Research, 2003 - pubsonline.informs.org
Consider the following due-date scheduling problem in a multiclass, acyclic, single-station
service system: Any class k job arriving at time t must be served by its due date t+ Dk …

A large deviation principle with queueing applications

AJ Ganesh, N O'Connell - Stochastics and Stochastic Reports, 2002 - Taylor & Francis
In this paper, we present a large deviation principle for partial sums processes indexed by
the half line, which is particularly suited to queueing applications. The large deviation …