In this paper, we study a new retrial queueing system with N classes of customers, where a class-i blocked customer joins orbit i. Orbit i works like a single-server queueing system with (exponential) constant retrial time (with rate mu((i))(0)) regardless of the orbit size. Such a system is motivated by multiple telecommunication applications, for instance wireless multi-access systems, and transmission control protocols. First, we present a review of some corresponding recent results related to a single-orbit retrial system. Then, using a regenerative approach, we deduce a set of necessary stability conditions for such a system. We will show that these conditions have a very clear probabilistic interpretation. We also performed a number of simulations to show that the obtained conditions delimit the stability domain with a remarkable accuracy, being in fact the (necessary and sufficient) stability criteria, at the very least for the 2-orbit M/M/1/1-type and M/Pareto/1/1-type retrial systems that we focus on.


    Access

    Download


    Export, share and cite



    Title :

    Stability analysis and simulation of a N-class retrial system with constant retrial rates and Poisson inputs


    Contributors:

    Publication date :

    2014-01-01


    Remarks:

    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH ; ISSN: 0217-5959



    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629



    Co-op seeks retrial in battle with ICL

    British Library Online Contents | 2003



    Fujitsu appeals against Co-op High Court retrial

    British Library Online Contents | 2004


    Finite population multi-server retrial queueing system with an optional service and balking

    Ahuja, Anjali / Jain, Anamika / Jain, Madhu | British Library Online Contents | 2019


    Finite population multi-server retrial queueing system with an optional service and balking

    Ahuja, Anjali / Jain, Anamika / Jain, Madhu | British Library Online Contents | 2019