1989/01/01 by Ian F. Akyildiz · 1 citation
Business, Management and Accounting · Decision Sciences · Engineering · Mathematics · #Advanced Queuing Theory Analysis #Advanced Wireless Network Optimization #Algorithm #Blocking (statistics) #Computer network #Computer science #Markov chain #Markov process #Mathematical optimization #Mathematics #Probability and Risk Models #Product (mathematics) #Queueing theory #Server #State (computer science) #State space #Telecommunications #Theoretical computer science #Throughput #Transformation (genetics) #Type (biology)
paper · doi:10.1109/12.8732
openalex publication_date 1989/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
It is shown that the equilibrium-state probabilities for this type of blocking queuing network have an approximate product-form solution, which is based on normalizing the infeasible states that violate station capacities. To obtain the throughput values, a state-space transformation is introduced. This concept is based on finding a nonblocking network with an appropriate total number of jobs of which the number of feasible states is equal or approximately equal to the number of feasible states in the blocking queuing network. This guarantees that the Markov processes describing the evolution networks over time have approximately the same structure, so the throughputs of both systems are approximately equal. The approximations are validated by executing several examples and comparing them with simulation results.>