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.
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...
In this work we study a variety of problems, including network coordinate systems, compact routing, and wireless network capacity. The unifying thread is the observation that while strong theoretical properties are already known about all of these problems, the standard models used to prove these properties are not particularly realistic. We attempt to work in more realistic models, which are either...
Efficient file query is important to the overall performance of Peer-to-Peer (P2P) file sharing systems. In this paper, we introduce an interest-based P2P file sharing system based on a structured P2P. It groups peers based on both interest and proximity. The proposed system is able to support sophisticated routing and clustering strategies based on the file attribute and topology used. Simulation...
The Chord protocol is the best known example of implementation of logarithmic complexity routing for structured peer-to-peer networks. Its routing algorithm, however, does not provide an optimal trade-off between the size of the finger table and the average number of hops to reach destination. Lately, a base-k chord appeared based on the original Chord, the routing perfomence of this system improved...
The performance of several unstructured peer-to- peer (P2P) content discovery techniques over ad hoc networks was analyzed in this work. They include: query flooding, expanding ring search, random walk and Bloom filter(BF)-based probabilistic routing. The chosen performance metrics are the query success rate, the route stretch and the search cost. Mathematic analysis is conducted to predict their...
A hierarchy distributed route structure based on IPv6 address in peer to peer systems is proposed in order to solve the problems that physical topology and logical network does not match so as to inefficient search in distributed hash table at present. By building node identifier using IPv6 address and hashing different level clustering identifier to set up hierarchy route, near nodes in physical...
At present, the probability of selecting "the peer next door" as an overlay neighbour in Kademlia is fairly small. Prior research has been concerned with reducing the lookup latency by means of proximity neighbour and route selection, but focused on recursive routing algorithms. This work leverages location data about peers and extends Kademlia's iterative routing algorithm to reduce cross-network...
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.