We propose an optimization approach to flow control where the objective is to maximize the
aggregate source utility over their transmission rates. We view network links and sources as …

We study how protocol design for various functionalities within a communication network
architecture can be viewed as a distributed resource allocation problem. This involves …

In this paper, we address the problem of optimal decentralized traffic engineering when
multiple paths are available for each call. More precisely, given a set of possible paths for …

This paper is concerned with flow control and resource allocation problems in computer
networks in which real-time applications may have hard quality of service (QoS) …

We consider optimal control for general networks with both wireless and wireline
components and time varying channels. A dynamic strategy is developed to support all traffic …

Flow control in high speed networks requires distributed routers to make fast decisions
based only on local information in allocating bandwidth to connections. While most previous …

A common assumption behind most of the recent research on network rate allocation is that
traffic flows are elastic, which means that their utility functions are concave and continuous …

We propose two flow control algorithms for networks with multiple paths between each
source–destination pair. Both are distributed algorithms over the network to maximize …

Congestion is a longstanding problem in datagram networks. One congestion avoidance
technique is feedback flow control, in which sources adjust their transmission rate in …

We develop a mathematical model within a game theoretical framework to capture the flow
control problem for variable rate traffic at a bottleneck node. In this context, we also address …