A General Purpose Microcontroller Trainer

  • Habib M. Talukder
  • Michael Collier

Abstract

Links in a communication network are continuously subjected to physical and logical changes. These give rise to changes in flow as well as in the collection of paths in such a network. In this investigation, we obtain maximum flow cut-set matrices for non-oriented link-weighted capacity networks in a protean environment. The change of state of a link in a communication network alters the collection of cut-sets, thereby altering the maximum flow of that network. We present an analytical method of finding cut-sets of a changing network which may be incorporated intelligently in the system management of that network. Therefore, accounting of the performance of a network under constraints may also be possible. Although the method is discussed primarily for a communication network, it may be applied to any other type of network, such as transportation, water reticulation or any large scale process plants.
(Af. J. of Science and Technology: 2002 3(1): 114-121)
Published
2004-02-12
Section
Articles

Journal Identifiers


eISSN: 1607-9949