Pages that link to "Item:Q4332105"
From MaRDI portal
The following pages link to Exact computation of time and call blocking probabilities in large, multi-traffic, multi-resource loss systems (Q4332105):
Displaying 6 items.
- Efficient blocking probability computation of complex traffic flows for network dimensioning (Q925826) (← links)
- Computational algorithms for blocking probabilities in circuit-switched networks (Q1197748) (← links)
- Exact and asymptotic solutions for models of new telecommunication services (Q1385379) (← links)
- Computing performance measures in a multi-class multi-resource processor-shared loss system (Q1577123) (← links)
- Properties of recurrent equations for the full-availability group with BPP traffic (Q1954907) (← links)
- Efficient decomposition methods for the analysis of multi-facility blocking models (Q4310839) (← links)