We consider a network in which message packets arriving on a clock cycle are directed along paths which may have segments in common. When they do, the messages involved are queued and transmitted, one per cycle. The statistics of queue length are investigated by an expansion of the time series in a channel about the regime of independent arrivals. Results for the second stage of such a network are in good agreement with computer simulations.
ASJC Scopus subject areas
- Applied Mathematics