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.
A peer-to-peer (P2P) file sharing system provides a platform that enables users to share their files. Retrieving files efficiently and trustworthily in such a large and jumbled system is critically important. However, the issues of efficient searching and trustworthy searching have only been studied separately. Simply combining two separate strategies dealing with each issue doubles system overhead...
In mobile ad hoc networks (MANET), due to rapidly changing network topology, routing break occurs frequently. Ad hoc on-demand distance vector adaptive backup with local repair routing (AODV-ABL) protocol creates and maintains backup routes to the destination node by overhearing data packets to increase the success rate of repairing invalid routes. However, AODV-ABL may lose some backup routes with...
The widespread availability of connectivity to the Internet allows to share large amount of information generated by the most heterogeneous, possibly mobile, sources. One scenario where this situation arises is given by smart cities, which are envisioned to generate and consume relevant information about their statuses to enhance the security and lifestyle of their citizens. In this context, a very...
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...
Structured peer-to-peer overlay maintenance mechanisms require efficient methods to find stale routing table entries and replace them with new entries in a way that retains the desired routing behavior. Futhermore, overlay maintenance algorithms require to be devised to handle peer churn, the continuous process of node arrival and departure. Existing strategies of selecting new entries for routing...
The present paper addresses the efficient management of avatar states in P2P virtual environments (VEs) by building on our previously proposed Relaxed Triangulation (RT) overlay, designed to accommodate the dynamic nature of VEs by drastically reducing the maintenance cost inherent to the well-known Delaunay construct. Given that our RT overlay no longer supports greedy routing, we propose in this...
In some systems that employ overlay technology, nodes are highly heterogeneity. Classic routing protocols (such as Chord) consider nodes as homogeneous and all nodes maintain routing table with same size, taking on same routing load. Therefore the scalability of system is restricted by weakest node. Heterogeneity-aware routing mechanism (Hetero-RM) is proposed in this paper. It assigns each node certain...
Previous studies of large-scale (multimillion node) Kademlia-based DHTs have shown poor performance, measured in seconds; in contrast to the far more optimistic results from theoretical analysis, simulations and testbeds. In this paper, we unexpectedly find that in the Mainline BitTorrent DHT (MDHT), probably the largest DHT overlay on the Internet, many lookups already yield results in less than...
This paper proposes a distributed computing architecture using the P2P paradigm. Our proposal gathers the peers into markets according to their computational resources. Each market is arranged in an N-tree and the trees are linked by a Bruijn graph. The tree topology allows efficient searching of available resources in a specific market, while Bruijn provides good scalability as search complexity...
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...
The paper proves that it is possible to optimize application-level multicast operation from the viewpoint of traffic flows. A modification of the FreePastry/Scribe application is proposed to enable cooperation with the IETF ALTO (Application- Layer Traffic Optimization) protocol. Consequently, the overlay topology is constructed taking into account the underlying network topology. The presented results...
Multicast streams are the most popular traffic pattern in many applications of mobile ad-hoc networks (MANET). However, the mobility of nodes causes frequent changes to the network topology and thus efficient routing of multicast traffic becomes very challenging. The establishment of a core-mesh has been deemed as a very effective solution for these dynamic setups. The core-mesh acts as a backbone...
Large Peer-to-Peer (P2P) systems for file transfer exhibit the presence of communities based on semantic, geographic, or organizational interests of users. Generally, resources commonly shared within individual communities are relatively unpopular and inconspicuous in the system-wide behavior. These communities are unable to benefit significantly from performance enhancement schemes such as caching...
Distributed systems such as Peer-to-Peer overlays have been shown to efficiently support the processing of range queries over large numbers of participating hosts. In such systems, uneven load allocation has to be effectively tackled in order to minimize overloaded peers and optimize their performance. In this work, we detect the two basic methodologies used to achieve load-balancing: Iterative key...
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...
Ring topologies are peer to peer network structures that organize the nodes in a ring. Each node knows its direct neighbors and a few other nodes but has no global view of the network. In such a network it is complicated to measure or estimate the number of participating nodes. We provide a lightweight, distributed algorithm to estimate the size of the node population. We also show how correct the...
A key design issue in routing for wireless ad hoc networks is scalability. By scalability we mean the ability of the network to support increases in node numbers without significantly degrading network performance. In this work we introduce a new hybrid wireless routing protocol specifically designed to address this issue. Our new protocol combines features of reactive routing with location-based...
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...
Overlay networks are widely adopted in many distributed systems for efficient resource sharing. Recently, issues in overlay network have also been introduced into cloud systems, in order to organize thousands of virtualized resources. In parallel, the explosion of P2P applications introduces the multi-overlay environment in which a number of nodes simultaneously participate in multiple overlays. When...
Structured peer-to-peer overlays offer a basis for a broad range of applications, such as distributed storage, application layer multicast, and mobility support. This paper introduces R/Kademlia, a low bandwidth and low latency variant of the popular overlay protocol Kademlia. R/Kademlia utilizes recursive overlay routing instead of iterative lookups of keys, thus a higher routing performance can...
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.