Properties of recurrent equations for the full-availability group with BPP traffic

DOI10.1155/2012/547909zbMath1264.68014OpenAlexW2008505067WikidataQ58912074 ScholiaQ58912074MaRDI QIDQ1954907

Maciej Stasiak, Joanna Weissenberg, Mariusz Głąbowski

Publication date: 11 June 2013

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/547909

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items

Modelling of cellular networks with traffic overflow

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Loss networks
• Computational algorithms for blocking probabilities in circuit-switched networks
• Algorithms to determine exact blocking probabilities for multirate tree networks
• Blocking probabilities in multitraffic loss systems: insensitivity, asymptotic behavior, and approximations
• Blocking with retrials in a completely shared resource environment
• A Multi-User-Class, Blocked-Calls-Cleared, Demand Access Model
• An approximate model of a switching network carrying mixture of different multichannel traffic streams
• Exact computation of time and call blocking probabilities in large, multi-traffic, multi-resource loss systems