2nd International ICST Conference on Performance Evaluation Methodologies and Tools

Research Article

Finite-buffer bulk service queue under Markovian service process

Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.4108/valuetools.2007.44,
    author={Abhijit Datta  Banik and  Umesh Chandra  Gupta and Mohan L.  Chaudhry},
    title={Finite-buffer bulk service queue under Markovian service process},
    proceedings={2nd International ICST Conference on Performance Evaluation Methodologies and Tools},
    publisher={ACM},
    proceedings_a={VALUETOOLS},
    year={2010},
    month={5},
    keywords={Markovian service process general independent arrival queue finite-buffer general bulk service rul},
    doi={10.4108/valuetools.2007.44}
}
  • Abhijit Datta Banik
    Umesh Chandra Gupta
    Mohan L. Chaudhry
    Year: 2010
    Finite-buffer bulk service queue under Markovian service process
    VALUETOOLS
    ICST
    DOI: 10.4108/valuetools.2007.44
Abhijit Datta Banik1,*, Umesh Chandra Gupta2, Mohan L. Chaudhry3,4
  • 1: INRIA, Rennes (IRISA), Campus De Beaulieu, 35042 Rennes Cedex France. Tel.: +0(33)-299847134
  • 2: Department of Mathematics, Indian Institute of Technology, Kharagpur-721302, India.
  • 3: Department of Mathematics and Computer Science, Royal Military College of
  • 4: Canada, P.O. Box 17000, STN Forces, Kingston Ont., Canada K7K, 7B4
*Contact email: adattaba@irisa.fr

Abstract

We consider a single-server finite-buffer queue with renewal input and Markovian service process where server serves customers in batches according to general bulk service rule. Queue length distributions at pre-arrival and arbitrary epochs have been obtained along with some important performance measures such as, probability of blocking or loss of customers, mean queue lengths, mean waiting times, etc.

Keywords
Markovian service process general independent arrival queue finite-buffer general bulk service rul
Published
2010-05-16
Publisher
ACM
http://dx.doi.org/10.4108/valuetools.2007.44
Copyright © 2007–2021 ICST