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.
Peer-to-Peer (P2P) systems have brought two serious problems for Internet Services Providers (ISPs): traffic surges and network congestion. Proxy caching for P2P traffic is an effective means of easing the burden imposed by P2P traffic on ISPs. The deployment strategy of proxy caches has a significant impact on their effect on ISPs. It has two important components: one is cache operation that is what...
In order to compensate for the shortage of existing load balancing algorithm, aiming at the “hotspot” data accessed in P2P systems, a load balancing algorithm with traffic control for heterogeneous P2P systems using mobile agent is suggested. It can prevent the congestion phenomenon produced by the sudden increase in network traffic. Theory analysis and experiment results show that the algorithm greatly...
Based on the existing load balancing algorithm, aiming at the “hotspot” data accessed in P2P systems, a load balancing algorithm for heterogeneous P2P systems using mobile agent is proposed, which effectively balances loads of peers distributed among P2P systems with the help of autonomous agent called Mobile Agent. Experimental data shows that the algorithm greatly reduces the communication costs,...
Search in peer-to-peer networks is a challenging problem due to the absence of any centralized control & the limited information available at each node. When information is available about the overall structure of the network, use of this information can significantly improve the efficiency of decentralized search algorithms. Many peer-to-peer networks have been shown to exhibit power-law degree...
In a structured peer-to-peer (p2p) network, key based routing algorithms are used for searching and locating resources in the network. For dynamic and scalable behavior these algorithms suffer from high overhead to maintain large state information of nodes and to keep them up-to-date. To deal with this problem, a Sub-ring Based Chord model and a lookup algorithm are proposed. The lookup process keeps...
To the question of topology mismatch in structured P2P network, this paper presents a routing advanced algorithm using super-nodes and self-organizing clustering. The algorithm adds self-organizing clustering based on physical location information in structured P2P system, and each node decides whether it can become clustering header according to its ability. In this algorithm, a series of powerful...
The resource distribution in P2P network has an obvious scale free character. Using this inherent character to design resource search strategy is great significant for improving searching efficiency and reducing the costs. We analyze the scale free distribution character in P2P network, and propose a reliable random walk search algorithm to achieve high and reliable search efficiency through forwarding...
Huge amounts of data are available in large-scale networks of autonomous data sources dispersed over a wide area. Data mining is an essential technology for obtaining hidden and valuable knowledge from these networked data sources. In this paper, we investigate clustering, one of the most important data mining tasks, in one of such networked computing environments, i.e., Peer-to-Peer (P2P) network...
In a peer-to-peer network, file replication technology is widely used to reduce hot spots and improve search performance. Most current file replication methods replicate files in all nodes or two endpoints on a client-server query path. However, these methods either have low effectiveness or come at a cost of high overhead. This paper presents an adaptive file replication method based on dynamic community...
Many emerging network applications are based upon a group communication model. In a peer-to-peer or ad-hoc network which do not have a previously agreed upon common secret key, communication is susceptible to eavesdropping, Hence a secure distributed group key agreement is required to establish and authenticate a common group key for secure and private communication. This paper presents an authenticated...
The initial phase in a content distribution (file sharing) scenario is delicate due to the lack of global knowledge and the dynamics of the overlay. An unwise distribution of the pieces in this phase can cause delays in reaching steady state, thus increasing file download times. We devise a scheduling algorithm at the seed (source peer with full content), based on a proportional fair approach, and...
Network coding is a new paradigm that allows the intermediate nodes in a network to create new packets by combining the packets received on their incoming edges. The central problem in the design of network coding schemes is to assign local encoding coefficients for the intermediate edges in a way that allows every terminal node to decode the packets generated by the source node. The main applications...
This paper describes a distributed algorithm to construct and maintain a peer-to-peer network overlay with bounded diameter. The proposed approach merges a bio-inspired self-organized behavior with a pure peer-to-peer approach, in order to adapt the overlay to underlying changes in the network topology. Ant colonies are used to collect and spread information across all peers, whereas pheromone trails...
The searching mechanism of Gnutella in unstructured peer-to-peer network and its working principle are introduced. By analyzing its poor scalability problem, this paper proposes an improvement strategy based on dynamic topology regularization. The simulation results show that the strategy can effectively reduce the resource consumption of network and optimize the load-balancing among peers, and then...
Distributed hash tables (DHTs) with O(1) lookup performance strive to propagate membership changes through efficient distribution mechanism to allow each node in the peer-to-peer network maintains accurate routing tables with complete membership information. We present UnoHop, an efficient DHT algorithm with O(1) lookup performance. UnoHop uses an efficient algorithm to propagate membership events...
Though the peer-to-peer network based on distributed hash table have scalability and availability features, but most of the distributed hash tables lack the support for the atomic data accessing, this ability is important to build data structures on distributed system. This paper gives the design and implementation of an atomic accessible mutable distributed hash table - FamDHT. The FamDHT use the...
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.