## Search

Now showing items 31-40 of 88

#### When Are On-Off Sources SIS? Conditions and Applications

(2002)

Recent advances from the theory of multivariate stochastic orderings can be used to formalize the lqlq folk theorem" to the effect that positive correlations lead to larger buffer levels at a discrete-time infinite capacity ...

#### The output of a cache under the independent reference model - Where did the locality of reference go?

(2004)

We consider a cache operating under a demand-driven replacement policy when document requests are modeled according to the Independent Reference Model (IRM). We characterize the popularity pmf of the stream of misses from ...

#### Modeling locality of reference via notions of positive dependence -- Some mixed news!

(2005)

We introduce the notion of Temporal Correlations (TC) ordering as a way to compare strength of temporal correlations in streams of requests. This notion is based on the supermodular ordering, a concept of positive dependence ...

#### Convergence of ant routing algorithms -- Results for a simple parallel network and perspectives

(2003)

We study the convergence property of a family of distributed routing algorithms based on the ant colony metaphor, namely the uniform and regular ant routing algorithms discussed by Subramanian et al. For a simple two-node ...

#### On random graphs associated with a pairwise key distribution scheme

(2010-01-01)

The pairwise key distribution scheme of Chan
et al. was proposed as an alternative to the key distribution scheme of Eschenauer and Gligor to enable network security in wireless sensor networks. We consider the random ...

#### Discrete-Time Filtering for Linear Systems in Correlated Noise with Non-Gaussian Initial Conditions.

(1988)

We consider the one-step prediction problem for discrete-time linear systems in correlated plants and observation noises, and non-Gaussian initial conditions. Explicit representations are obtained for the MMSE and LMMSE ...

#### 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 ...

#### 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 ...

#### 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 ...

#### A Simple Problem of Flow Control II: Implementation of Threshold Policies via Stochastic Approximations.

(1987)

This paper considers a flow control model for discrete M|M|1 queues. The problem of implementing a given threshold policy via an adaptive policy is discussed in terms of an adaptive algorithm of the Stochastic Approximations ...