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.
Search algorithms have been a widely studied topic in the context of Peer-to-Peer (P2P) networks. Generally speaking, unstructured P2P networks, such as Gnutella, are used for performing arbitrary searches (i.e., the form of a search request is not restricted) and structured networks, such as the ones based on Distributed Hash Table algorithms, are used for performing exact searches (i.e., the form...
In most structured P2P systems, using DHT algorithms to distribute objects randomly among nodes results in unbalance load in each node. Numerous load balancing proposals exist in P2P networks, most of them only focus on namespace balancing and under the uniform assumption. In ideal condition, these techniques really work well, but ignoring the effect of heterogeneity and uneven in both of varying...
There are many existed collaborative frameworks, e.g. Narada, Overcast, Can, which are used in various computer supported work. In this paper we deliver a collaborative application framework based on a specific P2P grid model. This framework is designed to solve the typical problems in the traditional collaborative applications, such as the bottleneck restriction of C/S architecture and the related...
Skip Graphs provide novel distributed data structures for peer-to-peer (P2P) searching. They are simple, resilient and are capable of supporting complex queries. Like many distributed hash table (DHT) algorithms, one issue that remains to be addressed is the large number of pointers per node in the system. They suffer from the problems of high storage requirements and high volume of repair-mechanism...
Structured Peer-to-Peer (P2P) systems are increasingly important for scalable data dissemination and search. Current distributed approaches for resolving complex search queries, like multi-attribute and range queries, typically require multiple query messages to resolve a single search request. To reduce the message overhead and the search latency, some approaches like the Multi-Attribute Addressable...
Peer-to-Peer (P2P) networks have been proposed as one promising approach to provide better scalability for Networked Virtual Environment (NVE) systems, but P2P-NVE also increases the probability of cheating by allowing users to manage the states of objects. In this paper, we propose Delaunay State Management (DSM), a P2P-NVE state management scheme that divides the whole virtual world into many triangular...
Reputation management is a specific form of trust management. Reputation is measured from direct or indirect knowledge of previous interactions between nodes. Individual nodes can rely on their direct experiences or can obtain reputation information from other peers. Nodes can use this reputation information to distinguish good from bad service providers. However, due to the distributed topology of...
In DHT based P2P networks, the heterogeneity of node capacity and the skewness in query pattern could result in lookup load imbalance. Indegree adjustment is an effective, light-weighted and heterogeneity-aware approach to balance lookup traffic in local area, but not globally. In this paper we present a hybrid algorithm combining in degree adjustment and virtual server (VS) approaches to address...
Peer-to-peer networks consist of thousands or millions of nodes that might join and leave arbitrarily. The evaluation of new protocols in real environments is many times practically impossible, especially at design and testing stages. The purpose of this paper is to describe the implementation aspects of a new Java based P2P simulator that has been developed to support scalability in the evaluation...
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.