24.1 Why Is P2P Interesting for Mobile Users and Services 24.1.1 Scenario 1: Taxi Locator 24.1.2 Scenario 2: University Campus 24.2 Introduction to Mobile Communication systems 24.3 Challenges for Peer-to-Peer Techniq...
详细信息
A major objective of peer-to-peer (P2P) systems is the management of large amounts of data distributed across many systems. distributed hash tables (DHT) are designed for highly scalable, self-organizing, and efficien...
详细信息
A major objective of peer-to-peer (P2P) systems is the management of large amounts of data distributed across many systems. distributed hash tables (DHT) are designed for highly scalable, self-organizing, and efficient distribution and lookup of data, whereby data is stored globally persistent. The range of values of the corresponding hash function is partitioned and each interval is assigned to a node of the DHT. Because the assignment of data to nodes is based on hash functions, one assumes that the respective data load is distributed evenly across all participating nodes. However most DHT show difficulties with load balancing as we demonstrate in this paper. As a solution for this problem, we present a new and very simple approach for balancing stored data between peers in a fashion analogous to the dissipation of heat energy in materials. We compare this algorithm with other approaches for load balancing and present results based on simulations and a prototype implementation. This new algorithm improves the distribution of load in DHT without requiring major changes of the DHT themselves. In addition, we show that the fault tolerance of peer-to-peer systems is increased by the proposed algorithm.
Among other things, Peer-to-Peer (P2P) systems are very useful for managing large amounts of widely distributed data. distributed Hash Tables (DHT) offer a highly scalable and self-organizing approach for efficient an...
详细信息
Peer-to-peer (P2P) systems are very useful for managing large amounts of widely distributed data. For this purpose distributed hash tables (DHT) offer a highly scalable and self-organizing paradigm for efficient distr...
详细信息
Peer-to-peer (P2P) systems are very useful for managing large amounts of widely distributed data. For this purpose distributed hash tables (DHT) offer a highly scalable and self-organizing paradigm for efficient distribution and retrieval of data. Thereby a common assumption of P2P systems is, that the participating nodes are unreliable and may fail at any time. Since many of research goes into the design of DHT lookup services, these systems aim to provide a stable global addressing structure. But to storage data reliable in a DHT only few techniques were already developed. However since data has to be stored persistent in the network, it should be retrieved anytime, even if nodes fail. In this work we discuss possibilities to store data fault tolerant in a structured peer-to-peer system.
暂无评论