Dynamic Communication Networks
- 1 April 1967
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communication Technology
- Vol. 15 (2) , 156-163
- https://doi.org/10.1109/tcom.1967.1089574
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Comments on "Simultaneous Flows Through a Communication NetworkIEEE Transactions on Circuit Theory, 1963
- Optimization of communication nets with switchingJournal of the Franklin Institute, 1963
- Topological Analysis and Synthesis of Communication NetworksPublished by Columbia University Press ,1962
- Synthesis of Radio-Communication NetsIRE Transactions on Circuit Theory, 1962
- Control System Analysis and Design Via the “Second Method” of Lyapunov: I—Continuous-Time SystemsJournal of Basic Engineering, 1960
- Transient flows in networks.The Michigan Mathematical Journal, 1959
- Constructing Maximal Dynamic Flows from Static FlowsOperations Research, 1958