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

On a Retrial Single-Server Queueing System with Finite Buffer and Multivariate Poisson Flow We consider a single-server queueing system with a finite buffer, K input Poisson flows of intensities λ i , and distribution functions B i (x) of service times for calls of the ith type, $$i = \overline {1,K}$$ . If the buffer is overflowed, an arriving call is sent to the orbit and becomes a repeat call. In a random time, which has exponential distribution, the call makes an attempt to reenter the buffer or server, if the latter is free. The maximum number of calls in the orbit is limited; if the orbit is overflowed, an arriving call is lost. We find the relation between steady-state distributions of this system and a system with one Poisson flow of intensity $${\lambda } = \sum\limits_{i = 1}^K {{\lambda }_i }$$ where type i of a call is chosen with probability λ i /λ at the beginning of its service. A numerical example is 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 Multivariate Poisson Flow

Loading next page...
 
/lp/springer_journal/on-a-retrial-single-server-queueing-system-with-finite-buffer-and-LFMRnhyJR2
Publisher
Kluwer Academic Publishers-Plenum Publishers
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:1013883603388
Publisher site
See Article on Publisher Site

Abstract

We consider a single-server queueing system with a finite buffer, K input Poisson flows of intensities λ i , and distribution functions B i (x) of service times for calls of the ith type, $$i = \overline {1,K}$$ . If the buffer is overflowed, an arriving call is sent to the orbit and becomes a repeat call. In a random time, which has exponential distribution, the call makes an attempt to reenter the buffer or server, if the latter is free. The maximum number of calls in the orbit is limited; if the orbit is overflowed, an arriving call is lost. We find the relation between steady-state distributions of this system and a system with one Poisson flow of intensity $${\lambda } = \sum\limits_{i = 1}^K {{\lambda }_i }$$ where type i of a call is chosen with probability λ i /λ at the beginning of its service. A numerical example is given.

Journal

Problems of Information TransmissionSpringer Journals

Published: Oct 9, 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 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

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