NCW(network centric warfare) is an information warfare concentrating on network. A global network-centric warfare architecture with OGSA grid technology is put forward,which is a four levels system including the user ...NCW(network centric warfare) is an information warfare concentrating on network. A global network-centric warfare architecture with OGSA grid technology is put forward,which is a four levels system including the user level, the application level, the grid middleware layer and the resource level. In grid middleware layer,based on virtual hosting environment, a BEPL4WS grid service composition method is introduced. In addition, the NCW grid service model is built with the help of Eclipse-SDK-3.0.1 and Bpws4j.展开更多
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.展开更多
The dissemination of information across various locations is an ubiquitous occurrence,however,prevalent methodologies for multi-source identification frequently overlook the fact that sources may initiate disseminatio...The dissemination of information across various locations is an ubiquitous occurrence,however,prevalent methodologies for multi-source identification frequently overlook the fact that sources may initiate dissemination at distinct initial moments.Although there are many research results of multi-source identification,the challenge of locating sources with varying initiation times using a limited subset of observational nodes remains unresolved.In this study,we provide the backward spread tree theorem and source centrality theorem,and develop a backward spread centrality algorithm to identify all the information sources that trigger the spread at different start times.The proposed algorithm does not require prior knowledge of the number of sources,however,it can estimate both the initial spread moment and the spread duration.The core concept of this algorithm involves inferring suspected sources through source centrality theorem and locating the source from the suspected sources with linear programming.Extensive experiments from synthetic and real network simulation corroborate the superiority of our method in terms of both efficacy and efficiency.Furthermore,we find that our method maintains robustness irrespective of the number of sources and the average degree of network.Compared with classical and state-of-the art source identification methods,our method generally improves the AUROC value by 0.1 to 0.2.展开更多
Ethernet fundamental and its data transmission model are introduced in brief and end-to-end network latency was analyzed in this paper. On the premise of not considering transmission quality and transmission cost, lat...Ethernet fundamental and its data transmission model are introduced in brief and end-to-end network latency was analyzed in this paper. On the premise of not considering transmission quality and transmission cost, latency was the function of the rest of network resource parameter (NRP). The relation between the number of nodes and that of end-to-end links was presented. In ethernet architecture, the algorithm to determine the link with the smallest latency is a polynomial issue when the number of network nodes is limited, so it can be solved by way of polynomial equations. Latency measuring is the key issue to determine the link with the smallest network latency. 3-node brigade (regiment) level network centric warfare (NCW) demonstration platform was studied and the latency between the detectors and weapon control stations was taken as an example. The algorithm of end-to-end network latency and link information in NCW was presented. The algorithm program based on Server/Client architecture was developed. The data transmission optimal link is one whose end-to-end latency is the smallest. This paper solves the key issue to determine the link whose end-to-end latency is the smallest in ethernet architecture. The study can be widely applied to determine the optimal link which is in the complex network environment of multiple service provision points.展开更多
Operation architecture plays a more important role in Network Centric Warfare(NGAV),which involves dynamic operation networks with complex properties.Thus,it is essential to investigate the operation architecture unde...Operation architecture plays a more important role in Network Centric Warfare(NGAV),which involves dynamic operation networks with complex properties.Thus,it is essential to investigate the operation architecture under the informatization condition within NCAW and find a proper network construction method to efficiently coordinate various functional modules on a particular situation,i.e.,the aerial combat.A new method integrating the physical level and functional level of NCW is proposed to establish the operation architecture,where the concept of network operation constraints unit and net constructing mechanisms are employed to avoid conflicts among different platforms.Meanwhile,we conduct simulations to assess the effectiveness and feasibility of the constructed operation architecture and analyze the influence of the network parameters.展开更多
文摘NCW(network centric warfare) is an information warfare concentrating on network. A global network-centric warfare architecture with OGSA grid technology is put forward,which is a four levels system including the user level, the application level, the grid middleware layer and the resource level. In grid middleware layer,based on virtual hosting environment, a BEPL4WS grid service composition method is introduced. In addition, the NCW grid service model is built with the help of Eclipse-SDK-3.0.1 and Bpws4j.
文摘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.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.62103375,62006106,61877055,and 62171413)the Philosophy and Social Science Planning Project of Zhejinag Province,China(Grant No.22NDJC009Z)+1 种基金the Education Ministry Humanities and Social Science Foundation of China(Grant No.19YJCZH056)the Natural Science Foundation of Zhejiang Province,China(Grant Nos.LY23F030003,LY22F030006,and LQ21F020005).
文摘The dissemination of information across various locations is an ubiquitous occurrence,however,prevalent methodologies for multi-source identification frequently overlook the fact that sources may initiate dissemination at distinct initial moments.Although there are many research results of multi-source identification,the challenge of locating sources with varying initiation times using a limited subset of observational nodes remains unresolved.In this study,we provide the backward spread tree theorem and source centrality theorem,and develop a backward spread centrality algorithm to identify all the information sources that trigger the spread at different start times.The proposed algorithm does not require prior knowledge of the number of sources,however,it can estimate both the initial spread moment and the spread duration.The core concept of this algorithm involves inferring suspected sources through source centrality theorem and locating the source from the suspected sources with linear programming.Extensive experiments from synthetic and real network simulation corroborate the superiority of our method in terms of both efficacy and efficiency.Furthermore,we find that our method maintains robustness irrespective of the number of sources and the average degree of network.Compared with classical and state-of-the art source identification methods,our method generally improves the AUROC value by 0.1 to 0.2.
基金Sponsored by Grand Preresearch Project Foundation of General Armament Department of the CPLAin the Tenth Five-year Plan (Grant No41306020202)the National Natural Science Foundation of China(Grant No60672150)
文摘Ethernet fundamental and its data transmission model are introduced in brief and end-to-end network latency was analyzed in this paper. On the premise of not considering transmission quality and transmission cost, latency was the function of the rest of network resource parameter (NRP). The relation between the number of nodes and that of end-to-end links was presented. In ethernet architecture, the algorithm to determine the link with the smallest latency is a polynomial issue when the number of network nodes is limited, so it can be solved by way of polynomial equations. Latency measuring is the key issue to determine the link with the smallest network latency. 3-node brigade (regiment) level network centric warfare (NCW) demonstration platform was studied and the latency between the detectors and weapon control stations was taken as an example. The algorithm of end-to-end network latency and link information in NCW was presented. The algorithm program based on Server/Client architecture was developed. The data transmission optimal link is one whose end-to-end latency is the smallest. This paper solves the key issue to determine the link whose end-to-end latency is the smallest in ethernet architecture. The study can be widely applied to determine the optimal link which is in the complex network environment of multiple service provision points.
基金fully supported by a grant from the National Natural Science Foundation of China(No.61472443)。
文摘Operation architecture plays a more important role in Network Centric Warfare(NGAV),which involves dynamic operation networks with complex properties.Thus,it is essential to investigate the operation architecture under the informatization condition within NCAW and find a proper network construction method to efficiently coordinate various functional modules on a particular situation,i.e.,the aerial combat.A new method integrating the physical level and functional level of NCW is proposed to establish the operation architecture,where the concept of network operation constraints unit and net constructing mechanisms are employed to avoid conflicts among different platforms.Meanwhile,we conduct simulations to assess the effectiveness and feasibility of the constructed operation architecture and analyze the influence of the network parameters.