A Heuristic Approach to Satellite Link Capacity Planning Applied in Mobile Networks
Abstract
The efficient heuristic algorithm for sizing of N satellite capacitytypes (on LES side of/ink) in mobile networks during exploitationis being developed, minimizing the total expansioncost. Using the network flow approach and the extreme flowthe01y many expansion solutions (sub-problems) are eliminatedfrom further calculation because they consist at least ofone flow that cannot be a part of optimal expansion sequence.At first, the heuristic algorithm is compared with algorithmbased on exact approach. In all numerical test-examples thebest possible result is achieved. After that we developed andtested some algorithm options, using various limitations for capacitystate values. It is obvious that all heuristic options areve1y effective and for some cases they are capable to find thebest possible result but with significant savings. It means thatour heuristic approach can be successfully applied to short-term or medium-term satellite network planning with finitenumber of discrete time periods. Only if we apply adequate heuristicsolution can we ensure both significant improvement ofQoS (Quality of Setvice) and minimal capacity expansion cost.References
Brimberg, J, and Love, F. R., Solving a Class of Two-Dimensional
Uncapacitated Location-Allocation Problems
by Dynamic Programming, Opnl. Res., 1998, Vol. 46(5),
pp. 702-709.
Krile S., Kos, M., Satellite Link Capacity Planning in
Mobile Networks, Proc. ICf'01, Bucharest, 2001,
pp.151-156.
Laguna, M., Applying Robust Optimization to Capacity
Expansion of One Location in Telecommunications
with Demand Uncertainty, Mgmt. Sci., 1998, Vol.
(11-2), pp. Sl01-S110.
Lee, Sang-Bum and Luss, H.,Mulifacility-Type Capacity
Expansion Planning: Algorithms and Complexities,
Opnl. Res., 1987, Vol. 35(2), pp. 249-253.
Luss, H.,A Multifacility Capacity Expansion Model with
Joint Expansion Set-Up Costs, Naval Research Logistic
Quart., 1983, Vol. 30, pp. 970-111.
Luss, H., A Heuristic for Capacity Expansion Planning
with Multiple Facility Types, Naval Res. Logistics
Quart., 1986, Vol. 33(04), pp. 685-701.
Rajagopalan, S., Capacity Expansion and Equipment
Replacement: A Unified Approach, Opnl. Res., 1998,
Vol. 46, pp. 846-857.
Suk-Gwon Chang and Gavish, B., Lower Bounding Procedures
for Multiperiod Telecommunications Network
Expansion Problems, Opnl. Res., 1995, Vol. 43 (1), pp.
-57.
Sutter A., Vanderbeck F. and Wolsey L., Optimal Placement
of Add/Drop Multiplexers: Heuristic and Exact
Algorithms, Opnl. Res., 1998, Vol. 46, pp. 719-728.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
