Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 91040

The Efficient Algorithm for Optimal Capacity Expansion of Satellite Links in Mobile Networks


Krile, Srećko
The Efficient Algorithm for Optimal Capacity Expansion of Satellite Links in Mobile Networks // Proceeding of International Conference on Trends in Communications - EUROCON '2001 / L. Mornar (ur.).
Bratislava, 2001. str. 345-348 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


CROSBI ID: 91040 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
The Efficient Algorithm for Optimal Capacity Expansion of Satellite Links in Mobile Networks

Autori
Krile, Srećko

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Proceeding of International Conference on Trends in Communications - EUROCON '2001 / L. Mornar - Bratislava, 2001, 345-348

Skup
International Conference on Trends in Communications - EUROCON '2001

Mjesto i datum
Bratislava, Slovačka, 04.06.2001. - 07.06.2001

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
mobile satellite networks optimal; capacity expansion; satellite link capacity planning

Sažetak
A deterministic expansion model for sizing of N satellite links in mobile networks during exploitation is being developed. The model is applied to short- or medium-term planning with finite number of discrete time periods. In the planning process it can help Land Earth Station Operator (LESO) to find the optimal capacity-expansion policy for new constructions and conversions of channel equipment that minimizes the total cost. The model for Capacity Expansion Problem with Shortages (CEPS) allows capacity conversions from one satellite link to another in both directions, but limitations can be imposed. Furthermore, upper bounds on shortages and idle capacities can be imposed. The traffic demand increments for additional capacity in any time period and for any link can be negative. All cost functions are assumed to be piecewise concave and non-decreasing away from zero. Using a network flow approach the paper develops an efficient dynamic-programming algorithm to minimize the total expansion cost. Heuristic algorithm is tested on many examples, and its efficiency is compared with algorithm based on exact approach.

Izvorni jezik
Engleski

Znanstvena područja
Tehnologija prometa i transport



POVEZANOST RADA


Projekti:
224005

Ustanove:
Sveučilište u Dubrovniku

Profili:

Avatar Url Srećko Krile (autor)


Citiraj ovu publikaciju:

Krile, Srećko
The Efficient Algorithm for Optimal Capacity Expansion of Satellite Links in Mobile Networks // Proceeding of International Conference on Trends in Communications - EUROCON '2001 / L. Mornar (ur.).
Bratislava, 2001. str. 345-348 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
Krile, S. (2001) The Efficient Algorithm for Optimal Capacity Expansion of Satellite Links in Mobile Networks. U: L. Mornar (ur.)Proceeding of International Conference on Trends in Communications - EUROCON '2001.
@article{article, author = {Krile, Sre\'{c}ko}, year = {2001}, pages = {345-348}, keywords = {mobile satellite networks optimal, capacity expansion, satellite link capacity planning}, title = {The Efficient Algorithm for Optimal Capacity Expansion of Satellite Links in Mobile Networks}, keyword = {mobile satellite networks optimal, capacity expansion, satellite link capacity planning}, publisherplace = {Bratislava, Slova\v{c}ka} }
@article{article, author = {Krile, Sre\'{c}ko}, year = {2001}, pages = {345-348}, keywords = {mobile satellite networks optimal, capacity expansion, satellite link capacity planning}, title = {The Efficient Algorithm for Optimal Capacity Expansion of Satellite Links in Mobile Networks}, keyword = {mobile satellite networks optimal, capacity expansion, satellite link capacity planning}, publisherplace = {Bratislava, Slova\v{c}ka} }




Contrast
Increase Font
Decrease Font
Dyslexic Font