Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

Download PDF
14 pages

Loading next page...
 
/lp/springer-journals/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 Probability – Springer Journals

Published: Jun 4, 2018

References

  • Solving the ME/ME/1 queue with state-space methods and the matrix sign function
    Akar, N
  • Applied discrete-time queues
    Alfa, A
  • An introduction to queueing theory: modeling and analysis in applications
    Bhat, UN
  • Discrete-time models for communication systems including ATM, vol 205
    Bruneel, H; Kim, BG
  • Qroot software package
    Chaudhry, ML
  • Robustness of rootfinding in single-server queueing models
    Chaudhry, ML; Harris, CM; Marchal, WG
  • On exact computational analysis of distributions of numbers in systems for M/G/1/N + 1 and GI/M/1/N + 1 queues using roots
    Chaudhry, ML; Gupta, UC; Agarwal, M
  • Simultaneity in discrete-time single server queues with bernoulli inputs
    Gravey, A; Hébuterne, G
  • Probability, random processes and statistical analysis: applications to communications, Signal processing, queueing theory and mathematical finance
    Kobayashi, H; Mark, BL; Turin, W
  • A recursive method for bernoulli arrival queues and its application to partial buffer sharing in atm
    Lee, HW; Lee, SH; Yoon, SH; Ahn, B; Park, NI
  • Detailed computational analysis of queueing-time distributions of the BMAP/G/1 queue using roots
    Singh, G; Gupta, U; Chaudhry, ML
  • Communication and computer networks: modelling with discrete-time queues
    Woodward, ME