An effective local dynamic strategy to clear congested multidestination networks

The solution of a local routing problem for a congested node with two alternative paths to
M
destinations of a traffic network is presented. The solution shows that the admissible state space is divided into a finite number of regions within which a different set of optimal flow conditions must be satisfied. A specific realization of these optimal conditions is presented which can be utilized by local node controllers in decentralized control strategies for larger networks.