DocumentCode
780964
Title
Optimal Dynamic Routing in Multidestination Networks
Author
Stassinopoulos, G.I.
Author_Institution
Nat. Tech. Univ., Athens, Greece
Volume
35
Issue
4
fYear
1987
fDate
4/1/1987 12:00:00 AM
Firstpage
472
Lastpage
475
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;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOM.1987.1096779
Filename
1096779
Link To Document