Notes on Optimal Routing and Flow Control for Communication Networks.
暂无分享,去创建一个
[1] E. M. L. Beale,et al. Nonlinear Programming: A Unified Approach. , 1970 .
[2] Luigi Fratta,et al. The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.
[3] E. Polak. Introduction to linear and nonlinear programming , 1973 .
[4] D. Bertsekas. On the Goldstein-Levitin-Polyak gradient projection method , 1974, CDC 1974.
[5] Robert G. Gallager,et al. A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..
[6] Kenneth Steven Vastola. A Numerical Study of Two Measures of Delay for Network Routing. , 1979 .
[7] Eric C. Rosen,et al. The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..
[8] Robert G. Gallager,et al. Flow Control and Routing Algorithms for Data Networks , 1980 .
[9] M. Schwartz,et al. Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..
[10] Seyyed Jamaaloddin Golestaani,et al. A unified theory of flow control and routing in data communication networks , 1980 .
[11] Mario Gerla,et al. Flow Control: A Comparative Survey , 1980, IEEE Trans. Commun..
[12] D. Bertsekas. Projected Newton methods for optimization problems with simple constraints , 1981, CDC 1981.
[13] Oliver C. Ibe,et al. Flow Control and Routing in an Integrated Voice and Data Communication Network , 1981 .
[14] D. Bertsekas,et al. Projected Newton methods and optimization of multicommodity flows , 1982, CDC 1982.
[15] D. Bertsekas,et al. Projection methods for variational inequalities with application to the traffic assignment problem , 1982 .
[16] Dimitri P. Bertsekas,et al. Dynamic behavior of shortest path routing algorithms for communication networks , 1982 .