The Queue G e o/G/1/N + 1 Revisited

The Queue G e o/G/1/N + 1 Revisited This paper presents an alternative steady-state solution to the discrete-time G e o/G/1/N + 1 queueing system using roots. The analysis has been carried out for a late-arrival system using the imbedded Markov chain method, and the solutions for the early arrival system have been obtained from those of the late-arrival system. Using roots of the associated characteristic equation, the distributions of the numbers in the system at various epochs are determined. We find a unified approach for solving both finite- and infinite- buffer systems. We investigate the measures of effectiveness and provide numerical illustrations. We establish that, in the limiting case, the results thus obtained converge to the results of the continuous-time counterparts. The applications of discrete-time queues in modeling slotted digital computer and communication systems make the contributions of this paper relevant. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Methodology and Computing in Applied Probability Springer Journals

The Queue G e o/G/1/N + 1 Revisited

Loading next page...
 
/lp/springer_journal/the-queue-g-e-o-g-1-n-1-revisited-AOKOgj6Eef
Publisher
Springer Journals
Copyright
Copyright © 2018 by Springer Science+Business Media, LLC, part of Springer Nature
Subject
Statistics; Statistics, general; Life Sciences, general; Electrical Engineering; Economics, general; Business and Management, general
ISSN
1387-5841
eISSN
1573-7713
DOI
10.1007/s11009-018-9645-0
Publisher site
See Article on Publisher Site

Abstract

This paper presents an alternative steady-state solution to the discrete-time G e o/G/1/N + 1 queueing system using roots. The analysis has been carried out for a late-arrival system using the imbedded Markov chain method, and the solutions for the early arrival system have been obtained from those of the late-arrival system. Using roots of the associated characteristic equation, the distributions of the numbers in the system at various epochs are determined. We find a unified approach for solving both finite- and infinite- buffer systems. We investigate the measures of effectiveness and provide numerical illustrations. We establish that, in the limiting case, the results thus obtained converge to the results of the continuous-time counterparts. The applications of discrete-time queues in modeling slotted digital computer and communication systems make the contributions of this paper relevant.

Journal

Methodology and Computing in Applied ProbabilitySpringer Journals

Published: Jun 4, 2018

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 folders to
organize your research

Export folders, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off