3 Chapter: Construction of Simple Continuous-time Stochastic Processes
In Section 3.1 we develop recursions to construct queueing processes in continuous time. This shows that a queueing system can be characterized by a few elements; Section 3.2 introduces useful notation for this purpose. Section 3.3 shows how to implement these recursions and visualize the results. The resulting models remain simple; more realistic queueing situations involving control require further ideas.