Distributed asynchronous optimal routing in data networks
暂无分享,去创建一个
We prove convergence of a distributed gradient projection method for optimal routing in a data communication network. The analysis is carried out without any synchronization assumptions and takes into account the possibility of transients caused by updates in the routing strategy being used.
[1] Robert G. Gallager,et al. A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..
[2] M. Schwartz,et al. Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..
[3] Dimitri P. Bertsekas,et al. Optimal routing and flow control methods for communication networks , 1982 .
[4] D. Bertsekas,et al. Asymptotic optimality of shortest path routing , 1983 .