Distributed Hierarchical Optimal Routing Using Aggregation/Disaggergation and Decomposition/Composition Techniques

In this paper, we improve the performance of the original Iterative Aggregation/Disaggregation Gradient Projection (IAD-GP) algorithm based on the idea of A/D only. The A/D concept naturally fits the hierarchical structure of the large wide area data networks and one would expect speed-up effects. Furthermore, by adding to the modified IAD-GP iteration… CONTINUE READING