The chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as multiobjective and parametric optimization, computa...
详细信息
The chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as multiobjective and parametric optimization, computational geometry, and graphics. We analyze the performance of the chord algorithm, as compared to the optimal approximation that achieves a desired accuracy with the minimum number of points. We prove sharp upper and lower bounds, both in the worst case and average case settings.
Due to the rapid development of network communication technology, Vehicle ad-hoc Network(VANET) has become a hot topic. However, the information transmission in VANET is a challenge due to the vehicle moving speed, wh...
详细信息
ISBN:
(纸本)9781509065738
Due to the rapid development of network communication technology, Vehicle ad-hoc Network(VANET) has become a hot topic. However, the information transmission in VANET is a challenge due to the vehicle moving speed, which makes the communication difficult between vehicles or vehicle and Internet. Peer-to-Peer algorithm is a key network communication technology, and participants in the network share a portion of their hardware resources and can be directly accessed by other participants without intermediaries. So it is helpful for content downloading in Mobile ad-hoc Network(MANET). But VANET as a special kind of MANET has its special characteristic such as fast moving, sufficient energy, and so on. The network itself has a network of multiple hops, dynamic topology, self-organizing, limited link bandwidth, distributed control, energy limited, etc. It is proved that the P2P algorithm can share files and network coding, and also the network coding can reduce the duplication of transmission and simplify the transmission scheme, but it costs 200s to download a 1Mb file under city scenario. Hence, this paper will give one efficient content downloading algorithm in VANET based one improved chord algorithm, and our algirhtm is bidirectional query and non-redundancy.
Due to the rapid development of network communication technology,Vehicle ad-hoc Network(VANET) has become a hot ***,the information transmission in VANET is a challenge due to the vehicle moving speed,which makes the ...
详细信息
Due to the rapid development of network communication technology,Vehicle ad-hoc Network(VANET) has become a hot ***,the information transmission in VANET is a challenge due to the vehicle moving speed,which makes the communication difficult between vehicles or vehicle and ***-to-Peer algorithm is a key network communication technology,and participants in the network share a portion of their hardware resources and can be directly accessed by other participants without *** it is helpful for content downloading in Mobile ad-hoc Network(MANET).But VANET as a special kind of MANET has its special characteristic such as fast moving,sufficient energy,and so *** network itself has a network of multiple hops,dynamic topology,self-organizing,limited link bandwidth,distributed control,energy limited,*** is proved that the P2 P algorithm can share files and network coding,and also the network coding can reduce the duplication of transmission and simplify the transmission scheme,but it costs 200 s to download a 1 Mb file under city ***,this paper will give one efficient content downloading algorithm in VANET based one improved chord algorithm,and our algirhtm is bidirectional query and non-redundancy.
Aiming at the problems of significant communication overheads, the low reliability of primary nodes, and the insufficient dynamic adaptability of traditional consensus algorithms in intellectual property transaction s...
详细信息
Aiming at the problems of significant communication overheads, the low reliability of primary nodes, and the insufficient dynamic adaptability of traditional consensus algorithms in intellectual property transaction scenarios, an Improved Practical Byzantine Fault Tolerant (IPBFT) algorithm based on the chord algorithm and entropy weight method is proposed. Firstly, the chord algorithm is employed to map nodes onto a hash ring, enabling dynamic grouping. Secondly, an entropy-based dynamic reputation model is constructed, quantifying the evaluation of node behaviors and calculating the overall reputation value. A three-level reputation classification mechanism is used to dynamically select primary and supervisory nodes, thereby reducing the probability of Byzantine nodes being elected. Then, a three-phase monitoring strategy for supervisory nodes is developed, which includes collection, review, and blackout. This improves the Raft consensus process, enhancing the detection and fault tolerance against malicious leaders. Finally, a grouped dual-layer consensus architecture is proposed. The lower layer uses an improved Raft algorithm for efficient consensus within groups, while the upper layer uses the PBFT algorithm for cross-group global consistency verification. Experimental findings demonstrate that the IPBFT algorithm is able to balance security, scalability, and consensus efficiency in a dynamic network environment, providing a better consensus solution for intellectual property transactions.
Research on the next generation network architecture is a hot topic. To meet the requirements of the new Internet environment and eliminate the shortcomings of the existing network, integrated network is presented. In...
详细信息
Research on the next generation network architecture is a hot topic. To meet the requirements of the new Internet environment and eliminate the shortcomings of the existing network, integrated network is presented. In the naming system part, a system based on chord algorithm was used, and multi-path is introduced to improve the name resolution reliability. In this paper, we mainly pay attention to the reliability model of integrated naming network system which can be attributed as a multi-path transmission issue, and the name resolution paths used in the network path may be cut off by attacks or other events. This paper focuses on parallel multi-path, which is recoverable when failure happens, transmission reliability, and proposes a corresponding reliability model to get the probability of successful transmission in such conditions. Finally, a numerical simulation is devised to demonstrate the multi-path name resolution's high reliability.
作者：
SHAO Yi-chuanSHEN De-rongZHAO Hong-weiCollege
ofInformationScienceandEngineeringShenYangUniversity College
oflnformationScienceandEngineeringNortheasternUniversity.Dongbei College
oflnformationScienceandEngineeringNortheasternUniversity.Dongbei
According to the deficiency of chord algorithm supporting single keyword query only,a P2P framework-Hilbertchord by combining the Hilbert curve and chord is proposed for managing grid service resources,which supports ...
详细信息
According to the deficiency of chord algorithm supporting single keyword query only,a P2P framework-Hilbertchord by combining the Hilbert curve and chord is proposed for managing grid service resources,which supports DHT-based multi-keyword query and approximate query by means of Hilbert index to improve resources searching *** show that Hilbertchord has better efficiency and scalability for managing service resources under the large scale P2P environment with higher density of services.
暂无评论