Due to the diversified demands of quality of service（QoS） in volume multimedia application, QoS routings for multiservice are becoming a research hotspot in low earth orbit（LEO） satellite networks. A novel QoS sat...Due to the diversified demands of quality of service（QoS） in volume multimedia application, QoS routings for multiservice are becoming a research hotspot in low earth orbit（LEO） satellite networks. A novel QoS satellite routing algorithm for multi-class traffic is proposed. The goal of the routing algorithm is to provide the distinct QoS for different traffic classes and improve the utilization of network resources. Traffic is classified into three classes and allocated priorities based on their QoS requirements, respectively. A priority queuing mechanism guarantees the algorithm to work better for high-priority classes. In order to control the congestion, a blocking probability analysis model is built up based on the Markov process theory. Finally, according to the classification link-cost metrics, routings for different classes are calculated with the distinct QoS requirments and the status of network resource. Simulations verify the performance of the routing algorithm at different time and in different regions, and results demonstrate that the algorithm has great advantages in terms of the average delay and the blocking probability. Meanwhile, the robustness issue is also discussed.展开更多
The concept of network centric warfare （NCW） and the distributed equal-node network architecture in NCW are introduced in this paper. The data flow requirement model in NCW is presented. Based on synthetic analysis ...The concept of network centric warfare （NCW） and the distributed equal-node network architecture in NCW are introduced in this paper. The data flow requirement model in NCW is presented. Based on synthetic analysis of network resource, the QOS （Quality of Service） parameters and their characters, the high requirement of real-time synchronization in NCW, the single QOS routing constraint, and the network latency between the detector and weapon control station, are presented. To take an example for 3-node brigade （regiment） level NCW demonstration platform, the algorithm of end-to-end network latency and path information in NCW are presented. The algorithm program based on Server/Client architecture is developed. The optimal path is the link whose latency between the detector and weapon control station is the smallest. This paper solves the key issue and satisfies the needs on network latency in NCW. The study results can be widely applied in the decision of the optimal path which is based on multiple service provision points.展开更多
In order to share multimedia transmissions in mesh networks and optimize the utilization of network resources, this paper presents a Two-stage Evolutionary Algorithm (TEA), i.e., unicast routing evolution and multicas...In order to share multimedia transmissions in mesh networks and optimize the utilization of network resources, this paper presents a Two-stage Evolutionary Algorithm (TEA), i.e., unicast routing evolution and multicast path composition, for dynamic multicast routing. The TEA uses a novel link-duplicate-degree encoding, which can encode a multicast path in the link-duplicate-degree and decode the path as a link vector easily. A dynamic algorithm for adding nodes to or removing nodes from a multicast group and a repairing algorithm are also covered in this paper. As the TEA is based on global evaluation, the quality of the multicast path remains stabilized without degradation when multicast members change over time. Therefore, it is not necessary to rearrange the multicast path during the life cycle of the multicast sessions. Simulation results show that the TEA is efficient and convergent.展开更多
下一代互联网NGI(Next Generation Internet)需要提供服务质量QoS(Quality of Service)路由能力,支持总最佳连接ABC(Always Best Connected).但是,由于链路状态的难以精确测量与用户QoS需求的难以准确表达,因此QoS路由基于的信息实际上...下一代互联网NGI(Next Generation Internet)需要提供服务质量QoS(Quality of Service)路由能力,支持总最佳连接ABC(Always Best Connected).但是,由于链路状态的难以精确测量与用户QoS需求的难以准确表达,因此QoS路由基于的信息实际上是模糊的.同时,在网络运营日益商业化的环境下,支持ABC需要兼顾用户和网络提供方利益,考虑双方效用共赢.为此,文中引入模糊数学、概率论和博弈论知识,设计了一种ABC支持型QoS单播路由机制.该机制采用区间形式描述用户QoS需求和边(链路)参数,引入用户满意度和边评价,通过博弈分析,基于人工鱼群算法,寻找使用户和网络提供方效用达到或接近Nash均衡下Pareto最优的QoS单播路径.仿真结果表明,该机制是可行和有效的.展开更多
基金Supported by the National High Technology Research and Development Program of China(″863″Program)(2010AAxxx404)~~
文摘Due to the diversified demands of quality of service（QoS） in volume multimedia application, QoS routings for multiservice are becoming a research hotspot in low earth orbit（LEO） satellite networks. A novel QoS satellite routing algorithm for multi-class traffic is proposed. The goal of the routing algorithm is to provide the distinct QoS for different traffic classes and improve the utilization of network resources. Traffic is classified into three classes and allocated priorities based on their QoS requirements, respectively. A priority queuing mechanism guarantees the algorithm to work better for high-priority classes. In order to control the congestion, a blocking probability analysis model is built up based on the Markov process theory. Finally, according to the classification link-cost metrics, routings for different classes are calculated with the distinct QoS requirments and the status of network resource. Simulations verify the performance of the routing algorithm at different time and in different regions, and results demonstrate that the algorithm has great advantages in terms of the average delay and the blocking probability. Meanwhile, the robustness issue is also discussed.
文摘The concept of network centric warfare （NCW） and the distributed equal-node network architecture in NCW are introduced in this paper. The data flow requirement model in NCW is presented. Based on synthetic analysis of network resource, the QOS （Quality of Service） parameters and their characters, the high requirement of real-time synchronization in NCW, the single QOS routing constraint, and the network latency between the detector and weapon control station, are presented. To take an example for 3-node brigade （regiment） level NCW demonstration platform, the algorithm of end-to-end network latency and path information in NCW are presented. The algorithm program based on Server/Client architecture is developed. The optimal path is the link whose latency between the detector and weapon control station is the smallest. This paper solves the key issue and satisfies the needs on network latency in NCW. The study results can be widely applied in the decision of the optimal path which is based on multiple service provision points.
文摘In order to share multimedia transmissions in mesh networks and optimize the utilization of network resources, this paper presents a Two-stage Evolutionary Algorithm (TEA), i.e., unicast routing evolution and multicast path composition, for dynamic multicast routing. The TEA uses a novel link-duplicate-degree encoding, which can encode a multicast path in the link-duplicate-degree and decode the path as a link vector easily. A dynamic algorithm for adding nodes to or removing nodes from a multicast group and a repairing algorithm are also covered in this paper. As the TEA is based on global evaluation, the quality of the multicast path remains stabilized without degradation when multicast members change over time. Therefore, it is not necessary to rearrange the multicast path during the life cycle of the multicast sessions. Simulation results show that the TEA is efficient and convergent.
文摘下一代互联网NGI(Next Generation Internet)需要提供服务质量QoS(Quality of Service)路由能力,支持总最佳连接ABC(Always Best Connected).但是,由于链路状态的难以精确测量与用户QoS需求的难以准确表达,因此QoS路由基于的信息实际上是模糊的.同时,在网络运营日益商业化的环境下,支持ABC需要兼顾用户和网络提供方利益,考虑双方效用共赢.为此,文中引入模糊数学、概率论和博弈论知识,设计了一种ABC支持型QoS单播路由机制.该机制采用区间形式描述用户QoS需求和边(链路)参数,引入用户满意度和边评价,通过博弈分析,基于人工鱼群算法,寻找使用户和网络提供方效用达到或接近Nash均衡下Pareto最优的QoS单播路径.仿真结果表明,该机制是可行和有效的.
