Probabilistic-time characteristics of bistable random access networks

DOI10.1134/S0005117906020056zbMath1126.60320OpenAlexW2091739844MaRDI QIDQ2457505

Yanyan Li

Publication date: 23 October 2007

Published in: Automation and Remote Control (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Analysis of a communication network with the adaptive ALOHA protocol for a finite number of stations under overload
• Non-Markovian models of communication networks with adaptive random multiple access protocols
• Discrete-time queueing systems and their application to analysis of optical-fiber communication networks
• Investigation of the phenomenon of bistability in satellite communication networks

This page was built for publication: Probabilistic-time characteristics of bistable random access networks