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.
We investigate the problem of spreading information contents in a wireless ad hoc network. In our vision, information dissemination should satisfy the following requirements: (i) it should result in a desirable distribution of information replicas in the network and (ii) the information should be evenly and fairly carried by all nodes in their turn. In this paper, we show that these goals can be achieved...
In a peer-to-peer (P2P) overlay network, a peer process (peer) communicates with other peers and manipulates objects in local and remote peers. In a fully distributed, unstructured P2P network, there is no centralized coordinator like index and super peer. Each peer has to communicate with its acquaintance peers and obtain service information of other peers. It is critical for a peer to identify which...
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...
We study how BitTorrent exhibits peer clustering in terms of transaction success rate which is based on allocated uplink bandwidths for the purposes of file-swapping. The effects of optimistic unchoking and dissemination of choke lists are also considered. Under dynamic uplink assignment, similar grouping results based on differences in how users derive utility from transaction success rates. The...
Efficient and effective full-text retrieval in unstructured peer-to-peer networks remains a challenge in the research community. First, it is difficult, if not impossible, for unstructured P2P search protocols to effectively locate items with guaranteed recall rate. Second, existing schemes to improve search successful rate often rely on replicating a large number of item replicas across the wide...
P2P networks facilitate people belonging to a community to share resources of interest. However, discovering resources in a large scale P2P network poses a number of challenges. Although distributed hash table (DHT) structured P2P networks have shown enhanced scalability in routing messages, they only support key based exact matches. This paper presents DIndex, a distributed indexing component that...
Range query in Peer-to-Peer networks based on Distributed Hash Table (DHT) is still an open problem. The traditional way uses order-preserving hashing functions to create value indexes that are placed and stored on the corresponding peers to support range query. The way, however, suffers from high index maintenance costs. To avoid the issue, a scalable blind search method over DHTs - recursive partition...
This paper presents ldquoSelf-Chordrdquo, a bio-inspired P2P algorithm that can be profitably adopted to build the information service of distributed systems, in particular Computational Grids and Clouds. Self-Chord inherits the ability of Chord-like structured systems for the construction and maintenance of an overlay of peers, but features enhanced functionalities deriving from the activity of ant-inspired...
The peer-to-peer (P2P) systems have many applications due to their virtues: high scalability and low cost. The systems using super-peers (SPs), which deal with all queries, instead of ordinary-peers (OPs), run more efficiently. So how to choose SPs from all peers is a key, but also a difficult problem because of the systems' heterogeneity and dynamic. In this paper a novel mechanism for the selection...
A peer-to-peer (P2P) system has emerged as one of the most successful ways to share resources in distributed environment, and DHT(distributed hash table) is used as an effective approach to locate shared resources in a P2P system. This paper describes an extended DHT model by combining DHT with B+ tree. The sharing resources are represented by their attributes. Each query request is associated with...
At present, spatial data has been widely used in many fields, such as GIS.Nevertheless, with the explosion of spatial data and burst from user application demands, lacking of scalability and the trend of being bottle neck have been faded up from traditional centralized GIS. The range query for spatial data is the one of the typical applications. This paper presents a method of range query based on...
Application relay is important for many delay-sensitive applications such as voice over Internet protocol (VoIP). It has been proved that relay selection would be optimized considering autonomous domains (ASes) relationship. We describe a new method for relay selection using service discovery in distributed hash table(DHT) in which relay service advertisements are indexed and clustered according to...
In this paper, we study how to optimize mesh-based overlay in a contribution aware manner. We have designed a suite of protocols to construct and optimize the overlay. Our core idea is to promote nodes with larger contribution closer to the source node so as to keep a compact and efficient mesh-based streaming overlay. Our method is evaluated through extensive simulations. Compared with the non-optimized...
Unstructured peer-to-peer (P2P) networks have power-law topology, and the number of content requests also follows power-law distributions. These properties cause two problems: the high-load of high-degree peers and the quick deletion of rarely requested contents. We propose a new caching scheme that replaces the cache on the basis of the number of request messages per unit of time. It significantly...
Super-peer P2P systems strike a balance between searching efficiency in centralized P2P systems and the autonomy, load balancing and robustness provided by pure P2P systems. Super-peer is a node in the super-peer P2P system that maintains the central index for the information shared by a set of peers within the same cluster. The central index handles the searching request on behalf of the connecting...
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.