Digital Communication Nets and N-Port Resistive Networks

A Communication net is usually represented
by a linear graph G whose branches
represent channels for information
flow and whose vertices represent sources,
sinks and switching centers. The
purpose of this paper is to show that
for modeling digital communication nets,
conventional use of the concepts of
capacity and terminal capacity is
inadequate . We will present an alternative
to Max-Flow Min-Cut Theorem
for finding the maximum flow between
a pair of vertices of G. It will be
seen that this alternative procedure
is equivalent to finding the admittance
between a pair of terminals of a
appropriately defined resistive network.