Performance evaluation of adaptive routing algorithms in packet-switched intersatellite link networks

Int. J. Satell. Commun. Netw. Pub Date : 2002-03-01 DOI:10.1002/sat.714

M. Mohorčič, A. Švigelj, G. Kandus, M. Werner

{"title":"Performance evaluation of adaptive routing algorithms in packet-switched intersatellite link networks","authors":"M. Mohorčič, A. Švigelj, G. Kandus, M. Werner","doi":"10.1002/sat.714","DOIUrl":null,"url":null,"abstract":"This paper addresses the performance evaluation of adaptive routing algorithms in non-geostationary packet-switched satellite communication systems. The dynamic topology of satellite networks and variable traffic load in satellite coverage areas, due to the motion of satellites in their orbit planes, pose stringent requirements to routing algorithms. We have limited the scope of our interest to routing in the intersatellite link (ISL) segment. In order to analyse the applicability of different routing algorithms used in terrestrial networks, and to evaluate the performance of new algorithms designed for satellite networks, we have built a simulation model of a satellite communication system with intersatellite links. In the paper, we present simulation results considering a network-uniform source/destination distribution model and a uniform source–destination traffic flow, thus showing the inherent routing characteristics of a selected Celestri-like LEO satellite constellation. The updates of the routing tables are centrally calculated according to the Dijkstra shortest path algorithm. Copyright © 2002 John Wiley & Sons, Ltd.","PeriodicalId":270161,"journal":{"name":"Int. J. Satell. Commun. Netw.","volume":"207 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Satell. Commun. Netw.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/sat.714","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 32

Abstract

This paper addresses the performance evaluation of adaptive routing algorithms in non-geostationary packet-switched satellite communication systems. The dynamic topology of satellite networks and variable traffic load in satellite coverage areas, due to the motion of satellites in their orbit planes, pose stringent requirements to routing algorithms. We have limited the scope of our interest to routing in the intersatellite link (ISL) segment. In order to analyse the applicability of different routing algorithms used in terrestrial networks, and to evaluate the performance of new algorithms designed for satellite networks, we have built a simulation model of a satellite communication system with intersatellite links. In the paper, we present simulation results considering a network-uniform source/destination distribution model and a uniform source–destination traffic flow, thus showing the inherent routing characteristics of a selected Celestri-like LEO satellite constellation. The updates of the routing tables are centrally calculated according to the Dijkstra shortest path algorithm. Copyright © 2002 John Wiley & Sons, Ltd.

查看原文本刊更多论文

分组交换卫星间链路网络中自适应路由算法的性能评价

研究了非静止卫星分组交换通信系统中自适应路由算法的性能评价。卫星网络的动态拓扑结构和卫星覆盖区域内由于卫星在轨道平面内的运动而产生的流量负荷变化，对路由算法提出了严格的要求。我们已经将我们的兴趣范围限制在卫星间链路(ISL)段的路由上。为了分析不同路由算法在地面网络中的适用性，并评估新算法在卫星网络中的性能，我们建立了具有星间链路的卫星通信系统的仿真模型。在本文中，我们给出了考虑网络均匀源/目的分布模型和均匀源-目的通信流的仿真结果，从而显示了选定的类celestri LEO卫星星座的固有路由特性。根据Dijkstra最短路径算法集中计算路由表的更新。版权所有©2002约翰威利父子有限公司

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Int. J. Satell. Commun. Netw.

自引率

0.00%

发文量