## Search

Now showing items 1-10 of 30

#### A strong zero-one law for connectivity in one-dimensional geometric random graphs with non-vanishing densities

(2007)

We consider the geometric random graph where n points are distributed independently on the unit interval [0,1] according to some probability distribution function F. Two nodes communicate with each other if their distance ...

#### Modeling strength of locality of reference via notions of positive dependence

(2005)

The performance of demand-driven caching depends on the locality of reference exhibited by the stream of requests made to the cache. In spite of numerous efforts, no consensus has been reached on how to formally {em compare} ...

#### Characterization of General TCP Traffic under a Large Number of Flows Regime

(2002)

Short-lived TCP traffic (e.g., web mice) composes the majority of the current Internet traffic. Accurate traffic modeling of a large number of short-lived TCP flows is extremely difficult due to (i) the interaction between ...

#### Variability ordering for the backlog in buffer models fed by on-off fluid sources

(2003)

In the context buffer models fed by independent on-off fluid sources, we explore conditions under which "determinism minimizes the stationary backlog." These comparison results are couched in terms of the convex ordering ...

#### Comparing locality of reference - Some folk theorems for the miss rates and the output of caches

(2004)

The performance of demand-driven caching is known to depend on the locality of reference exhibited by the stream of requests made to the cache. In spite of numerous efforts, no consensus has been reached on how to formalize ...

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

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

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