首页 | 官方网站   微博 | 高级检索  
     

卫星网络中基于最小中断概率的时延受限路由算法
引用本文:张 涛,柳重堪,张 军.卫星网络中基于最小中断概率的时延受限路由算法[J].通信学报,2006,27(8):18-24.
作者姓名:张 涛  柳重堪  张 军
作者单位:北京航空航天大学,电子信息工程学院,北京,100083
摘    要:针对卫星网络链路时延长和拓扑时变的特点,给出一种可满足时延限制且在业务持续时间内尽可能不发生中断的时延受限最优寻路(SDCOP)算法,该算法通过预测拓扑链接情况来有效降低链路切换对网络QoS的影响,且具有计算复杂度低,可适应星上设备处理能力的要求等优点。仿真表明算法在计算复杂性、业务阻塞率以及业务中断率方面都优于同类算法。

关 键 词:卫星网络  服务质量路由  时延受限  路由算法
文章编号:1000-436X(2006)08-0018-07
收稿时间:2005-04-15
修稿时间:2005-06-10

Delay constraint minimum interruption routingalgorithm for mobile satellite network
ZHANG Tao,LIU Zhong-kan,ZHANG Jun.Delay constraint minimum interruption routingalgorithm for mobile satellite network[J].Journal on Communications,2006,27(8):18-24.
Authors:ZHANG Tao  LIU Zhong-kan  ZHANG Jun
Affiliation:School of Electronics and Information Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100083, China
Abstract:By the analysis of the characteristics of mobile satellite network,such as a long delay and a topological time-varying,a novel satellite network delay constraint optimal path(SDCOP)algorithm,which could obtain a path to sat-isfy the delay constraint condition as well as the minimization of interruption during the service,was proposed.This algo-rithm exploits the predictive nature of connectivity changes of time-varying topological to decrease the influence in the QoS routing performance caused by the handover.Besides,it has a low computing complexity to adapt to the restricted computing capability of satellite equipments.Correlative simulation indicates that this novel algorithm is superior to other current algo-rithm in respect of computing complexity,service blocking probability and interrupting probability etc.
Keywords:satellite networks  QoS routing  delay constrained  routing algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《通信学报》浏览原始摘要信息
点击此处可从《通信学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号