Bi-Path Networks and Multicommodity Flows

1 December 1964

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory

Vol. 11 (4) , 468-473
https://doi.org/10.1109/tct.1964.1082356

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 networkBsatisfies a requirement matrix\bar{R}if, and only if, the value of each simple cutset inBis 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.

Keywords

BISMUTH

This publication has 0 references indexed in Scilit: