ATM-Based Routing in LEO/MEO Satellite Networks with Intersatellite Links
ATM-Based Routing in LEO/MEO Satellite Networks with Intersatellite Links
复制标题
DOI：
10.1109/49.553679
复制
发表时间：
1997
期刊：
影响因子：
--
通讯作者：
M. Werner;C. Delucchi;Hans-Jörg Vögel;G. Maral;Jean-Jacques De Ridder
中科院分区：
文献类型：
--
作者：
M. Werner;C. Delucchi;Hans-Jörg Vögel;G. Maral;Jean-Jacques De Ridder
提出了一种基于异步传输模式(ATM)的低地球轨道/中地球轨道(LEO/MEO)卫星系统中包含星间链路(ISL)的信息路由概念。重点介绍了系统ISL部分基于ATM的路由方案的设计。该方法是通过预先将ISL子网络中的所有端节点对连接一整段时间的虚拟路径连接(VPC)来准备虚拟拓扑，类似于实现一组(依赖于时间的)路由表。在ISL网络中搜索可用的端到端路由是基于能够应对时变拓扑的改进的Dijkstra(1959)最短路径算法(M-DSPA)。对于所考虑的ISL拓扑的确定性时间变化，给出了在呼叫建立时间选择路径的优化方面的分析。通过广泛的模拟，分别评估路径搜索与特定优化过程相结合的性能，例如LEO和MEO ISL拓扑。
An asynchronous transfer mode (ATM)-based concept for the routing of information in a low Earth orbit/medium Earth orbit (LEO/MEO) satellite system including intersatellite links (ISLs) is proposed. Specific emphasis is laid on the design of an ATM-based routing scheme for the ISL part of the system. The approach is to prepare a virtual topology by means of virtual path connections (VPCs) connecting all pairs of end nodes in the ISL subnetwork for a complete period in advance, similar to implementing a set of (time dependent) routing tables. The search for available end-to-end routes within the ISL network is based on a modified Dijkstra (1959) shortest path algorithm (M-DSPA) capable of coping with the time-variant topology. With respect to the deterministic time variance of the considered ISL topologies, an analysis of optimization aspects for the selection of a path at call setup time is presented. The performance of the path search in combination with a specific optimization procedure is-by means of extensive simulations-evaluated for example LEO and MEO ISL topologies, respectively.