论文信息 - AN OPTIMAL CONTROL APPROACH TO DYNAMIC ROUTING IN NETWORKS PART II: A MAXIMAL FLOW APPROACH

AN OPTIMAL CONTROL APPROACH TO DYNAMIC ROUTING IN NETWORKS PART II: A MAXIMAL FLOW APPROACH

This paper presents a new approach for building the feedback solution for the minimum delay dynamic message routing problem for single destination networks. The necessary and sufficient conditions for optimality derived in previous works are interpreted in terms of weighted maximal flow problems. Several properties concerning these problems are obtained and used to develop a simplified algorithm for building the feedback space. The various steps of the algorithm are presented and motivated in detail.

Adrian Segall | Mario Jodorkovsky

[1] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .

[2] N. Chernikova. Algorithm for finding a general formula for the non-negative solutions of a system of linear equations , 1964 .

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

[4] T. H. Mattheiss,et al. An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities , 1973, Oper. Res..

[5] Franklin Howard Moss. The application of optimal control theory to dynamic routing in data communication networks. , 1977 .

[6] Adrian Segall,et al. A maximal flow approach to dynamic routing in communication networks , 1980 .

[7] M. Balinski. An algorithm for finding all vertices of convex polyhedral sets , 1959 .

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

[9] Hanif D. Sherali,et al. Linear Programming and Network Flows , 1977 .