Dynamic Communication Networks

A finite time delay may often be associated with each branch in a communication network. That is, a given length of time is required for a flow to traverse each branch. In this paper, this model is described by a set of discrete input-output state equations. Conditions for the network to behave conservatively (in the sense that flow is neither created nor destroyed) are derived. The special case of linear state equations is examined, and asymptotic properties of flow and a transfer function are given. The idea of satisfying demands at the stations of the net is related to state reachability. Bounded input systems and an example of a time-varying linear system are also considered.