Search

We adopt the optimization framework for the rate allocation problem proposed by Kelly and investigate the stability of the system with arbitrary communication delays between network elements. It is shown that there is a ...

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

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

We study the problem of dynamic resource allocation of a GPS server with two traffic classes when the leaky bucket scheme is employed as a traffic policing mechanism. Three popular input traffic models -- independent Poisson ...

We adopt the optimization framework for the rate allocation problem proposed by Kelly and investigate the stability of the system with arbitrary communication delays between network elements with time-varying queue dynamics. ...

We study the issue of how to fairly allocate communication rate among the users of a Gaussian multiaccess channel. All users are assumed to value rate equally and each is assumed to have no limit on its desired rate. We ...

Accurate modeling of a large number of heterogeneous TCP flows is important for the understanding and control of Internet traffic. Difficulties in deriving such models arise due to the interaction between different protocol ...

We study the issue of designing a downlink scheduling policy for a cellular network with base station antenna arrays. We derive an optimal scheduling policy that achieves the throughput region, which is a set of feasible ...

We adopt the optimization framework for rate allocation problem proposed by Kelly and characterize the stability condition with an arbitrary communication delay in the case of single resource. We demonstrate the existence ...

We study the distribution of a path duration in multi-hop wireless networks. We show that as the number of hops along a path increases, the path duration distribution can be accurately approximated by an exponential ...