<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
<PublisherName>OICC Press</PublisherName>
<JournalTitle>International Journal of Mathematical Modelling &amp; Computations</JournalTitle>
<Issn>2228-6233</Issn>
<Volume>5</Volume>
<Issue>2</Issue>
<PubDate PubStatus="epublish">
<Year>2015</Year>
<Month>03</Month>
<Day>21</Day>
</PubDate>
</Journal>
<ArticleTitle>ANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS</ArticleTitle>
<VernacularTitle></VernacularTitle>
<FirstPage>173</FirstPage>
<LastPage>184</LastPage>
<ELocationID EIdType="doi"></ELocationID>
<Language>EN</Language>
<AuthorList>
<Author>
<FirstName>Vijaya Laxmi</FirstName>
<LastName>Pikkala</LastName>
<Affiliation></Affiliation>
<Identifier Source="ORCID"></Identifier>
</Author>
<Author>
<FirstName>Jyothsna</FirstName>
<LastName>Kanithi</LastName>
<Affiliation></Affiliation>
<Identifier Source="ORCID"></Identifier>
</Author>
</AuthorList>
<PublicationType>Journal Article</PublicationType>
<History>
<PubDate PubStatus="received">
<Year>2015</Year>
<Month>03</Month>
<Day>21</Day>
</PubDate>
</History>
<Abstract>This paper presents the analysis of a renewal input finite buffer queue wherein the customers can decide either tojoin the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed by anunderlying $m$-state Markov chain. Employing the supplementary variable and imbedded Markov chain techniques, the steady-state system length distributions at pre-arrival and arbitrary epochs are obtained. Based on thesystem length distributions, some performance measures of the model and waiting-time analysis are presented.Finally, numerical results are displayed to show the effect of model parameters on the key performance measures.
</Abstract>
</Article>
</ArticleSet>