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.展开更多
To utilizing the characteristic of radar cross section(RCS) of the low detectable aircraft,a special path planning algorithm to eluding radars by the variable RCS is presented.The algorithm first gives the RCS changin...To utilizing the characteristic of radar cross section(RCS) of the low detectable aircraft,a special path planning algorithm to eluding radars by the variable RCS is presented.The algorithm first gives the RCS changing model of low detectable aircraft,then establishes a threat model of a ground-based air defense system according to the relations between RCS and the radar range coverage.By the new cost functions of the flight path, which consider both factors of the survival probability and the distance of total route,this path planning method is simulated based on the Dijkstra algorithm,and the planned route meets the flight capacity constraints.Simulation results show that using the effective path planning algorithm,the low detectable aircraft can give full play to its own advantage of stealth to achieve the purpose of silent penetration.展开更多
文摘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.
文摘To utilizing the characteristic of radar cross section(RCS) of the low detectable aircraft,a special path planning algorithm to eluding radars by the variable RCS is presented.The algorithm first gives the RCS changing model of low detectable aircraft,then establishes a threat model of a ground-based air defense system according to the relations between RCS and the radar range coverage.By the new cost functions of the flight path, which consider both factors of the survival probability and the distance of total route,this path planning method is simulated based on the Dijkstra algorithm,and the planned route meets the flight capacity constraints.Simulation results show that using the effective path planning algorithm,the low detectable aircraft can give full play to its own advantage of stealth to achieve the purpose of silent penetration.
