论文信息 - Optimal Dynamic Routing in Multidestination Networks

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.

George I. Stassinopoulos

[1] Bruce E. Hajek,et al. Optimal dynamic routing in communication networks with continuous traffic , 1982, 1982 21st IEEE Conference on Decision and Control.

[2] George I. Stassinopoulos. Fenchel duality and smoothness of solution of the optimal routing problem , 1986, Autom..

[3] A. Segall,et al. An optimal control approach to dynamic routing in networks , 1982 .

[4] George I. Stassinopoulos,et al. Optimal Congestion Control in Single Destination Networks , 1985, IEEE Trans. Commun..

[5] Adrian Segall,et al. AN OPTIMAL CONTROL APPROACH TO DYNAMIC ROUTING IN DATA COMMUNICATION NETWORKS , 1978 .

[6] U. Ozguner,et al. On decentralized dynamic routing for congested traffic networks , 1982 .

[7] Adrian Segall,et al. The Modeling of Adaptive Routing in Data-Communication Networks , 1977, IEEE Trans. Commun..