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.
Recently, in classical P2P overlay networks, with applying replication technique, a single peer is replaced by a cluster of peers in order to tolerant Byzantine failures. In this paper, a novel robust and secure scheme for storage overlay networks is proposed by applying erasure coding technique to reduce redundancy and enhance privacy protection. For achieving a lightweight data privacy protection,...
Churn is one of the crucial problems which restrict the development and deployment of DHT networks. In terms of churn treatment, this paper studies the quick start-up bootstrapping mechanism for Kademlia and proposes a heuristic bootstrapping algorithm to overcome the defects of the original. By modifying the way how to populate the routing tables, the heuristic algorithm decreases the messages sent...
The structure has been put forward of P2P systems are strictly based on the keyword matching to find the way of routing resources, so the routing mechanism will not be able to reflect the massive, distributed resources, and semantic information, thus reducing the precision of service discovery and search prospective rate. Semantic Web as the next generation of the embryonic form of the World Wide...
Network coding is a class of routing algorithms offering increased throughput and improved robustness to random failures. With traditional routing, intermediate nodes in the network may only forward unmodified packets. With network coding, instead, intermediate nodes are allowed to forward linear combinations of received packets. Original data can be reconstructed after collecting sufficiently many...
A hierarchical of 160-bit ID space is constructed based on the node's location information (network heterogeneous) and the node's processing capability (node heterogeneous) etc. The problem of the topology consistency is solved by making the hierarchical ID space compatible with that of the physical network. The relay of weighed reputation method is used to realize the storage and collection of the...
Routing is a critical factor to ensure the stabilization and normal communication of P2P network. If routing is interrupted, the communication efficiency will deteriorate and even cause the crash of the whole P2P system. The widespread problem of existing P2P routing mechanisms is their poor anti-attack. The paper proposes a safe routing algorithm based on positive detection mechanism, which can detect...
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,...
Topology mismatching problem between peer-to-peer overlay network and physical underlying network brings great stress to Internet infrastructure. This paper proposes a traffic localizing strategy (TLS), it keeps scalability property of current DHT algorithms and improves system routing performance by partitioning DHT key space associating with local physical information. Experiments based on CAN model...
Kademlia-based DHT has been deployed in many P2P applications and it is reported that there are millions of simultaneous users in Kad network. For such a protocol that significantly involves so many peers, its robustness and security must be evaluated carefully. In this paper, we analyze the Kademlia protocol and identify several potential vulnerabilities. We classify potential attacks as three types:...
Recent research has shown that small world network (SWN) is navigable. In this position paper, we propose that SWN, for example those which are social networks, have nice properties which make them attractive as overlay networks. Such networks occupy a space between structured and unstructured overlay networks. Our thesis is that SWN may be attractive enough to be a replacement for traditional structured...
The provision of innovating multimedia services is a high priority for service providers. Due to the the high traffic volume characteristics of multimedia content, decentralised services are a desired solution for multimedia scenarios. Based on the ongoing work of the IETF P2PSIP WG this paper defines a simple way to interconnect different domains using on peer-to-peer technology. The objective is...
IgorFs is a distributed, decentralized peer-to-peer (P2P) file system that is completely transparent to the user. It is built on top of the Igor peer-to-peer overlay network, which is similar to Chord, but provides additional features like service orientation or proximity neighbor and route selection. IgorFs offers an efficient means to publish data files that are subject to frequent but minor modifications...
The lack of a trusted authority, responsible for peers' identity verification or for authentication purposes, makes actual P2P systems extremely vulnerable to a large spectrum of attacks. The main purpose of this paper is to present Likir (layered identity-based Kademlia-like infrastructure), a framework that includes an identity-based scheme and a secure communication protocol, built on top of Kademlia,...
Many different distributed hash tables (DHTs) have been designed, but only few have been successfully deployed. The implementation of a DHT needs to deal with practical aspects (e.g. related to churn, or to the delay) that are often only marginally considered in the design. In this paper, we analyze in detail the content retrieval process in KAD, the implementation of the DHT Kademlia that is part...
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.