东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2004, Vol. 25 ›› Issue (10): 923-926.DOI: -

• 论著 • 上一篇    下一篇

LEO/MEO卫星网络中一种抗毁路由算法

王亚沙;李冬妮;冯金;王光兴   

  1. 东北大学信息科学与工程学院;东北大学信息科学与工程学院;东北大学信息科学与工程学院;东北大学信息科学与工程学院 辽宁沈阳　110004
  • 收稿日期:2013-06-24 修回日期:2013-06-24 出版日期:2004-10-15 发布日期:2013-06-24
  • 通讯作者: Li, D.-N.
  • 作者简介:-
  • 基金资助:
    国家高技术研究发展计划项目(2002AA784030)

Destruction-resistant routing algorithm in LEO/MEO satellite networks

Wang, Ya-Sha (1); Li, Dong-Ni (1); Feng, Jin (1); Wang, Guang-Xing (1)   

  1. (1) Res. Ctr. for Network and Commun., Northeastern Univ., Shenyang 110004, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2004-10-15 Published:2013-06-24
  • Contact: Li, D.-N.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

766

摘要： 提出了一种基于ATM(AsynchronousTransferMode,异步转移模式)技术的抗毁路由算法·该算法通过VPC(VirtualPathConnection,虚通路连接)将卫星网虚拟成一个全连接网络,根据空间位置将卫星网络划分为若干个可动态重组的簇,由簇首维护本簇内的实时拓扑信息·当星际链路出现故障时,簇首将尽量在本簇范围内重建VPC,如果无法重建则将重建请求和本簇拓扑信息扩散到相邻簇首,就在更大的已知拓扑范围内完成VPC重建工作·在Iridium(铱星)系统模型上对该算法的信令开销、有效性进行的仿真结果显示,扩散抗毁路由算法可以绕开故障的星际链路,提高系统抗毁性,而且寻路开销也较之...

关键词: ATM, LEO/MEO卫星网络, 星际链路, 抗毁性, 路由

Abstract: Proposes a destruction-resistant routing algorithm based on ATM (Asynchronous Transfer Mode) technology in LEO/MEO networks, of which the satellite network is virtualized as a fully connected network and divided into several clusters that can be regrouped according to satellites' position. The real-time topology information within a cluster is maintained by the clusterhead. When some intersatellite links fail, the clusterhead will try its best to rebuild the broken VPC (Virtual Path Connection) within the cluster, and, when fails once more, the clusterhead will diffuse the request for rebuilding VPC and the topology information on its own cluster to its neighboring clusterheads, so as to rebuild a VPC within a larger extent of known topology. The simulation result on Iridium system model shows that the diffused destruction-resistant routing algorithm can not only make the system stronger by avoiding the broken ISLs but also greatly reduce the path-finding overheads in comparison with OSPF (Open Shortest Path First) algorithm.

中图分类号: