Pregled bibliografske jedinice broj: 195873
A Heuristic Algorithm for Capacity Sizing of Fixed Routing Multiservice Erlang Loss Networks
A Heuristic Algorithm for Capacity Sizing of Fixed Routing Multiservice Erlang Loss Networks // Proceedings of the 12th International Conference on Analytical and Stochastic Modelling Techniques and Applications (ASMTA 2005) / Al-Begain, Khalid ; Bolch, Gunter ; Telek, Miklos (ur.).
Riga, 2005. str. 31-40 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 195873 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
A Heuristic Algorithm for Capacity Sizing of Fixed Routing Multiservice Erlang Loss Networks
Autori
Vrdoljak, Zdenko ; Kos, Mladen
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Proceedings of the 12th International Conference on Analytical and Stochastic Modelling Techniques and Applications (ASMTA 2005)
/ Al-Begain, Khalid ; Bolch, Gunter ; Telek, Miklos - Riga, 2005, 31-40
Skup
12th International Conference on Analytical and Stochastic Modelling Techniques and Applications
Mjesto i datum
Riga, Latvija, 01.05.2005. - 04.05.2005
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Capacity Sizing; multiservice loss network; reduced load approximation
Sažetak
This paper deals with optimum link capacity sizing in Erlang multiservice loss networks with fixed routing. The objective function is link capacity installation cost which is to be minimized subject to call blocking probability limits. We describe a new heuristic algorithm we use to find a close match solution to this optimization problem. The algorithm is based on knapsack reduced load approximation.
Izvorni jezik
Engleski
Znanstvena područja
Elektrotehnika
