SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

An Elementary Solution of the Queuing System G/G/1 · Study

ArticleShelves

ArticleAn Elementary Solution of the Queuing System G/G/1

Alan G. Konheim1975

Article1975

An Elementary Solution of the Queuing System G/G/1

Alan G. Konheim

43 citations·0/0 files stored·SIAM Journal on Computing

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Probability and Statistical Research Age of Information Optimization

Abstract

In this note we give an elementary method for calculating the stationary distribution of waiting time in a G/G/1 queue.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 43 citations exist upstream.

References

1952The theory of queues with a single server

Cited by

1996An operational calculus for probability distributions via Laplace transforms 2002The waiting time analysis of a discrete-time queue with arrivals as a discrete autoregressive process of order 1 2000On Numerical Computations of Some Discrete-Time Queues 2003A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times 2003Combined Elapsed Time and Matrix-Analytic Method for the Discrete Time GI/G/1 and GI X /G/1 Systems 1995A polynomial factorization approach to the discrete time GI/G/1/(N) queue size distribution 1987On the stationary waiting-time distribution in the GI/G/ 1 queue, I: Transform methods and almost-phase-type distributions 1996On steady-state queue size distributions of the discrete-time GI/G/1 queue

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

1993An introduction to queueing theoryarticle · 1 shared reference 2017Data-driven robust optimizationarticle · 1 shared reference 2003Precise estimates for the ruin probability in finite horizon in a discrete-time model with heavy-tailed insurance and financial risksarticle · 1 shared reference 1962On Queues in Heavy Trafficarticle · 1 shared reference 1955On the theory of queues with many serversarticle · 1 shared reference 1962Some Inequalities for the Queue GI/G/1article · 1 shared reference

Details

Year1975

Typearticle

Published1975-12-01

VenueSIAM Journal on Computing

ISSN-L0097-5397

Languageen

Citations43

Files0 public / 0

ShelfAdvanced Queuing Theory Analysis

Identifiers

doi10.1137/0204046

openalex_workW2033688774

Links

Imported from OpenAlex (CC0) — nothing here is generated.