Method of asymptotic semiinvariants for studying a mathematical model of a random access network

DOI10.1134/S0032946010010072zbMath1203.90041OpenAlexW2062367149MaRDI QIDQ619520

E. A. Sudyko, Anatoly Nazarov

Publication date: 25 January 2011

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

Full work available at URL: https://doi.org/10.1134/s0032946010010072

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Stochastic network models in operations research (90B15)

Related Items (6)

ASYMPTOTIC WAITING TIME ANALYSIS OF A FINITE-SOURCE M/M/1 RETRIAL QUEUEING SYSTEM ⋮ Asymptotic sojourn time analysis of finite-source M/M/\(1\) retrial queueing system with collisions and server subject to breakdowns and repairs ⋮ Research of dynamic RQ system M/M/1 with unreliable server ⋮ A Survey of Recent Results in Finite-Source Retrial Queues with Collisions ⋮ Comparative Analysis of Methods of Residual and Elapsed Service Time in the Study of the Closed Retrial Queuing System M/GI/1//N with Collision of the Customers and Unreliable Server ⋮ Asymptotic analysis of finite-source M/M/1 retrial queueing system with collisions and server subject to breakdowns and repairs

Cites Work

• Unnamed Item
• Analysis of a communication network with the adaptive ALOHA protocol for a finite number of stations under overload
• \(M/G/1/r\) retrial queueing systems with priority of primary customers.
• Local diffusion approximation of the state changing process of an unstable random access network in a neighborhood of the asymptotic mean
• Probabilistic-time characteristics of bistable random access networks
• Analysis of asymptotic average characteristics for non-Markovian models of unstable random access networks
• A service model in which the server is required to search for customers

This page was built for publication: Method of asymptotic semiinvariants for studying a mathematical model of a random access network