Stability of multi-server polling system with server limits

نویسندگان

  • Nelson Antunes
  • Christine Fricker
  • James Roberts
چکیده

We consider a multi-server polling system with server limits, that is the number of servers that can attend a queue simultaneously is limited. Stability conditions are available when service policies are unlimited. The definition of stability conditions when both server limits and limited service policies apply remains an open problem. We postulate a conjecture for the stability condition in this case that is supported by our simulation results. The study of this particular variant of the multiserver polling system is motivated by the performance evaluation of next generation passive optical access networks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Approach of Convergence to Stationary State of Multi Server Queue with Balking (TECHNICAL NOTE)

This investigation deals with multi server queue with balking. The customers arrive in poisson fashion and independent of time, under the assumption that system is initially empty. The number of customers in the system is stochastically increasing and distributed in steady state (stationary state) as required. The expressions for the measure of the speed of convergence from transient state to s...

متن کامل

Discrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers‎

This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...

متن کامل

On the stability of greedy polling systems with general service policies

We consider a polling system with a finite number of stations fed by compound Poisson arrival streams of customers asking for service. A server travels through the system. Upon arrival at a non-empty station i, say, with x > 0 waiting customers, the server tries to serve there a random number B of customers if the queue length has not reached a random level C < x before the server has completed...

متن کامل

On Two-Echelon Multi-Server Queue with Balking and Limited Intermediate Buffer

In this paper we study two echelon multi-server tandom queueing systems where customers arrive according to a poisson process with two different rates. The service rates at both echelons are independent of each other. The service times of customers is assumed to be completed in two stages. The service times at each stage are exponentially distributed. At the first stage, the customers may balk ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Queueing Syst.

دوره 68  شماره 

صفحات  -

تاریخ انتشار 2011