Abstract
We consider multiclass feedforward queueing networks with first in first out and priority service disciplines at the nodes, and class dependent de terministic routing between nodes. The random behavior of the network is constructed from cumulative arrival and service time processes which are as sumed to satisfy an appropriate sample path large deviation principle. We establish logarithmic asymptotics of large deviations for waiting time, idle time, queue length, departure and sojourn-time processes in critical loading. This transfers similar results from Puhalskii about single class queueing net works with feedback to multiclass feedforward queueing networks, and com plements diffusion approximation results from Peterson. An example with renewal inter arrival and service time processes yields the rate function of a reflected Brownian motion. The model directly captures stationary situations.
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 callDisclaimer: 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.
