Abstract

In this paper we investigate the properties of stationary point processes motivated by the following traffic model. Suppose there is a dichotomy of slow and fast points (cars) on a road with limited overtaking. It is assumed that fast points are delayed behind (or are clustered at) a slow point in accordance with the principles of a GI/G/s queue, the order of service being irrelevant. Thus each slow point represents a service station, with the input into each station consisting of a fixed (but random) displacement of the output of the previous queueing station. It is found that tractable results for stationary point processes occur for the cases M/M/s (s = 1, 2, ···, ∞) and M/G/∞. In particular, it is found that for these cases the steady state point processes are compound Poisson and that for the M/M/1 case the successive headways form a two state Markov renewal process. In addition it is shown that the input, output, and queue size processes in a steady state M/G/∞ queue are independent at any fixed time; this is a result I have been unable to find in the literature.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.