Self-averaging property of queuing systems

DOI10.1134/S0032946006040077zbMATH Open1237.60073arXivmath/0510046OpenAlexW2018990836MaRDI QIDQ415695FDOQ415695

Authors: Alexander Vladimirov, A. N. Rybko, S. B. Shlosman 

Publication date: 9 May 2012

Published in: Problems of Information Transmission (Search for Journal in Brave)

Abstract: We establish the averaging property for a queuing process with one server, M(t)/GI/1. It is a new relation between the output flow rate and the input flow rate, crucial in the study of the Poisson Hypothesis. Its implications include the statement that the output flow always possesses more regularity than the input flow.

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

Recommendations

• Mean characteristics of Markov queueing systems
• Asymptotic distribution of the queue length in a queueing system
• scientific article; zbMATH DE number 27027
• Ergodicity of queuing networks
• Queuing systems with semi-Markov flow in average and diffusion approximation schemes
• Asymptotic stationarity of queueing processes
• scientific article; zbMATH DE number 3858811
• scientific article; zbMATH DE number 786526
• Large deviations in some queueing systems

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Cites Work

• Poisson hypothesis for information networks. I
• Title not available (Why is that?)
• Which properties of a random sequence are dynamically sensitive?
• Poisson hypothesis: combinatorial aspect
• On the rod placement theorem of Rybko and Shlosman

Cited In (2)

• On mathematical models of the service networks
• Spontaneous resonances and the coherent states of the queuing networks

This page was built for publication: Self-averaging property of queuing systems

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