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.
Publication
Networks
Paper
Some theoretical results in multiple path definition in networks
Abstract
This paper is concerned with the problem of defining K multiple paths between pairs of nodes in a network. The treatment presented here is on a theoretical level, although the problem is motivated by a practical scheme for message routing in store‐and‐forward packet switched computer networks. Theorems are presented which offer readily testable sufficient conditions on the topology of a network which guarantee the existence of at least one set of paths under consideration. The proof of this theorem provides a generalized systematic method for constructing these paths if the sufficient conditions are met. Copyright © 1981 Wiley Periodicals, Inc., A Wiley Company