Title :
Optimal Dynamic Routing in Multidestination Networks
Author :
Stassinopoulos, G.I.
Author_Institution :
Nat. Tech. Univ., Athens, Greece
fDate :
4/1/1987 12:00:00 AM
Abstract :
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.
Keywords :
Communication switching; Computer networks; Switching, communication; Communication system control; Communications Society; Computer science; Cost function; Data communication; Delay effects; Polynomials; Q measurement; Routing; Writing;
Journal_Title :
Communications, IEEE Transactions on
DOI :
10.1109/TCOM.1987.1096779
