ON SIMULTANEOUS FLOWS IN A COMMUNICATION NETWORK
Abstract
A generalization is presented of the results of Elias, Feinstein, and Shannon, and Ford and Fulkerson on the maximum rate of information flow through a communication network. The problem is the followig: Suppose a fixed rate of flow of information is being maintained between statio s A and B of a communication network, then (1) what is the maximum rate of flow between another pair of stations C and D o the same communication network, and (2) how can one allocate, among the channels, the original load on the communication network to obtain the maximal flow between stations C and D. Within certain determinable limits the sum of these 2 rates of flow remains a constant. A technique for attaining the maximal flow between stations C and D based upon the linear programming is described A solution of the generalization of this problem to the case of k simultaneous flows is also presented. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1961
- Accession Number
- AD0267090
Entities
People
- S.l. Hakimi
Organizations
- University of Illinois Urbana–Champaign