We propose a multiple-tree overlay structure for resource discovery in unstructured P2P systems. Peers that have similar interests or hold similar type of resources will be grouped into a tree-like cluster. We exploit...We propose a multiple-tree overlay structure for resource discovery in unstructured P2P systems. Peers that have similar interests or hold similar type of resources will be grouped into a tree-like cluster. We exploit the heterogeneity of peers in each cluster by connecting peers with more capacities closer to the root of the tree. The capacity of a peer can be defined in different ways （e.g. higher network bandwidth, larger disk space, more data items of a certain type etc.） according to different needs of users or applications.展开更多
Flooding is the most famous technique for locating contents in unstructured P2P networks. Recently traditional flooding has been replaced by more efficient dynamic query （DQ） and different variants of such algorithm...Flooding is the most famous technique for locating contents in unstructured P2P networks. Recently traditional flooding has been replaced by more efficient dynamic query （DQ） and different variants of such algorithms. Dynamic query is a new flooding technique which could estimate a proper time-to-live （TTL） value for a query flooding by estimating the popularity of the searched files, and retrieve sufficient results under controlled flooding range for reducing network traffic. However, all DQ-like search algorithms are ＂blind＂ so that a large amount of redundant messages are caused. In this paper, we proposed a new search scheme, called Immune Search Scheme （ISS）, to cope with this problem. In ISS, an immune systems inspired concept of similarity-governed clone proliferation and mutation for query message movement is applied. Some assistant strategies, that is, shortcuts creation and peer traveling are incorporated into ISS to develop ＂immune memory＂ for improving search performance, which can make ISS not be blind but heuristic.展开更多
Passive worms can passively propagate through embedding themselves into some sharing files, which can result in significant damage to unstructured P2P networks. To study the passive worm behaviors, this paper firstly ...Passive worms can passively propagate through embedding themselves into some sharing files, which can result in significant damage to unstructured P2P networks. To study the passive worm behaviors, this paper firstly analyzes and obtains the average delay for all peers in the whole transmitting process due to the limitation of network throughput, and then proposes a mathematical model for the propagation of passive worms over the unstructured P2P networks. The model mainly takes the effect of the network throughput into account, and applies a new healthy files dissemination-based defense strategy according to the file popularity which follows the Zipf distribution. The simulation results show that the propagation of passive worms is mainly governed by the number of hops, initially infected files and uninfected files. The larger the number of hops, the more rapidly the passive worms propagate. If the number of the initially infected files is increased by the attackers, the propagation speed of passive worms increases obviously. A larger size of the uninfected file results in a better attack performance. However, the number of files generated by passive worms is not an important factor governing the propagation of passive worms. The effectiveness of healthy files dissemination strategy is verified. This model can provide a guideline in the control of unstructured P2P networks as well as passive worm defense.展开更多
Although anonymizing Peer-to-Peer （P2P） networks often means extra cost in terms of transfer efficiency, many systems try to mask the identities of their users for privacy consideration. By comparison and analysis o...Although anonymizing Peer-to-Peer （P2P） networks often means extra cost in terms of transfer efficiency, many systems try to mask the identities of their users for privacy consideration. By comparison and analysis of existing approaches, we investigate the properties of unstructured P2P anonymity, and summarize current attack models on these designs. Most of these approaches are path-based, which require peers to pre-construct anonymous paths before transmission, thus suffering significant overhead and poor reliability. We also discuss the open problems in this field and propose several future research directions.展开更多
It is universally acknowledged by network security experts that proactive peer-to-peer (P2P) worms may soon en-gender serious threats to the Internet infrastructures. These latent threats stimulate activities of model...It is universally acknowledged by network security experts that proactive peer-to-peer (P2P) worms may soon en-gender serious threats to the Internet infrastructures. These latent threats stimulate activities of modeling and analysis of the proactive P2P worm propagation. Based on the classical two-factor model,in this paper,we propose a novel proactive worm propagation model in unstructured P2P networks (called the four-factor model) by considering four factors:(1) network topology,(2) countermeasures taken by Internet service providers (ISPs) and users,(3) configuration diversity of nodes in the P2P network,and (4) attack and defense strategies. Simulations and experiments show that proactive P2P worms can be slowed down by two ways:improvement of the configuration diversity of the P2P network and using powerful rules to reinforce the most connected nodes from being compromised. The four-factor model provides a better description and prediction of the proactive P2P worm propagation.展开更多
There is no unified planning standard for unstructured roads,and the morphological structures of these roads are complex and varied.It is important to maintain a balance between accuracy and speed for unstructured roa...There is no unified planning standard for unstructured roads,and the morphological structures of these roads are complex and varied.It is important to maintain a balance between accuracy and speed for unstructured road extraction models.Unstructured road extraction algorithms based on deep learning have problems such as high model complexity,high computational cost,and the inability to adapt to current edge computing devices.Therefore,it is best to use lightweight network models.Considering the need for lightweight models and the characteristics of unstructured roads with different pattern shapes,such as blocks and strips,a TMB(Triple Multi-Block)feature extraction module is proposed,and the overall structure of the TMBNet network is described.The TMB module was compared with SS-nbt,Non-bottleneck-1D,and other modules via experiments.The feasibility and effectiveness of the TMB module design were proven through experiments and visualizations.The comparison experiment,using multiple convolution kernel categories,proved that the TMB module can improve the segmentation accuracy of the network.The comparison with different semantic segmentation networks demonstrates that the TMBNet network has advantages in terms of unstructured road extraction.展开更多
Storm surge is often the marine disaster that poses the greatest threat to life and property in coastal areas.Accurate and timely issuance of storm surge warnings to take appropriate countermeasures is an important me...Storm surge is often the marine disaster that poses the greatest threat to life and property in coastal areas.Accurate and timely issuance of storm surge warnings to take appropriate countermeasures is an important means to reduce storm surge-related losses.Storm surge numerical models are important for storm surge forecasting.To further improve the performance of the storm surge forecast models,we developed a numerical storm surge forecast model based on an unstructured spherical centroidal Voronoi tessellation(SCVT)grid.The model is based on shallow water equations in vector-invariant form,and is discretized by Arakawa C grid.The SCVT grid can not only better describe the coastline information but also avoid rigid transitions,and it has a better global consistency by generating high-resolution grids in the key areas through transition refinement.In addition,the simulation speed of the model is accelerated by using the openACC-based GPU acceleration technology to meet the timeliness requirements of operational ensemble forecast.It only takes 37 s to simulate a day in the coastal waters of China.The newly developed storm surge model was applied to simulate typhoon-induced storm surges in the coastal waters of China.The hindcast experiments on the selected representative typhoon-induced storm surge processes indicate that the model can reasonably simulate the distribution characteristics of storm surges.The simulated maximum storm surges and their occurrence times are consistent with the observed data at the representative tide gauge stations,and the mean absolute errors are 3.5 cm and 0.6 h respectively,showing high accuracy and application prospects.展开更多
Peer to Peer网络(简称p2p)作为一种新型的覆盖网络引起了越来越多研究者的兴趣。本文介绍了在我国进行的骨干互联网上p2p网络流量测量。与现有国外研究不同,本文的数据来源于核心路由器,因此克服了它们的缺陷。其研究集中在汇聚流中的...Peer to Peer网络(简称p2p)作为一种新型的覆盖网络引起了越来越多研究者的兴趣。本文介绍了在我国进行的骨干互联网上p2p网络流量测量。与现有国外研究不同,本文的数据来源于核心路由器,因此克服了它们的缺陷。其研究集中在汇聚流中的3个周期性尖峰群、不同主机发送或接收流量的重尾分布、p2p流量的长相关特性以及提出了ADTE的估计方法来区分信令和数据流量。本文的研究也显示出Napster在p2p流中占大部分,这暗示着超级节点和阶层式拓扑较纯p2p结构潜在的优势。同时,观察到在我国p2p的流量仅占Internet总流量的1%弱,这个值跟国外的数据有很大区别。我们分析了其中的原因并希望该结论为我国p2p软件的发展提供参考。展开更多
An upwind scheme based on the unstructured mesh is developed to solve ideal 2-D magnetohydrodynamics （MHD） equations. The inviscid fluxes are approximated by using the modified advection upstream splitting method （...An upwind scheme based on the unstructured mesh is developed to solve ideal 2-D magnetohydrodynamics （MHD） equations. The inviscid fluxes are approximated by using the modified advection upstream splitting method （AUSM） scheme, and a 5-stage explicit Runge-Kutta scheme is adopted in the time integration. To avoid the influence of the magnetic field divergence created during the simulation, the hyperbolic divergence cleaning method is introduced. The shock-capturing properties of the method are verified by solving the MHD shock-tube problem. Then the 2-D nozzle flow with the magnetic field is numerically simulated on the unstructured mesh. Computational results demonstrate the effects of the magnetic field and agree well with those from references.展开更多
以小世界模型为理论基础,以 Region 为基本逻辑管理单位,按用户需求和共享目的组织 Region。提出了基于 Region 的多层结构 Peer-to-Peer 网络模型和构造规则,给出了 Region 的划分策略和数学模型,证明了模型的正确和合理性;对模型中的...以小世界模型为理论基础,以 Region 为基本逻辑管理单位,按用户需求和共享目的组织 Region。提出了基于 Region 的多层结构 Peer-to-Peer 网络模型和构造规则,给出了 Region 的划分策略和数学模型,证明了模型的正确和合理性;对模型中的层和域、中心节点、普通节点和汇聚点进行了明确的定义,给出了节点加入、离开、中心节点选取策略和算法描述;使定位某种服务的工作量和查询范围从网络中的所有结点数降低到 Region 的节点数,有效地防止了恶意请求引发的洪,网络系统开销为常数。模拟分析表明,该模型可有效解决可扩展性、性能与效率不高问题,且网络规模越大,其综合性能的优越性越明显,因此,模型是合理有效的。展开更多
基金Supported by the National High Technology Research and Development Program of China (2006AA10Z1E6)
文摘We propose a multiple-tree overlay structure for resource discovery in unstructured P2P systems. Peers that have similar interests or hold similar type of resources will be grouped into a tree-like cluster. We exploit the heterogeneity of peers in each cluster by connecting peers with more capacities closer to the root of the tree. The capacity of a peer can be defined in different ways （e.g. higher network bandwidth, larger disk space, more data items of a certain type etc.） according to different needs of users or applications.
基金Supported by the National Natural Science Foundation of China (90604012)
文摘Flooding is the most famous technique for locating contents in unstructured P2P networks. Recently traditional flooding has been replaced by more efficient dynamic query （DQ） and different variants of such algorithms. Dynamic query is a new flooding technique which could estimate a proper time-to-live （TTL） value for a query flooding by estimating the popularity of the searched files, and retrieve sufficient results under controlled flooding range for reducing network traffic. However, all DQ-like search algorithms are ＂blind＂ so that a large amount of redundant messages are caused. In this paper, we proposed a new search scheme, called Immune Search Scheme （ISS）, to cope with this problem. In ISS, an immune systems inspired concept of similarity-governed clone proliferation and mutation for query message movement is applied. Some assistant strategies, that is, shortcuts creation and peer traveling are incorporated into ISS to develop ＂immune memory＂ for improving search performance, which can make ISS not be blind but heuristic.
基金National Natural Science Foundation of China (No.60633020 and No. 90204012)Natural Science Foundation of Hebei Province (No. F2006000177)
文摘Passive worms can passively propagate through embedding themselves into some sharing files, which can result in significant damage to unstructured P2P networks. To study the passive worm behaviors, this paper firstly analyzes and obtains the average delay for all peers in the whole transmitting process due to the limitation of network throughput, and then proposes a mathematical model for the propagation of passive worms over the unstructured P2P networks. The model mainly takes the effect of the network throughput into account, and applies a new healthy files dissemination-based defense strategy according to the file popularity which follows the Zipf distribution. The simulation results show that the propagation of passive worms is mainly governed by the number of hops, initially infected files and uninfected files. The larger the number of hops, the more rapidly the passive worms propagate. If the number of the initially infected files is increased by the attackers, the propagation speed of passive worms increases obviously. A larger size of the uninfected file results in a better attack performance. However, the number of files generated by passive worms is not an important factor governing the propagation of passive worms. The effectiveness of healthy files dissemination strategy is verified. This model can provide a guideline in the control of unstructured P2P networks as well as passive worm defense.
文摘Although anonymizing Peer-to-Peer （P2P） networks often means extra cost in terms of transfer efficiency, many systems try to mask the identities of their users for privacy consideration. By comparison and analysis of existing approaches, we investigate the properties of unstructured P2P anonymity, and summarize current attack models on these designs. Most of these approaches are path-based, which require peers to pre-construct anonymous paths before transmission, thus suffering significant overhead and poor reliability. We also discuss the open problems in this field and propose several future research directions.
基金Project (No. 09511501600) partially supported by the Science and Technology Commission of Shanghai Municipality, China
文摘It is universally acknowledged by network security experts that proactive peer-to-peer (P2P) worms may soon en-gender serious threats to the Internet infrastructures. These latent threats stimulate activities of modeling and analysis of the proactive P2P worm propagation. Based on the classical two-factor model,in this paper,we propose a novel proactive worm propagation model in unstructured P2P networks (called the four-factor model) by considering four factors:(1) network topology,(2) countermeasures taken by Internet service providers (ISPs) and users,(3) configuration diversity of nodes in the P2P network,and (4) attack and defense strategies. Simulations and experiments show that proactive P2P worms can be slowed down by two ways:improvement of the configuration diversity of the P2P network and using powerful rules to reinforce the most connected nodes from being compromised. The four-factor model provides a better description and prediction of the proactive P2P worm propagation.
基金Supported by National Natural Science Foundation of China(Grant Nos.62261160575,61991414,61973036)Technical Field Foundation of the National Defense Science and Technology 173 Program of China(Grant Nos.20220601053,20220601030)。
文摘There is no unified planning standard for unstructured roads,and the morphological structures of these roads are complex and varied.It is important to maintain a balance between accuracy and speed for unstructured road extraction models.Unstructured road extraction algorithms based on deep learning have problems such as high model complexity,high computational cost,and the inability to adapt to current edge computing devices.Therefore,it is best to use lightweight network models.Considering the need for lightweight models and the characteristics of unstructured roads with different pattern shapes,such as blocks and strips,a TMB(Triple Multi-Block)feature extraction module is proposed,and the overall structure of the TMBNet network is described.The TMB module was compared with SS-nbt,Non-bottleneck-1D,and other modules via experiments.The feasibility and effectiveness of the TMB module design were proven through experiments and visualizations.The comparison experiment,using multiple convolution kernel categories,proved that the TMB module can improve the segmentation accuracy of the network.The comparison with different semantic segmentation networks demonstrates that the TMBNet network has advantages in terms of unstructured road extraction.
基金The National Natural Science Foundation of China under contract No.42076214.
文摘Storm surge is often the marine disaster that poses the greatest threat to life and property in coastal areas.Accurate and timely issuance of storm surge warnings to take appropriate countermeasures is an important means to reduce storm surge-related losses.Storm surge numerical models are important for storm surge forecasting.To further improve the performance of the storm surge forecast models,we developed a numerical storm surge forecast model based on an unstructured spherical centroidal Voronoi tessellation(SCVT)grid.The model is based on shallow water equations in vector-invariant form,and is discretized by Arakawa C grid.The SCVT grid can not only better describe the coastline information but also avoid rigid transitions,and it has a better global consistency by generating high-resolution grids in the key areas through transition refinement.In addition,the simulation speed of the model is accelerated by using the openACC-based GPU acceleration technology to meet the timeliness requirements of operational ensemble forecast.It only takes 37 s to simulate a day in the coastal waters of China.The newly developed storm surge model was applied to simulate typhoon-induced storm surges in the coastal waters of China.The hindcast experiments on the selected representative typhoon-induced storm surge processes indicate that the model can reasonably simulate the distribution characteristics of storm surges.The simulated maximum storm surges and their occurrence times are consistent with the observed data at the representative tide gauge stations,and the mean absolute errors are 3.5 cm and 0.6 h respectively,showing high accuracy and application prospects.
文摘Peer to Peer网络(简称p2p)作为一种新型的覆盖网络引起了越来越多研究者的兴趣。本文介绍了在我国进行的骨干互联网上p2p网络流量测量。与现有国外研究不同,本文的数据来源于核心路由器,因此克服了它们的缺陷。其研究集中在汇聚流中的3个周期性尖峰群、不同主机发送或接收流量的重尾分布、p2p流量的长相关特性以及提出了ADTE的估计方法来区分信令和数据流量。本文的研究也显示出Napster在p2p流中占大部分,这暗示着超级节点和阶层式拓扑较纯p2p结构潜在的优势。同时,观察到在我国p2p的流量仅占Internet总流量的1%弱,这个值跟国外的数据有很大区别。我们分析了其中的原因并希望该结论为我国p2p软件的发展提供参考。
文摘An upwind scheme based on the unstructured mesh is developed to solve ideal 2-D magnetohydrodynamics （MHD） equations. The inviscid fluxes are approximated by using the modified advection upstream splitting method （AUSM） scheme, and a 5-stage explicit Runge-Kutta scheme is adopted in the time integration. To avoid the influence of the magnetic field divergence created during the simulation, the hyperbolic divergence cleaning method is introduced. The shock-capturing properties of the method are verified by solving the MHD shock-tube problem. Then the 2-D nozzle flow with the magnetic field is numerically simulated on the unstructured mesh. Computational results demonstrate the effects of the magnetic field and agree well with those from references.
文摘以小世界模型为理论基础,以 Region 为基本逻辑管理单位,按用户需求和共享目的组织 Region。提出了基于 Region 的多层结构 Peer-to-Peer 网络模型和构造规则,给出了 Region 的划分策略和数学模型,证明了模型的正确和合理性;对模型中的层和域、中心节点、普通节点和汇聚点进行了明确的定义,给出了节点加入、离开、中心节点选取策略和算法描述;使定位某种服务的工作量和查询范围从网络中的所有结点数降低到 Region 的节点数,有效地防止了恶意请求引发的洪,网络系统开销为常数。模拟分析表明,该模型可有效解决可扩展性、性能与效率不高问题,且网络规模越大,其综合性能的优越性越明显,因此,模型是合理有效的。
