Communication Systems of Channels with Bounded Nondecreasing Costs per Unit of Information Flow
暂无分享,去创建一个
Given a communication system of stations and capacitated channels in which there is associated with each channel a bounded nondecreasing cost per unit of information flow, flow patterns are found that maximize the information rate between a given pair of terminal stations at minimum over-all cost.
[1] Peter Elias,et al. A note on the maximum flow through a network , 1956, IRE Trans. Inf. Theory.
[2] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[3] I. Frisch,et al. N-Port Resistive Networks and Communication Nets , 1961 .
[4] I. Cederbaum. On optimal operation of communication nets , 1962 .