## Search

Now showing items 11-20 of 88

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

(1989)

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

#### On zero-one laws for connectivity in one-dimensional geometric random graphs

(2006)

We consider the geometric random graph where n points are distributed uniformly and independently on the unit interval [0,1]. Using the method of first and second moments, we provide a simple proof of the "zero-one" law ...

#### Analysis and Adaptive Control of a Discrete-Time Single-Server Network with Random-Routing.

(1989)

This paper considers a discrete-time system composed of K infinite capacity queues that compete for the use of a single server. Customers arrive in i.i.d batches and are served according to a server allocation policy. Upon ...

#### Consistency analysis and evaluation of TTL-based Internet caches

(2005)

Consistency algorithms have been proposed for a wide range of applications that include distributed shared memories (DSM), distributed file systems, and databases. Fundamental definitions and operational constraints that ...

#### Discrete-Time Filtering for Linear Syskms in Correlated Noise with Non-Gaussian Initial Conditions: Asymptotic Behavior of the Difference between the MMSE and LMSE Estimates.

(1989)

We consider the one-step prediction problem for discrete-time linear systems in correlated plant and observation noises, and non-gaussian initial conditions. We investigate the asymptotic behavior of the expected square ...

#### Very sharp transitions in one-dimensional MANETs

(2005)

We investigate how quickly phase transitions can occur in one-dimensional geometric random graph models of MANETs. In the case of graph connectivity, we show that the transition width behaves like 1/n (when the number n ...

#### TCP Traffic Modeling via Limit Theorems

(2002)

Traditional TCP traffic modeling has focused on "micro-scale"modeling of TCP, i.e., detailed modeling of a single TCP flow. While micro-scale models of TCP are suitable for understanding the precise behavior of individual ...

#### A Simple Problem of Flow Control I: Optimality Results.

(1987)

This paper presents a problem of optimal flow control for discrete M|M|1 queues. The problem is cast as a constrained Markov decision process, where the throughput is maximized with a bound on the average queue size. By ...

#### Optimal Replacement Policies for Non-Uniform Cache Objects with Optional Eviction

(2002)

Replacement policies for general caching applications andWeb caching in particular have been extensively addressed in the literature. Many policies that focus on document costs, size, probability of references and temporal ...

#### Simple Proofs of Some Folk Theorems for Parallel Queues.

(1989)

We present simple proofs of some folk theorems for systems of identical single server queues operating in parallel. In particular we establish a monotonicity property in the number of servers, and show that round-robin ...