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.
Distributed Hash Tables (DHTs) provide the substrate to build scalable and efficient Peer-to-Peer (P2P) networks: distributed systems with the potential to handle massive amounts of data on a very large scale. However, traditional DHTs provide very poor support for range queries. In this article we present a search mechanism that efficiently supports range queries over a ring-like DHT structure using...
Traditional DHT structures provide very poor support for range queries, since uniform hashing destroys data locality. Several schemes have been proposed to overcome this issue, but they fail to combine load balancing, low message overhead, and low latency in search operations. In this article we present DRing, an efficient layered solution that directly supports range queries over a ring-like DHT...
Traditionally complex queries have been performed over unstructured P2P networks by means of flooding, which is inherently inefficient due to the large number of redundant messages generated. While Distributed Hash Tables (DHTs) can provide very efficient look-up operations, they traditionally do not provide any methods for complex queries. By exploiting the structure inherent in DHTs we can perform...
One-hop algorithms have been proposed to solve the problem of fast queries in structured Peer-to-Peer (P2P) system. The core concept for one-hop algorithms is to maintain a huge routing table, but most of them so far have opted to deal with routing table maintenance with a fixed consuming for peers, in order to keep minimal maintenance traffic at the cost of operating performance. In this paper we...
For the problems of complex queries, load balance and routing efficiency in structured P2P networks based on DHT, a protocol is presented for text retrieval on the basis of Kleinberg small world model. In this protocol, nodes are clustered to support complex query according to the similarity of nodes, and the grouped nodes could adjust their size to balance the load of networks. Routing path length...
This paper proposes functional enhancements of cooperative session control for “Minimum Core” architecture. In past work, the authors invented a cooperative session control in which the call setup time is guaranteed through cooperating core and overlay networks while minimizing processing and traffic load on the core network. In the session control, each peer selects the core or overlay network for...
DHTs are scalable, self-organizing, and adaptive to underlying topology changes, thus being a promising infrastructure for realizing autonomic communications in distributed systems. To provide the above advantages, however, DHTs sacrifice flexibility, that is, all messages are routed by using a common algorithm in a DHT on the assumption that all participant nodes are homogeneous. In practice, nodes...
Large-scale P2P systems typically have hundreds of thousands of peers that involve frequent dynamic activities. Empirical studies have shown that participating nodes in P2P systems are not equivalent. Such heterogeneity has been taken into account in the design of P2P systems. In this paper, to achieve better scalability and improve the routing performance of REIK, we design a novel hierarchical REIK...
Structured peer-to-peer overlay networks provide a useful substrate for building distributed applications. They map object keys to overlay nodes and offer a primitive method to send a message to the node responsible for a key. Though they work well in homogeneous environment, there are still some challenging problems to be solved when adapting them to heterogeneous environment. This paper studies...
Peer-to-Peer overlays have become a popular paradigm for building distributed systems, aiming to provide resource localization and sharing in large-scale networks. To design an overlay network, the first step is to choose an overlay topology connecting all the overlay nodes. Many proposed distributed hash table schemes for peer-to-peer network are based on some traditional calculated interconnection...
In this paper, we present an algorithm for an effective flooding procedure with reduced cost in a DHT based P2P network. We describe techniques of flooding and replication that exploit structural constraints to achieve low overhead and higher reliability. These techniques can help to support complex queries in mobile distributed environments with better performance.
In peer to peer networks, the overlay topology connecting peers is an important component in addition to peer and data organization and search. In fact, topological characteristics have an important impact on the efficiency of search on such networks. In this paper, we address this issue for Chord based P2P systems. Based on the Barabasi Albert (BA) model, we propose to extend the topology of Chord...
In most DHTs proposed so far, all nodes are assumed to be homogeneous, and all messages are routed using a common algorithm. In practice, however, nodes in large-scale systems might be heterogeneous with respect to their capabilities, reputations, affiliations of administrative domains, and so on, which consequently makes it preferable to distinguish the heterogeneity of participant nodes. To achieve...
Excellent P2P network infrastructure should support scalability and efficient search simultaneity. The intelligent routing mechanisms have flexible query expression but hold low scalability and recall rate. Contrastively, DHTs are scalable but either difficult to organize or too expensive for maintenance. A new structured P2P model is proposed in which resource storages are organized by match path...
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.