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.
This paper proposes an adaptive clustering cache replacement scheme to improve the performance of Freenet peer-to-peer networks. Efficient data retrieval in peer-to-peer networks in general and in Freenet in particular is a challenging problem. We follow the approach of using the small-world behavior to model the data cache replacement in Freenet and propose an extension to it: an adaptive clustering...
In large-scale computational or P2P grids, discovery of heterogeneous resources as a working group is crucial to achieving scalable performance. This paper presents a hierarchical cycloid overlay (HCO) architecture with resource clustering and discovery algorithms for efficient and robust resource discovery in wide-area distributed grid systems. We establish program/data locality by clustering resources...
A new clustering route algorithm of p2p networks based on knodel graph is proposed in this paper. According to the primary method, our algorithm added physical clustering in ordering to create relation between node's physical position and logical id number can improve the route efficiency of the whole knodel p2p network.
Several proposals have been presented to supplement the traditional measure of routing efficiency in P2P networks, i.e. the (average) number of hops for lookup operations, with measures of the latency incurred in the underlying network. So far, no solution has been presented to this ldquolatencyrdquo problem without incurring in extra and heavy management costs. We propose Relaxed-2-Chord, a new design...
Distributed Hash Tables (DHT) provide a lookup service in peer-to-peer overlay networks. Many valuable applications have been recently built on top of several available DHTs. However, they function poorly when no direct IP connectivity is available to some nodes (e.g., located behind a NAT or firewall) or in the presence of overloaded or malicious nodes. In this paper, we propose a new method for...
Many load balancing strategies have been proposed for distributed hash tables, like Pastry. These strategies assume that hash functions spread even skewed key distributions almost evenly over the ID space. They neglect the problem that many applications produce data with common keys (multi-sets) that entail hash collisions and therewith load imbalance concerning query and storage load. A second drawback...
Structured peer-to-peer networks overlay provide a substrate for the contribution of scalability, load balance, decentralization, and availability. However, new nodes are confronted with hijacking attacks on the peer-to-peer overlay with attackers. This paper proposes a model that the malicious nodes can not modify messages over the links and therefore can not control identifiers of correct nodes...
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.