A duality model of ow control is proposed in Part I of this paper and leads to a basic ow
control algorithm. In this sequel we develop a practical implementation of the basic …

Flow control has been studied since the early stages of research in telecommunication
networks. In these early studies the term ow control has been used to describe almost any …

This paper is concerned with a new type of congestion control method that we call
anticipative congestion control, which exploits probabilistic information available at a …

Among various active queue management schemes (AQM), random early detection (RED) is
probably the most extensively studied. Unlike the existing RED enhancement schemes, we …

REM is an active queue management scheme that measures congestion not by a
performance measure such as loss or delay, but by a quantity we call price. Price is …

This paper concerns optimization-based network flow control; these recently proposed
algorithms select transmission rates by maximizing a utility function for the set of sources …

This paper proposes a rate-based active queue management algorithm or RAQM. It uses the
aggregated traffic input rate to calculate packet drop probability according to an exponential …

We proposed earlier an optimization approach to reactive ow control where the objective of
the control is to maximize the total utility of all sources over their transmission rates. The …

Fair resource allocation in high-speed networks, such as the Internet, can be viewed as a
constrained optimization program. Kelly et al.(2000) have shown that an unconstrained …

We consider the problem of throughput-optimal packet dissemination, in the presence of an
arbitrary mix of unicast, broadcast, multicast, and anycast traffic, in an arbitrary wireless …