Search
Now showing items 1-10 of 88
Parameter Estimation under Threshold Policies for a Simple Flow Control Problem.
(1987)
In [5], the authors showed that threshold policies solve an optimal flow control problem for discrete-time M|M|1 queues, where the decision-maker seeks to maximize the system throughput subject to a bound on the long-run ...
An Optimal Scheme for Two Competing Queues with Constraints.
(1985)
Two types of traffic, e.g., voice and data, share a single synchronous and noisy communication channel. This situation is modeled as a system of two discrete-time queues with geometric service requirements which compete ...
Resequencing delays under multipath routing -- Asymptotics in a simple queueing model
(2005)
We study the resequencing delay caused by multipath routing. We use a queueing model which consists of parallel queues to model the network routing behavior. We define a new metric denoted by $gamma$, to study the impact ...
Convergence Properties For Uniform Ant Routing
(2003)
We study the convergence property of a family of distributed routingalgorithms based on the ant colony metaphor, which generalize the uniform ant routing algorithms proposed earlier. For a simple two-node network, we show ...
Queue Dynamics of RED Gateways under Large Number of TCP Flows
(2001)
We consider a stochastic model of a RED gateway under competing TCP-likesources sharing the capacity. As the number of competing flows becomes large, the queue behavior of RED can be described by a two-dimensional recursion. ...
Stochastic Approximations for Finite-State Markov Chains.
(1989)
This paper develops an a.s. convergence theory for a class of projected Stochastic Approximations driven by finite-state Markov chains. The conditions are mild and are given explicitly in terms of the model data, mainly ...
Dynamic, Transient and Stationary Behavior of the M/GI/1 Queue.
(1988)
An exponential martingale is associated with the Markov chain of the number of customers in the M/GI/1 queue. This together with renewal theory are shown to provide a unified probabilistic framework for deriving several ...
On a Reduced Load Equivalence under Heavy Tail Assumptions
(1998)
We propose a general framework for obtaining asymptotic distributional bounds on the stationary backlog <I> W<SUP>A<SUB>1</SUB>+A<SUB>2</SUB>,c</SUP></I> in a buffer fed by a combined fluid process <I>A<SUB>1</SUB>+A<SUB ...
Large Deviations for Partial Sum Processes Over Finite Intervals
(1997)
With any sequence {xn, n = ﯱ, ﯲ, ...} of IRp -valued random variables, we associate the partial sum processes {XTN(.)}$ which take value, in the space $(D[0,T]^p, au_0)$ of, right- continuous functions $[0,T] ightarrow ...
ALAX P1355-Based Architecture for an ATM LAN Access Switch with Application on ATM Onboard Switching
(1995)
We drew attention to the new IEEE P1355 Standard for Heterogeneous InterConnect as a possible platform to support several onboard processing functions, including onboard communications and onboard ATM switching. The main ...