Many communication networks use adaptive shortest path routing. By this we mean that
each network link is periodically assigned a length that depends on its congestion level …

In this paper we initiate the study of competitive on-line packet routing algorithms. At any
time, any network node may initiate sending a packet to another node. Our goal is to route …

The implementation of a multicommodity flow algorithm into a FORTRAN code is discussed.
The algorithm is based on a gradient projection method [1] with diagonal scaling based on …

In this paper, a new algorithm based on hierarchical aggregation/disaggregation and
decomposition/composition (HAD) scheme is proposed to solve the optimal routing …

We prove convergence of a distributed gradient projection method for optimal routing in a
data communication network. The analysis is carried out without any synchronization …

The large-scale multicommodity flow problem with bounded arc flows and convex costs is an
important problem which arises in several areas including transportation …

That a load balancing strategy using stale information care lessly will incur system
performance degradation is easy to verify. However it is not so obvious that routing a …

A new gradient projection algorithm using iterative aggregation and disaggregation is
proposed and analyzed for box-constrained minimization problems. In a variation of the …

In our earlier paper (1991), a textured decomposition based algorithm is developed to solve
the optimal routing problem in data networks; a few examples were used to illustrate the …

A fundamental graph-theoretic result is presented for characterizing optimal topological
structures. An optimal topology is defined as one which maximizes the number of origin …