The Last Buuer First Serve Priority Policy Is Stable for Stochastic Re{entrant Lines
暂无分享,去创建一个
In this paper, the stability of the Last Buuer First Serve (LBFS) buuer priority policy, in the sense of positive Harris recurrence, is shown under fairly general assumptions on the interarrival and service time distributions, whenever the nominal load at each machine is less than one. This is done by rst describing the uid limits, and then showing that the uid limits empty in nite time from all suitable initial conditions, which Dai 1] has recently shown to be suucient for positive Harris recurrence.
[1] P. R. Kumar,et al. Distributed scheduling based on due dates and buffer priorities , 1991 .
[2] Hong Chen. Fluid Approximations and Stability of Multiclass Queueing Networks: Work-Conserving Disciplines , 1995 .
[3] J. Dai. On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .