Semi-asynchronous routing for large scale hierarchical networks

We consider the distributed network routing problem in a large-scale hierarchical network whereby the nodes are partitioned into subnetworks, each managed by a network controller (NC), and there is a central NC to coordinate the operation of the distributed NCs. We propose a semi-asynchronous routing algorithm for such a network, whereby the computation is distributed across the NCs and is parallel within each NC. A key feature of the algorithm is its ability to handle a certain degree of asynchronism: the distributed NCs can perform their local computation asynchronously at different processing speed. The efficiency of the proposed algorithm is validated through numerical experiments.