本文首先分析了多层卫星路由研究的现状,指出当前环境下多层卫星路由算法研究的重点在路由的层次化和分层处理。针对现有路由算法在Qo S(Quality of Service)性能上的局限,在此基础上提出了基于流量工程的最小链路代价多层卫星路由算法T...本文首先分析了多层卫星路由研究的现状,指出当前环境下多层卫星路由算法研究的重点在路由的层次化和分层处理。针对现有路由算法在Qo S(Quality of Service)性能上的局限,在此基础上提出了基于流量工程的最小链路代价多层卫星路由算法TE-MSP(Traffic Engineering-Minimizing Sum of Path-cost),建立了流量模型和链路代价公式,并通过仿真验证了该算法能在繁忙时起到12%的分流效果、并减少23%的链路花费。展开更多
Routing, modulation and spectrum allocation in elastic optical networks is a problem aiming at increasing the capacity of the network. Many algorithms such as shortest path algorithm can be used as the routing section...Routing, modulation and spectrum allocation in elastic optical networks is a problem aiming at increasing the capacity of the network. Many algorithms such as shortest path algorithm can be used as the routing section of this problem. The efficiency of these algorithms is partly based on how the cost of each link is defined. In this study, we considered several basic metrics in cost of network links and compared their effects on the network capacity. In particular, the static costs and the dynamic costs were evaluated and compared. For dynamic scenarios, compared to static scenarios, at least one additional factor, the usage of the links, was added. We further considered a new factor that is based on probability of accommodating the signal at a given time in any given link. The results show that, among them, the shortest path algorithm provides the least blocking probability when the cost is a combination of link length and the abovementioned possibility/usage of the link.展开更多
Ad Hoc网络中如何设计良好的路由协议使其网络均衡是当今研究的重点。针对网络负载和能量均衡等问题,提出了一种基于代价函数的改进按需距离矢量路由协议CF-AODV。该协议在路由建立过程中,通过能量阈值和缓存队列长度阈值进行RREQ转发判...Ad Hoc网络中如何设计良好的路由协议使其网络均衡是当今研究的重点。针对网络负载和能量均衡等问题,提出了一种基于代价函数的改进按需距离矢量路由协议CF-AODV。该协议在路由建立过程中,通过能量阈值和缓存队列长度阈值进行RREQ转发判断;在目的节点选取路由时采用延迟应答方案,通过以路径长短、路径负载、路径剩余能量作为因子的代价函数进行判决来选取最佳路径。仿真结果表明,所提协议在网络负载和能量上得到了均衡,可以延长网络寿命,减轻网络拥塞,减少时延和丢包率。展开更多
文摘本文首先分析了多层卫星路由研究的现状,指出当前环境下多层卫星路由算法研究的重点在路由的层次化和分层处理。针对现有路由算法在Qo S(Quality of Service)性能上的局限,在此基础上提出了基于流量工程的最小链路代价多层卫星路由算法TE-MSP(Traffic Engineering-Minimizing Sum of Path-cost),建立了流量模型和链路代价公式,并通过仿真验证了该算法能在繁忙时起到12%的分流效果、并减少23%的链路花费。
文摘Routing, modulation and spectrum allocation in elastic optical networks is a problem aiming at increasing the capacity of the network. Many algorithms such as shortest path algorithm can be used as the routing section of this problem. The efficiency of these algorithms is partly based on how the cost of each link is defined. In this study, we considered several basic metrics in cost of network links and compared their effects on the network capacity. In particular, the static costs and the dynamic costs were evaluated and compared. For dynamic scenarios, compared to static scenarios, at least one additional factor, the usage of the links, was added. We further considered a new factor that is based on probability of accommodating the signal at a given time in any given link. The results show that, among them, the shortest path algorithm provides the least blocking probability when the cost is a combination of link length and the abovementioned possibility/usage of the link.
