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.
DHT-based file backup systems can provide efficient mechanisms for resource placement and lookup. However, these systems must deal with irregular and frequent join/leave of nodes and the problem of load unbalancing between nodes. This paper presents an efficient file replication scheme based on DHT identifier space clustering in order to guarantee data availability and support load balancing for DHT-based...
Today, when a huge number of information resources appear in the Internet, one problem arising is how to search and exploit these information resources efficiently and flexibly with high scalability. We believe that the realization of multiple-attribute searching in a distributed manner is an important solution for this problem. In this paper, we propose a solution of building a distributed attribute-value...
In this paper, we present our low-delay push-pull based application layer multicast for live video streaming on P2P networks. The main goal of our work is to optimize content delivery on P2P networks to guarantee the time constraints of live video streaming. We achieve this goal by constructing multiple balanced sub-trees for pushing data and optimizing pulling connections between nodes in different...
DHT-based P2P networks have a problem of topology mismatch which causes high latency for message routing. This paper focuses on improving the latency of routing process for chord, which is a typical DHT-based P2P network protocol. We propose a simple method to build a chord network based on the proximity of nodes in the underlying physical network. The idea of our method is the combination of two...
DHT-based P2P networks such as Chord, CAN, Pastry, etc can achieve exact query with characteristic of scalability, efficiency and fault-tolerate. However, in the case of complex queries such as range query or multiple-attribute query, pure DHT is not efficient since a lot of query messages must be sent. In this paper we focus our intentions on multiple-attribute query on DHT-based P2P network systems...
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.