Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
In peer-to-peer file sharing systems, file replication technology is widely used to reduce hot spots and improve file query efficiency. Most current file replication methods replicate files in all nodes or two end points on a client-server query path. However, these methods either have low effectiveness or come at a cost of high overhead. File replication in server side enhances replica hit rate,...
Replication technique is an effective method for improving the availability of data and enhancing performance, however, it also brings significant costs in storage space and traffic. In this paper, we study how to decrease redundant traffic cost and redundant replicas for replication in structured P2P overlay by topology optimization. We develop a hierarchical proximity-aware P2P overlay with dominating...
In this paper, we propose two algorithms for broadcasting a large data set with limited loads of all nodes on a DHT-based P2P network using a de Bruijn graph. One of the broadcast algorithms is applied to de Bruijn graphs with the restricted number of nodes. We prove that this algorithm broadcasts a data set along a degree-constrained spanning tree without global knowledge of a P2P network and that...
We present AIR (automatic incremental routing), a unified approach for scalable unicast and multicast routing in mobile ad hoc networks (MANET). In AIR, nodes run a distributed routing algorithm to assign prefix labels to themselves. The labels are assigned such that routing to unicast or multicast destinations is automatic, in that a route from any node to a destination is defined by the node's prefix...
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...
Support of P2P communities in mobile environments is a challenging task. To this purpose numerous algorithms have been recently proposed to speed up resource search throughout the network. Among these, structured DHT approaches seem very promising since they allow for a successful resource search by keeping complexity low. One of these techniques denoted as Georoy, was recently proposed with the aim...
The tremendous growth of public interest in peer-to-peer (P2P) networks in recent years has initiated a lot of research work on how to design efficient overlay structures for P2P systems. Structured overlay networks that based on various distributed hash tables (DHTs) provide no control over where data is stored and cannot support range queries directly. Ordered overlays such as skip graphs and SkipNet...
Resource discovery is critical to the usability and accessibility of grid computing systems. Distributed hash table (DHT) has been applied to grid systems as a distributed mechanism for providing scalable range-query and multiattribute resource discovery. Multi-DHT-based approaches depend on multiple DHT networks with each network responsible for a single attribute. Single-DHT-based approaches keep...
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. In this paper, we study the lookup performance of locating nodes responsible for replicated information in Kad - one of the largest DHT networks existing currently. Throughout the measurement study, we found that Kad lookups locate only 18% of nodes storing...
Recently, it has been argued that reputation mechanisms could be used to improve routing by conditioning next-hop decisions to the past behavior of peers. However, churn may severely hinder the applicability of reputations mechanisms. In particular, short peer lifetimes imply that reputations are typically generated from a small number of transactions and are few reliable. To examine how high rates...
ID uniqueness is essential in DHT-based systems as peer lookup and resource searching rely on ID-matching. Many previous works and measurements on Kad do not take into account that IDs among peers may not be unique. We observe that a significant portion of peers, 19.5% of the peers in routing tables and 4.5% of the active peers (those who respond to Kad protocol), do not have unique IDs. These repetitions...
In this paper, we propose a two-tiered distributed hash table (DHT) based overlay for an implementation of publish/subscribe. In this overlay, upper tier consists of stable nodes with more resources whereas lower tier contains less stable nodes with limited resources. In our design, all nodes are required to join at lower tier and nodes with better uptime and resources may dynamically migrate to upper...
In the case of distributed applications, designed to run for more days with no restart needed, there is a strong need for a self-adapting, even self-organizing, distributed infrastructure, to dynamically solve the issues that might arise, and to adapt the infrastructure to the needs of the distributed application than runs on top of it. A solution for such a distributed logical infrastructure, based...
A peer-to-peer (P2P) technology is applied for various systems because it enables to construct a system with high scalability and robustness. We have proposed a distributed cooperative storage system that can construct huge storage space by providing it on a P2P network. The storage system is based on an overlay network construction, and its hash space is created in an application layer. Each peer...
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...
Kademlia is a Distributed hash table widely used in P2P networks that has been applied to commercial and non commercial distribution of files. In this paper the authors review some security issues connected with Kademlia and a technique to leverage its security using an external certification service.
Today's Internet is facing routing scalability issues, which could degrade network performance seriously. To solve that, several solutions are currently being discussed. Among them, one promising approach is to set up a new architecture which separates the locator and the identifier roles of current IP addresses. A key question for the solution is how to provide an efficient and reliable service for...
One of the most critical operations performed in a P2P system is the lookup of a resource. The main issues to be addressed by lookup algorithms are: (1) support for flexible search criteria (e.g., wildcard or multi-keyword searches), (2) effectiveness - i.e., ability to identify all the resources that match the search criteria, (3) efficiency - i.e. low overhead, (4) robustness with respect to node...
A fundamental problem of peer-to-peer (P2P) systems is efficiently locating a node that stores a desired data item. Distributed hash table (DHT) mechanisms have been proposed to address this problem and manage data in very large, structured P2P systems. DHT algorithms provide efficient exact match object search capabilities without requiring global indexing and are hence extremely scalable. However,...
The critical issue that confronts peer-to-peer networks is the efficient location of the node that stores a desired data item. Chord is a successful resource location protocol based on distributed hash table. However, if the desired data item is stored on a node that is count-clockwise close to the query node on the chord ring, the lookup latency might be high because of its clockwise lookup strategy...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.