Congestion-dependent pricing of network services
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 …
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
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 …
sharing a time-varying wireless channel from performance and robustness points of view …
Effective bandwidths with priorities
The notion of effective bandwidths has provided a useful practical framework for connection
admission control and capacity planning in high-speed communication networks. The …
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 …
the base station, can result in significant throughput gains to users. However, when QoS …
A large deviations analysis of scheduling in wireless networks
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 …
receivers. The channel states of the receivers are assumed to be identical and independent …
Probabilistic service level guarantees in make-to-stock manufacturing systems
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 …
for each product class is met from the available finished goods inventory; unsatisfied …
Large deviations analysis of the generalized processor sharing policy
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 …
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
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 …
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 …
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
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 …
the half line, which is particularly suited to queueing applications. The large deviation …