We analyze a multiserver queueing system with a finite buffer and impatient customers. The arrival customer flow is assumed to be Markovian. Service times of each server are phase-type distributed. If all servers are busy and a new arrival occurs, it enters the buffer with a probability depending on the total number of customers in the system and waits for service, or leaves the system with the complementary probability. A waiting customer may become impatient and abandon the system. We give an algorithm for finding the stationary distribution of system states and derive formulas for basic performance characteristics. We find Laplace-Stieltjes transforms for sojourn and waiting times. Numeric examples are given.
Problems of Information Transmission – Springer Journals
Published: Jan 20, 2012
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.
Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.
All the latest content is available, no embargo periods.
“Hi guys, I cannot tell you how much I love this resource. Incredible. I really believe you've hit the nail on the head with this site in regards to solving the research-purchase issue.”Daniel C.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud
“I must say, @deepdyve is a fabulous solution to the independent researcher's problem of #access to #information.”@deepthiw
“My last article couldn't be possible without the platform @deepdyve that makes journal papers cheaper.”@JoseServera