Journal of the Operational Research Society

, Volume 54, Issue 4, pp 401–409 | Cite as

Optimal routing in non-geostationary satellite ATM networks with intersatellite link capacity constraints

  • H Lee
  • D H Ahn
  • S Kim
Theoretical Paper


The trend toward broadband communications in space is foreseeable, and its features predestine ATM as the basic mode of operation. Some of the low and medium earth orbit satellite concepts make use of intersatellite links (ISLs) to provide global connectivity with minimal usage of terrestrial fixed network resources. Interconnecting neighbouring satellites with ISLs results in a partially meshed switching subnetwork in space. The ISLs have a time-varying distance or may even lose sight of each other. This feature of the ISL topology dynamics significantly increases the complexity of connection-oriented network operation and routing. We deal with the routing problem to minimize the virtual path connection handover rate and path delay in the time-varying ISL subnetwork topology with ISL capacity constraints. A heuristic algorithm is proposed to deal with this problem, which is based on Lagrangean relaxation and dynamic programming. When there is sufficient capacity at every ISL, the algorithm produces an optimal solution easily using only dynamic programming. For evaluation of our algorithm, some computational results have been presented. These results show that our optimization algorithm can produce a solution close to an optimal solution when there exist ISL capacity constraints.


telecommunication optimization Lagrangean relaxation dynamic programming satellite capacity constraints 


  1. Burgin J and Dorman D (1991). Broadband ISDN resource management: the role of virtual path. IEEE Commun Mag 29: 44–48.CrossRefGoogle Scholar
  2. Le Boudec JY (1992). The asynchronous transfer mode: a tutorial. Comput Networks ISDN systems 24: 279–309.CrossRefGoogle Scholar
  3. Werner M, John A, Luts E and Böttcher A (1995). Analysis of system parameters for LEO/ICO-satellite communication networks. IEEE J Sel Areas Commun 13: 371–381.CrossRefGoogle Scholar
  4. Maral G, De Ridder JJ, Evans BG and Richharia M (1991). Low earth orbit satellite systems for communications. Int J Satellite Commun 9: 209–225.CrossRefGoogle Scholar
  5. Binder R, Huffman SD, Gurants I and Vena PA (1987). Crosslink architectures for a multiple satellite system. Proc IEEE 75: 74–82.CrossRefGoogle Scholar
  6. Chakraborty D (1989). Survivable communication concept via multiple low earth-orbiting satellites. IEEE Trans Aerospace Electron Systems 25: 879–889.CrossRefGoogle Scholar
  7. Akyildiz IF and Jeong SH (1997). Satellite ATM networks: a survey. IEEE Commun Mag 35: 30–43.CrossRefGoogle Scholar
  8. Toh CK and Li VOK (1998). Satellite ATM network architecture. IEEE Network 11: 61–71.Google Scholar
  9. Werner M et al (1997). ATM-based routing in LEO/MEO satellite networks with intersatellite links. IEEE J Sel Areas Commun 15: 69–82.CrossRefGoogle Scholar
  10. Werner M, Mayer C, Maral G and Holzbok M (1998). A neural network approach to distributed adaptive routing of LEO intersatellite link traffic. Presented at the 48th IEEE International Conference on Vehicular Technology, Canada.Google Scholar
  11. Chang HS et al (1998). FSA-based link assignment and routing in low-earth orbit satellite networks. IEEE Trans Veh Technol 47: 1037–1048.CrossRefGoogle Scholar
  12. Fisher ML (1981). The Lagrangean relaxation method for solving integer programming problems. Mngt Sci 27: 1–18.CrossRefGoogle Scholar
  13. Geoffrion AM (1974). Lagrangean relaxation and its uses in integer programming. Math Programming Study 2: 82–114.CrossRefGoogle Scholar
  14. Denardo EV (1982). Dynamic Programming: Models and Application. Prentice-Hall: Englewood Cliffs, NJ.Google Scholar
  15. Polyak BT (1969). Minimization of unsmooth functionals. USSR Comput Math Math Phys 9: 14–29.CrossRefGoogle Scholar

Copyright information

© Palgrave Macmillan Ltd 2003

Authors and Affiliations

  1. 1.Mobile Telecommunication Research Laboratory, ETRIKorea
  2. 2.Radio and Broadcasting Technology Laboratory, ETRIKorea
  3. 3.Korea Advanced Institute of Science and TechnologyTaejonKorea

Personalised recommendations