Statistical analysis of single-server loss queueing systems

DOI10.1007/S11009-010-9187-6zbMATH Open1239.62098arXiv0904.2426OpenAlexW2950885169MaRDI QIDQ429996FDOQ429996

Authors: Vyacheslav Abramov 

Publication date: 20 June 2012

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Abstract: In this article statistical bounds for certain output characteristics of the $M/GI/1/n$ and $GI/M/1/n$ loss queueing systems are derived on the basis of large samples of an input characteristic of these systems, such as service time in the $M/GI/1/n$ queueing system or interarrival time in the $GI/M/1/n$ queueing system. The analysis of this article is based on application of Kolmogorov's statistics for empirical probability distribution functions.

Full work available at URL: https://arxiv.org/abs/0904.2426

Recommendations

• Stochastic Inequalities for Single-Server Loss Queueing Systems
• Statistical analysis of queueing systems
• Packet loss characteristics for \(M/G/1/N\) queueing systems
• The general three-server queueing loss system: Discrete-time analysis
• scientific article; zbMATH DE number 4157645

zbMATH Keywords

order statisticsempirical distribution functionsKolmogorov distributionKolmogorov's statisticsstatistics of queues

Mathematics Subject Classification ID

Non-Markovian processes: estimation (62M09) Order statistics; empirical distribution functions (62G30) Queueing theory (aspects of probability theory) (60K25)

Cites Work

• Determining an adequate probe separation for estimating the arrival rate in an \(M/D/1\) queue using single-packet probing
• Title not available (Why is that?)
• Generalized convex inequalities
• Queueing output processes
• Optimal Control of a Large Dam
• Statistical analysis of queueing systems
• Estimating characteristics of queueing networks using transactional data
• On normal approximation for maximum likelihood estimation from single server queues
• Maximum likelihood estimation for single server queues from waiting time data
• Asymptotic analysis of the \(GI/M/1/n\) loss system as \(n\) increases to infinity
• On a property of a refusals stream
• Asymptotic Behavior of the Number of Lost Messages
• Complementary generating functions for theM^X/GI/1/kandGI/M^y/1/Kqueues and their application to the comparison of loss probabilities
• Nonparametric inference from the M/G/1 workload
• Continuity theorems for the \(M/M/1/n\) queueing system
• Takács' asymptotic theorem and its applications: a survey

Cited In (15)

• Moments of losses during busy-periods of regular and nonpreemptive oscillating \(M^X/G/1/n\) systems
• Statistical integration of Erlang's equations
• The distance between: an algorithmic approach to comparing stochastic models to time-series data
• Title not available (Why is that?)
• Loss bounds for a finite-capacity queue based on interval-wise traffic observation
• Stochastic Inequalities for Single-Server Loss Queueing Systems
• Packet loss characteristics for \(M/G/1/N\) queueing systems
• Distribution of the number of losses in busy-periods of oscillating \(M^X/G/1/(n,a,b)\) systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterization theorem on losses in \(GI^{X}/GI^{Y}/1/n\) queues
• Finding the minimum waiting losses in a single-server queuing system
• Title not available (Why is that?)
• Loss rates in the single-server queue with complete rejection

This page was built for publication: Statistical analysis of single-server loss queueing systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429996)