Search
Now showing items 1-10 of 19
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. ...
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 ...
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 ...
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} ...
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 a Random Sum Formula for the Busy Period of the M|G|Infinity Queue with Applications
(2001)
A random sum formula is derived for the forward recurrence time associated with the busy period length of the M|G|infinity queue. This result is then used to (1) provide a necessary and sufficient condition for the ...
