Heavy traffic limits theorem for Lu–Kumar reentrant queueing networks

Heavy traffic limits theorem for Lu–Kumar reentrant queueing networks

0.00 Avg rating0 Votes
Article ID: iaor20033328
Country: China
Volume: 19
Issue: 1
Start Page Number: 55
End Page Number: 59
Publication Date: Mar 2002
Journal: Mathematics in Economics
Authors: , ,
Keywords: queueing networks
Abstract:

In this paper, we consider the heavy traffic limits of Lu–Kumar reentrant queueing networks. First, we show some results of its stability, and then, we prove that under the priority discipline p=(4,1), (2,3), the heavy traffic limits theorem holds for the network. The main tools we used here are the property of completeness for a matrix R and piecewise linear Lyapunov function.

Reviews

Required fields are marked *. Your email address will not be published.