About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Bi-Path Networks and Multicommodity Flows
Abstract
This paper considers the feasibility of simultaneous multicommodity flows with specified values in a capacity-limited communication network. A class of “bi-path networks” is defined and some basic topological properties of such networks are derived. It is shown that a bi-path network B satisfies a requirement matrix R if, and only if, the value of each simple cutset in B is no smaller than the corresponding cutset value in the “requirement network” R. This result can be readily extended to the case with time-varying requirements. The optimal synthesis can be solved using linear programming techniques if linear cost can be assumed. © 1964, IEEE. All rights reserved.