On a Retrial Single-Server Queueing System with Finite Buffer and Poisson Flow

On a Retrial Single-Server Queueing System with Finite Buffer and Poisson Flow A retrial single-server queueing system with finite buffer is considered. The primary incoming flow is Poissonian. If the buffer is overflown, a call entering the system becomes a repeat call and joins the group of repeat calls referred to as an orbit. The maximum number of calls that can simultaneously be contained in the orbit is limited. A call from the orbit makes new attempts to enter the system until a vacancy occurs. Time between repeat attempts for each call is an exponentially distributed random variable. At the initial moment of service, a type of a call is defined: with probability a i it becomes a call of type i and its service time in this case has distribution function B i (x), i = $$\overline {1,K}$$ . For this system, the stationary joint distribution of queues in the buffer and orbit is found. Numerical examples are given. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

On a Retrial Single-Server Queueing System with Finite Buffer and Poisson Flow

Loading next page...
 
/lp/springer_journal/on-a-retrial-single-server-queueing-system-with-finite-buffer-and-N408KPM8L5
Publisher
Springer Journals
Copyright
Copyright © 2001 by MAIK “Nauka/Interperiodica”
Subject
Engineering; Communications Engineering, Networks; Electrical Engineering; Information Storage and Retrieval; Systems Theory, Control
ISSN
0032-9460
eISSN
1608-3253
D.O.I.
10.1023/A:1013882108415
Publisher site
See Article on Publisher Site

Abstract

A retrial single-server queueing system with finite buffer is considered. The primary incoming flow is Poissonian. If the buffer is overflown, a call entering the system becomes a repeat call and joins the group of repeat calls referred to as an orbit. The maximum number of calls that can simultaneously be contained in the orbit is limited. A call from the orbit makes new attempts to enter the system until a vacancy occurs. Time between repeat attempts for each call is an exponentially distributed random variable. At the initial moment of service, a type of a call is defined: with probability a i it becomes a call of type i and its service time in this case has distribution function B i (x), i = $$\overline {1,K}$$ . For this system, the stationary joint distribution of queues in the buffer and orbit is found. Numerical examples are given.

Journal

Problems of Information TransmissionSpringer Journals

Published: Oct 7, 2004

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

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

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

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.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off