论文部分内容阅读
卫星网络中的服务质量(QoS,Quality of Service)多目标约束路由问题已被证明是一个非确定性多项式完全(NPC,Non-deterministic Polynomial Complete)问题.根据低轨(LEO,Low Earth Orbit)卫星网络拓扑变化有规律、可预知的特点,将Groebner基方法引入满足QoS多目标约束的路由算法中,应用算法前将QoS多目标约束问题转化为单目标约束问题,使它能够被多项式的最短路径优先(SPF,Shortest Path First)路由算法求解,从而通过Groebner基方法解决QoS多目标约束路由问题,保证了QoS参数的有效性.最后,将所提出的算法与启发式算法和最短路径优先算法进行了仿真比较.仿真实验结果表明,Groebner基方法有效降低了星上计算的难度,比传统方法能提供更好的QoS保证.
Quality of Service (QoS) in satellite networks The multi-objective constrained routing problem has been proved to be a Non-deterministic Polynomial Complete (NPC) problem. According to the LEO (Low Earth Orbit) satellite The topology change of network is regular and predictable. The Groebner-based method is introduced into the routing algorithm that satisfies the QoS multi-objective constraints. Before applying the algorithm, the multi-objective constrained QoS problem can be transformed into a single-objective constrained problem so that it can be replaced by the polynomial shortest path (SPF, Shortest Path First) routing algorithm to solve the QoS multi-objective constrained routing problem through Groebner-based method to ensure the validity of the QoS parameters.Finally, the proposed algorithm is compared with the heuristic algorithm and the shortest path first algorithm The simulation results show that the Groebner-based method can effectively reduce the computational complexity of the satellite and provide better QoS guarantee than the traditional method.