The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The characteristics of P2P networks which are open, anonymous, and loosely coupled inter-node lead to false resources, malicious evaluation, and syndicates. A related cluster based trust model for P2P networks named RCTrust is presented in this paper. Peers gather in clusters according to their interest similarity and communication history. There are two kinds of trust relationships. In RCTrust, measure...
This paper presents a loss less method (named Tele-DTM, means Tele-Decomposition-Transmission-Merge) to transmit tele-medical image distributed using p2p principle. In this solution, by decomposing the medical image into n sub images(n equals to the amount of expert nodes), the patient node transmits these n sub-images to the corresponding expert nodes separately. When received the first sub-images,...
Most P2P applications use the routing algorithm that selecting the neighbor nodes at random. This routing algorithm increases the routing hops and reduces the routing speed. To get better routing efficiency, a new routing algorithm named RHAC based on hierarchy agglomerative clustering was presented in this paper. It dynamically clusters nodes into different clusters based on the communication history...
This paper presented an improved routing algorithm K-CSSP of structured P2P overlay networks based on clustering the nodespsila communication history of the CSSP. This routing algorithm computing the nodespsila stability via storing the nodespsila communication history distributed. The K-CSSP uses the K-means algorithm to cluster the CSSP nodes by the stabilities into K regions which inter-linked...
The use of peer-to-peer (P2P) applications is growing dramatically. Most P2P applications use the routing algorithm that selecting the neighbor nodes at random. This routing algorithm increases the routing hops and reduces the routing speed. To get better routing speed with less routing hops, a new routing algorithm named RGAAC based on group-average agglomerative clustering was presented. Structured...
The most popular routing algorithm in p2p network is that every node keeps a route table which records a certain number of other nodes. Such algorithm selects neighbor nodes at random, and this reduces routing efficiency. In this paper a new algorithm of optimizing p2p overlay network topology is proposed, which is based on minimum maximum k-means principle. According to the communication history,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.