Conference Paper

POND: The Power of Zone Overlapping in DHT Networks

Suffolk Univ., Boston, MA
DOI: 10.1109/NAS.2008.56 Conference: Networking, Architecture, and Storage, 2008. NAS '08. International Conference on
Source: DBLP


Distributed hash table (DHT) based algorithms have been proposed to solve the routing issues in large-scale peer-to-peer (P2P) applications. DHT systems create an elegant peer-to-peer service model and work perfect in a homogeneous environment. Workload are evenly distributed on every participating peer and system is supposed to achieve the optimal performance. However, in the real world, the complicated scenarios such as peerspsila capability heterogeneity, diverse file popularities, and mismatching problem between physical network structure and logical routing data structure, jeopardize the efficiency of DHT infrastructure and may result in serious load imbalance problem. In this paper, we propose -- POND, a novel and efficient DHT algorithm to relieve the above problem. In POND, peers are divided into two types: main peers (MP) and shadow peers(SP). As other DHT systems, POND splits the name space into several disjointed zones. However, unlike other systems which only have one peer in charge of each zone, in POND, we use zone overlapping technique. In each zone, a MP and several SPs are used for services. Any of them is capable to handle service requests fallen into this zone. When a new request is coming,the peer with the minimal load has the high possibility to be chosen to provide the service. Thus, the risk of overload problem is reduced. With the introduction of shadow peers, POND also provides better failure tolerance and relieves the hot spot problem. Moreover, POND can improve the routing performance by reducing the average number of routing hops per request. We conduct extensive simulation experiments and the results show POND is superior to other DHT algorithms.

Download full-text


Available from: Zhiyong Xu, Jul 11, 2014
10 Reads
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for wide-area peer-to-peer applications.
    Lecture Notes in Computer Science 10/2002; 2218. DOI:10.1007/3-540-45518-3_18 · 0.51 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A number of large-scale distributed Internet applications could potentially benefit from some level of knowledge about the relative proximity between its participating host nodes. For example, the performance of large overlay networks could be improved if the application-level connectivity between the nodes in these networks is congruent with the underlying IP-level topology. Similarly, in the case of replicated Web content, client nodes could use topological information in selecting one of multiple available servers. For such applications, one need not find the optimal solution in order to achieve significant practical benefits. Thus, these applications, and presumably others like them, do not require exact topological information and can instead use sufficiently informative hints about the relative positions of Internet hosts. In this paper, we present a binning scheme whereby nodes partition themselves into bins such that nodes that fall within a given bin are relatively close to one another in terms of network latency. Our binning strategy is simple (requiring minimal support from any measurement infrastructure), scalable (requiring no form of global knowledge, each node only needs knowledge of a small number of well-known landmark nodes) and completely distributed (requiring no communication or cooperation between the nodes being binned). We apply this binning strategy to the two applications mentioned above: overlay network construction and server selection. We test our binning strategy and its application using simulation and Internet measurement traces. Our results indicate that the performance of these applications can be significantly improved by even the rather coarse-grained knowledge of topology offered by our binning scheme.
    INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE; 01/2002
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Effective engineering of the Internet is predicated upon a detailed understanding of issues such as the large-scale structure of its underlying physical topology, the manner in which it evolves over time, and the way in which its constituent components contribute to its overall function. Unfortunately, developing a deep understanding of these issues has proven to be a challenging task, since it in turn involves solving difficult problems such as mapping the actual topology, characterizing it, and developing models that capture its emergent behavior. Consequently, even though there are a number of topology models, it is an open question as to how representative the generated topologies they generate are of the actual Internet. Our goal is to produce a topology generation framework which improves the state of the art and is based on the design principles of representativeness, inclusiveness, and interoperability. Representativeness leads to synthetic topologies that accurately reflect many aspects of the actual Internet topology (e.g. hierarchical structure, node degree distribution, etc.). Inclusiveness combines the strengths of as many generation models as possible in a single generation tool. Interoperability provides interfaces to widely-used simulation applications such as ns and SSF and visualization tools like otter. We call such a tool a universal topology generator
    Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2001. Proceedings. Ninth International Symposium on; 02/2001
Show more