Loss probability behavior of Pareto/M/1/K queue

Younsuk Koh · Kiseon Kim

25 citations0/0 files storedIEEE Communications Letters

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 Network Traffic and Congestion Control Probability and Risk Models

Abstract

In this letter, we investigate the queue behavior with Pareto interarrival and exponential service time distribution. By numerical analysis and simulations, we analyze the asymptotic and the exact loss probabilities of GI/M/1/K to show the big discrepancy between the asymptotic and the actual loss probability and propose a model for the loss probability of Pareto/M/1/K as a function of the buffer size K and the geometric parameter.

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 — 25 citations exist upstream.

References

2000Queueing Networks and Markov Chains: Modeling and Performance Evaluation with Computer Science Applications 1998Queueing Networks and Markov Chains 2000Internet-Type Queues with Power-Tailed Interarrival Times and Computational Methods for Their Analysis 2000Asymptotic Behavior of Loss Probability in GI/M/1/K Queue as K Tends to Infinity 1990Complementary generating functions for theMX/GI/1/kandGI/My/1/Kqueues and their application to the comparison of loss probabilities

Explore the map →

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

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