We analyze a routing scheme for a broad class of networks which converges (in the Cesaro
sense) with probability one to the set of approximate Cesaro-Wardrop equilibria, an …

An adaptive hierarchical routing protocol based on the extension of the new Arpanet
scheme is proposed and its simulated performance is presented. The protocol can adapt to …

A distributed algorithm is presented that can be used to solve the single-destination shortest
path (SDSP) problem or the all-pairs shortest path (APSP) problem for a class of clustered …

This paper presents new efficient shortest path algorithms to solve single origin shortest path
problems (SOSP problems) and multiple origins shortest path problems (MOSP problems) …

A simple two stage optimization algorithm is proposed and investigated for fast computation
of constrained power economic dispatch control problems. The method is a simple …

It appears that all of the known algorithms for solving multistage optimization problems are
based explicitly on standard dynamic programming concepts. Such algorithms are …

A textured decomposition-based algorithm is developed to solve the optimal routing problem
in data networks. The idea of the algorithm is to decompose the large-scale network into …

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

In our earlier papers we developed a parallel textured algorithm to solve the constrained
economic dispatch control (CEDC) problems. The exact convergence theorem and its proof …

The constrained real power economic dispatch control problem is solved in parallel by a
textured decomposition based algorithm. Sufficient conditions and rigorous proofs for the …