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.
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...
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...
With the recent focus on cloud computing a new type of system topology came up: clusters in geographically distributed datacenters that are connected by high-latency networks. Current structured overlay networks (SONs) are not well prepared for such environments with heterogeneous network performance and correlated node failures. We show how the beneficial features of SONs, namely self-management,...
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup while RPS enables nodes to build and maintain connectivity in the presence of high churn. Clearly, many applications, e.g. in the area of search, would greatly benefit if both these services were available together at a reasonable...
For the problems of complex queries, load balance and routing efficiency in structured P2P networks based on DHT, a protocol is presented for text retrieval on the basis of Kleinberg small world model. In this protocol, nodes are clustered to support complex query according to the similarity of nodes, and the grouped nodes could adjust their size to balance the load of networks. Routing path length...
In this paper we investigate the DHT performance for Peer-to-peer SIP. We analyze performance from the mobile phone perspective. This angle brings battery consumption and efficient use of the limited resources of the mobile devices to the focus. We develop an analytical model of Kademlia DHT performance and use it to analyze a number of different strategies to use peer-to-peer SIP with mobile devices...
Recent researches of network structure are moving to high-level networks because there are already many research results of low-level network. Especially, current network services has been changed to the multimedia service using multicast routing such as IPTV (Internet Protocol Television) service. Then the same as the existing multicast services to multiple users at once placed to transmit the purpose...
Large-scale P2P systems typically have hundreds of thousands of peers that involve frequent dynamic activities. Empirical studies have shown that participating nodes in P2P systems are not equivalent. Such heterogeneity has been taken into account in the design of P2P systems. In this paper, to achieve better scalability and improve the routing performance of REIK, we design a novel hierarchical REIK...
In this paper, we present an algorithm for an effective flooding procedure with reduced cost in a DHT based P2P network. We describe techniques of flooding and replication that exploit structural constraints to achieve low overhead and higher reliability. These techniques can help to support complex queries in mobile distributed environments with better performance.
In recent years, peer-to-peer (P2P) networks have soared in popularity in the form of file sharing applications. With this popularity comes security implications and vulnerabilities. In this paper we introduce a secure DHT-based routing scheme that has a high resilience against common attacks in order to prevent correct message delivery in DHT-based P2P overlays and presents defenses to these attacks...
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...
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.