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 key/value-stores are a key component of many large-scale applications. Traditionally they have been designed using Distributed Hash Tables (DHTs). DHTs, however, setup a tight coupling between the naming of nodes and assignment of keys to nodes which limits application control over data placement. We propose using small amounts of shared state in a semi-centralized architecture for more...
To get physical address name of destination node efficiently in large scale distributed system, a novel Replica Location based on Hybrid Agent Network (HAN-RL) is put forward. HAN-RL offers a mechanism to construct hybrid agent network based on replica storage nodes and agent nodes for efficient replica location. Based on this hybrid overlay network, replica location is implemented both in layered...
In this paper, we propose an efficient multiple hashes method (called KAD-N) to balance peer loads in the KAD (Kademlia) network. Note that N is the maximum hash times, determining by a cost-effectiveness factor. This method hashes the keyword of an object r times to produce a key for publishing objects, where r is a random number and 1 ?? r ?? N. Simulation results show that the distribution of indexes...
Existing methods and techniques utilized by peer-to-peer (P2P) systems could address the scalability issue faced by grid systems. Today's Grid systems have to deal with potentially a large number of resources which their status changes over time. Therefore, accurate, fast and scalable discovery of resources are key issues that Grid systems should deal with. Typical P2P systems enable sharing static...
Recently, the resource sharing systems apply the P2P technique to provide scalable multi-attribute range queries. However, due to the heterogeneity of resources and the variation of sharing policies in different providers, current P2P-based resource discovery systems may suffer the load imbalance problem in a large scale distributed system. In this paper, we propose a self-adaptive resource index...
Grid is an environment that makes it possible to share resources that are managed by diverse, independent and administrative geographically distributed organizations. The main objective of grid is to enable users to solve problems using the available geographically distributed resources. Grid resource discovery is a challenging issue because characteristics of resources are heterogeneous, dynamic,...
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...
Grids are emerging as a novel approach of employing distributed computational and storage resources to solve large-scale problems in science, engineering, and commerce. Distributed hash table (DHT) middleware overlay has been applied to grids as a middleware for providing scalable multi-resource discovery. However, direct DHT overlay adoption breaks the physical locality relationship between nodes,...
One of the goals of P2P file-sharing system is to provide reliable and convenient sharing mechanism for users, so the resources can be gotten more quickly. However, in traditional DHT network, the problem of mismatching between the P2P overlay network and the physical underlying network has not been taken into consideration, which greatly limits the performance in various search or routing techniques...
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...
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.