Pregled bibliografske jedinice broj: 91022
A Heuristic Approach to Satellite Link Capacity Planning Applied in Mobile Networks
A Heuristic Approach to Satellite Link Capacity Planning Applied in Mobile Networks // 23rd International Conference on Information Technology Interfaces - ITI '01 / Damir Kalpić, Vesna Hljuz Dobrić (ur.).
Zagreb: Sveučilišni računski centar Sveučilišta u Zagrebu (Srce), 2001. str. 331-338 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 91022 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
A Heuristic Approach to Satellite Link Capacity Planning Applied in Mobile Networks
Autori
Krile, Srećko ; Kos, Mladen
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
23rd International Conference on Information Technology Interfaces - ITI '01
/ Damir Kalpić, Vesna Hljuz Dobrić - Zagreb : Sveučilišni računski centar Sveučilišta u Zagrebu (Srce), 2001, 331-338
Skup
23th International Conferance on Information Technology Interfaces - ITI 2001
Mjesto i datum
Opatija, Hrvatska, 19.06.2001. - 22.06.2001
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
optimal capacity expansion; satellite link capacity planning
Sažetak
Taking into account continuous increase of traffic demands, it is necessary to increase satellite link capacity rationally. An efficient algorithm for sizing of N satellite links in mobile networks during exploitation is being developed, minimizing the total expansion cost. The capacity shortages are allowed so the problem is denoted as CEPS (Capacity Expansion Problem with Shortages). Using a network flow approach the paper develops all possible expansion solutions for SPEP (Single Period Expansion Problem) and properties of extreme point solution are identified. The extreme flow theory enables separation of these extreme flows which can be a part of an optimal expansion solution from those which cannot. With such heuristic approach it enables the optimal result, using significant less effort in programming and algorithm development. In the paper our heuristic algorithm is compared with algorithm based on exact approach through many numerical examples. It is obvious that is very effective, providing an optimal result with reasonable effort. The algorithm can be applied to short- or medium-term satellite network planning with finite number of discrete time periods.
Izvorni jezik
Engleski
Znanstvena područja
Tehnologija prometa i transport