Optimal Dynamic Routing in Multidestination Networks

The dynamic routing problem for multiple destination networks is considered. The minimum time rather than total delay cost functional is employed. Each link capacity is optimally partitioned by examining the competition of bottlenecks associated with each destination. The multidestination problem is thus solved through an iterative link-by-link optimization.