Globally Periodic Behavior of Switched Single Server Flow Networks
Alexey S. Matveev, Andrey V. Savkin · Birkhäuser Boston eBooks · 2000
In this chapter, we proceed with investigation of switched single server flow networks, which was started in Section 6.4. We recall that a network under consideration is defined by an oriented graph. Each node of this graph corresponds to a buffer. Moreover, some edges of the graph indicate links that connect pairs of buffers while others correspond to inputs or outputs of the network. All the buffers of the network are processed by a single server or machine. The server removes work from a selected buffer and sends it either to another buffer or outside the system. Some special classes of such networks were introduced in [60] to model flexible manufacturing systems. Moreover, such networks may be useful to model various computer and communication systems, especially systems with time-sharing schemes. Some other examples include batch processes, chemical kinetics, and biotechnological processes. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.