Effect of Links on DHT Routing Algorithms 1

Size: px
Start display at page:

Download "Effect of Links on DHT Routing Algorithms 1"

Transcription

1 Effect of Links on DHT Routing Algorithms 1 Futai Zou, Liang Zhang, Yin Li, Fanyuan Ma Department of Computer Science and Engineering Shanghai Jiao Tong University, Shanghai, China zoufutai@cs.sjtu.edu.cn Abstract. Various DHT routing algorithms have been proposed in recent years. All these algorithms have tried to keep an uniform structured geometry while nodes join and leave. In this paper, we use links to capture the dynamic characteristics of the geometry and suggest there are three kinds of links in the geometry: the basic short link, the redundant short link, and the long links. Several current DHT systems have been investigated to argue these links are inherent in them and pointed out the possible improved directions of performance based on the characteristics of links. We analyze how links impact the routing performance and observe it with simulation experiments. Our experimental results show that each kind of links has its special contribution to the performance of P2P systems and it needs to take the effect of links into account as designing DHT routing algorithms. 1 Introduction A peer-to-peer networked system is a collaborating group of Internet nodes which construct their own special-purpose network on top of the Internet. Peer-to-Peer(P2P) systems can provide the capability to organize and utilize the huge amounts of resources in the Internet. Generally, we can taxonomize these decentralized systems into two categories: structured P2P systems and unstructured P2P systems. Structured P2P system are systems where nodes organize themselves in an orderly fashion and search is routed while unstructured P2P systems are ones where nodes organize themselves random and search is blind. Structured P2P systems provide an efficient lookup mechanism by means of DHTs(Distributed Hash Tables) while unstructured P2P systems use mostly broadcast search. Systems like CAN[3], Chord[4], Tapestry[6] and Koorder[7] are examples of the former, and Gnutella[2], Freenet[5] belong to the latter. The most important difference between structured and unstructured P2P systems is the determinate routing. A determinate routing can guarantee the location of an object and find the object in a preconcerted approach. In contrast to this, searching objects in unstructured P2P systems are indeterminate and it is often failed to find rare objects. 1 Research described in this paper is supported by The Science & Technology Committee of Shanghai Municipality Key Technologies R&D Project Grant 03dz15027 and by The Science & Technology Committee of Shanghai Municipality Key Project Grant

2 Considering the basic topology construction, we argue that the difference between unstructured and structured systems in routing guarantee is base on the topologic geometry. Structured systems provide an efficiently uniform geometry while unstructured systems are lack of uniform geometry. These uniform geometries may be tree, ring, hypercube and DHT technique can distribute p2p nodes on to the vertex of the geometry. In this way, the edge of geometries embodies the relationship of a pair of nodes in P2P systems. A link is referred to an edge but it is very different the edge from the dynamic characteristic. The link can be dynamically adjusted according to the change of node s neighbors and it reflects how well the node senses the system. We call the original node as the owner of the links. Though it depends on the requirements for all kinds of DHTs, in essence, each DHT geometry could provide three kinds of links: basic short links, redundant short links and long links. Basic short links are these links between the node and its adjacent nodes with only one hop. Likewise, redundant short links are these links sequentially following basic short links. That means they are these links between the node and its adjacent nodes with over one hop. The similarity of tow kinds of short links is that they maintain the connectivity of DHT geometry so that a request can be routed to any node in P2P systems. The difference is that basic short links are the commonness of all DHT geometries and must exist in the construction of DHT geometries, but redundant short links may not exist because they only enhance the connectivity of the underlying DHT geometry. Long links begin from current node to contact the remote distant nodes so as to shorten the network diameter, in that a request can be routed much faster. We use the links to capture the dynamic characteristic of structured peer-to-peer network and in nature it is the reflection of the dynamic geometry underlying the structured peer-to-peer network. DHT systems can forward a request only using its basic short links, however, it is usually inefficient and unreliable. Therefore, to design a DHT system, one should add additional links to the nude DHT geometry so as to enhance the system performance. As mentioned above, redundant short links can enhance the connectivity of the geometry that improves the fault-tolerance and long links can shorten the diameter of the geometry that reduces the average path length. In this way, we have provided the linking model to anatomise DHT algorithms. In next section, we will investigate several DHT systems to argue these inherent linked constructions and the direction of the improvement of their performance. The remainder of the paper is organized as follows. Section 2 investigates several popular P2P systems and provides the insight of links to these DHT geometries. Section 3 analyzes how the links impact on the routing performance and the construction of links and give the basic methods to establish links into DHT geometries. Experiments are discussed in Section 4 and we conclude our research and propose future work in the last section. 2. Links in DHTs We discuss several current DHT designs in this section. We make special investigations on their inherent geometric construction and research how links impact

3 their routing performance. We consider the following DHTs: Chord, CAN, Koorde and expect to provide the insight of links to DHT geometries through these typical designs. 2.1 Chord Chord [4] arranges all n nodes into a uniform circle. It uses a single dimensional circular identifier space and forwards messages based on numerical difference with the destination address. Chord maintains two sets of neighbors. Each node has a successor list that immediately follow it in the identifier space and a finger list which includes log(n) contacted nodes. These contacted nodes is formed as follows: current node with identifier (say) x maintains log(n) contacted nodes where the i th node is the node identifier closest to x+2 i on the circle. As described above, we can know that the successor list is just short links and the finger list is just the long links. So there are k short links(k is the size of the successor list) and log(n) long links. The geometry of Chord is a ring. The minimal connected ring need only a link as its basic short link. That means Chord could use only one link per node to make a determinate search. However, this design is very inefficient for its very weak connectivity and a large network diameter O(n). So the design needs to add redundant links to the robust connectivity and to add long links to shorten the network diameter. The successor list in Chord is just the redundant short links and the finger list is just the long links. In this design, Chord achieves O(logn) network diameter. 2.2 CAN Sylvia et al [3] proposed the Content Addressable Networks as a distributed infrastructure that provides hash table like functionality on internet-like scales. CAN use a d-torus that is partitioned among nodes such that every node owns a distinct zone within the space. Each node has 2d neighbors; neighbor i differs from the given node on only the i th bit. Using its neighbor coordinate set, a node routes a message towards its destination by simple greedy forwarding to the neighbor with coordinates closest to the destination coordinates. CAN embody hypercube geometry. To keep the minimal connected hypercube, it does need 2d links per node. Above described above, the design of CAN only provides 2d the basic short links, without any other links in CAN. Therefore, CAN is deficient in robust connectivity and has a longer network diameter (d/2)n (1/d). 2.3 Koorde Koorde [7] is a novel DHT that exploits de Bruijn graph [1]. It looks up a key by contacting log 2 n nodes with only 2 neighbors per node. A de Bruijn graph has a node for each binary number of b bits. For the geometry of de Bruijn graph, a node has two outgoing edges: node m has an edge to node 2m mod 2 b and an edge to node 2m+1 mode 2 b. It is easy to extend Koorde to k neighbors.

4 The de Bruijn graph is a compacted geometry so as to an optimal diameter. In essence, it is a minimal connected graph. So it has only the basic short links but can achieve an optimal diameter. This is a desired geometry which can keep a constant overheads with constant short links because long links would do more helps to shorten the diameter. We think it is a good choice to design the new DHT algorithm on a geometry which has inherent optimal diameter. However, the pure de Bruijn geometry is less resilience due to the lack of redundant short links. So Koorde has been designed to add k redundant short links in a similar way with Chord. 3 Link Analysis and Establishment After surveying classic P2P geometry, we give a more comprehensive understand of links in this section. First, we analyze how the links impact on the routing performance of P2P systems. Second, we give the basic methods to establish links into DHT geometries. 3.1 Link Analysis We use links to capture the dynamic relationship of nodes in structured P2P systems. These links form a structured geometry. We think that the well-organized and connected geometry underlying structured P2P systems is the radical difference with the free-riding unstructured P2P systems. According to the different function in the geometry, we distinguish three kinds of links, that is, the basic short link, the redundant short link, the long link. Although each kind of link has its function, the basic short link is the radical link of the geometry and is decided inherently by the geometry. Hence we emphasize on how the long links and the redundant short links impact the routing performance of P2P systems. We analyses the two metrics, average path length and resilience as follows Average path length The average path length is the average hops between every pair of nodes. It identifies how quickly a request is forward to the destination. The long link is an efficient way to improve the average path length. Chord adds long links to the basic geometry to get an optimizing average path length. CAN hasn t long links in that it gets a longer average path length. The methods to add long links are diversified and have still more widely space to be explored. We point out, however, it needs the tradeoff between the number of links and the maintenance overheads of links Resilience Resilience measures the extent to which DHTs can route around trouble even without the aid of recovery mechanisms that fix trouble. The basic short link is inner structure of the DHT geometry and redundant short links provide the chance to enhance its connectivity. The connectivity embodies the routing resilience to node failure. The lack of redundant short links would be less resilience, which will be frail for node

5 failure or spend a long path to be rewound. Resilience is a important aspect of P2P systems. As a special geometry without redundant short links, it is suggested to add redundant short links to improve the resilience. Koorde is a example as described in section Link Establishment As we have investigated in section 2, DHT systems build their routing algorithms based on a structured geometry and we can use link to capture the dynamic characteristics of the geometry and suggest there are three kinds of links in the geometry: the basic short link, the redundant short link, and the long links. We have pointed out that basic short links are the inner structure of various DHT geometries and the improved performance of DHT systems would rely on long links and additional redundant short links. Hence we discuss how to establish additional long links and redundant links into the geometries with only inner basic short links so as to improve the performance of P2P systems Long links Long links would shorten the average path length as mentioned above. Long links should be arranged appropriately so as to reach a good tradeoff between the number of long inks and the maintenance overheads of these links. We assume the node ID space is N. A general technique is to split the space into w non-overlapping sub intervals and establish one long link per sub-interval. That is, a node x may establish its w long links according to the formalizing description as follows: For a node whose id is x can establish log 2 (N) long links to these nodes whose id is i (x + 2 ) mod N, i (1,log 2(N)). Chord use this method and shorten path length to O(log 2 N). We can extend this method from one dimension to multiple dimensions. For a d-dimensional torus, we may assume that torus is of size m d, where m d = N and m is the width of each dimension of the torus. In each dimension, the node establishes log 2 (m) long links to nodes whose dimensional coordination is i (x + 2 ) mod m,i (1,log 2(m)). In this way, each node still maintains O(log 2 N) long links. This method can be applied to reconstruct CAN topology. However, we want to keep the merit of CAN with constant degree overheads. Hence we only add one long link along each dimension, that is, node x establishes one long link along each dimension to nodes whose correspondingly dimensional coordination is (x + 2/m) mod m. This method will reduce the average path length but still keep constant degree overheads as O(3d) Redundant short links Redundant short links will improve resilience performance because it can make routing continue to the destination even if the basic short links haven t been recovered from the failure. For one dimension such a circle, redundant short links would be established with the clockwise successors of the node. For multiple dimension, redundant short links can be established from the node to its adjacent nodes in torus

6 with hops 2,3,4 etc. 4 Experiments In this section, we observe how the links impact on DHT routing performance by simulation. For the better understanding the effect of links, we use CAN as the base of our simulation. More exactly, there are two reasons for selecting CAN: CAN has only 2d basic short links and it is the well-known DHT system. In section 4.1 and 4.2, we add long links and redundant short links to CAN respectively and observe the effect of links. We focus on two kinds of performance metrics: the average path length and resilience. 4.1 Effect of long links 35 9 Average path length(hops) CAN(D=2,L=0) CAN(D=2,L=2) Average path length(hops) CAN(D=4,L=4) CAN(D=6,L=0) The number of nodes The number of nodes Fig. 1. Effect of long links. Left: Comparing average path length between 0 and 2 long link (L) to 2-CAN. Right: Comparing average path length between additional long links and short links in higher dimension. Note that 4-CAN with additional long links has the same number of links with 6-CAN. We add additional long links to CAN in according to So each node in CAN has 3d links with the additional d long links distributed in each dimension. We run simulation in the network with node number form 64 to First, we observe the improved performance after long links are added to 2-CAN. Second, we add 4 additional long links to 4-CAN so that 4-CAN has the same number of links with 6- CAN, then we compare their routing performance. We want to know if long links have more important than short links in higher dimension on the improvement of average path length. Fig. 1 shows the simulated results. The left graph in Fig. 1 presents the improved path length with additional long links. As it is clear to see, with the number of nodes increases, long links decrease the average path length more significantly. It can be explained that long links have more widely space to shorten the diameter of the network as the number of nodes increases. As shown in the right graph in Fig. 1, the performance with additional long links is better than short links in

7 higher dimension. Hence, the use of long links might be the preferred option if one is focusing on the improvement of the average path length. 4.2 Effect of redundant short links We add additional redundant short link with the methods described in section As mentioned earlier, short links focus on the connectivity of the network. The basic short link is inner structure of the DHT geometry and redundant short links provide the chance to enhance its connectivity. The connectivity embodies the routing resilience to node failure. To observe how redundant short links impact on the resilience, we let some fixed fraction of uniformly chosen nodes fail and disable the failure recovery mechanism. In this case, we define failed routing as any two alive nodes cannot be connected. Fig. 2 shows the simulated results. The higher failed routing is because the failure recovery mechanism has been disabled. The left graph in Fig. 2 presents the resilience would be gradually improved with the increasing redundant short links. This is because of the enhanced connectivity with redundant short links. The right graph in Fig. 2 plots the resilience in different dimension CAN. It clearly shows that the improvement in higher dimension would be less significant. This is because higher dimension CAN has more basic links than lower dimension. Hence, the effect of redundant short links would decrease accordingly CAN(D=2,RSL=0) CAN(D=2,RSL=2) CAN(D=4,RSL=0) CAN(D=4,RSL=2) CAN(D=6,RSL=0) CAN(D=6,RSL=2) Failed routing(%) CAN(D=2,RSL=0) CAN(D=2,RSL=1) CAN(D=2,RSL=2) CAN(D=2,RSL=3) CAN(D=2,RSL=4) Failed routing(%) Failed nodes(%) Failed Node(%) Fig. 2. Effect of redundant short links. Left: Percentage of failed routing for varying percentages of node failures considering varying numbers of redundant short links (RSL) to CAN with fixed dimension in the network of 1024 nodes. Right: Comparing failed routing between 0 and 2 redundant short links to different dimension CAN in the network of 1024 nodes. 5 Conclusions and Future work In this paper, we have researched the effect of links on DHT routing algorithms. Firstly, we investigate current several DHT algorithms and provide the insight of links to these algorithms and the direction of the improvement of their performance. Secondly, we analyze how links in DHT routing algorithm would impact the routing performance of peer-to-peer systems. Then we give the basic methods to establish

8 links into DHT geometries. Our simulation results have demonstrated the great effect of links on the routing performance and have given a basic scheme to design new DHT algorithms and redesign current DHT algorithms. Now there are several directions to extend our approach: (1) More current DHT algorithms may need to be investigated so as to provide a deep understanding how links affect routing performance and give the possible improved directions of their performance based on the effect of different kinds of links. (2) Considering the effect of links, more metrics such as load balance need to be investigated besides path length and resilience. (3) It will be an interesting and a worthwhile effort to explore how links would affect the physical delay on the underlying network. References [1] DE BRUIJN, N Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem. Indag. Math. 34, 5, [2] Gnutella. [3] S. Ratnaswamy, P. Francis, M. Handley, R. Karp, and S.Shenker. A scalable contentaddressable network. ACM SIGCOMM, [4] I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A peer-to-peer lookup service for internet applications. ACM SIGCOMM, [5] I. Clarke, O. Sandberg, B. Wiley, and T.W. Hong. Freenet: Adistributed anonymous information storage and retrieval system in designing privacy enhancing echnologies.international Workshop on Design Issues in Anonymity and Unobservability, LNCS 2009, [6] B. Zhao, K. Kubiatowicz, and A. Joseph. Tapestry: An infrastructure for fault-resilient wide-area location and routing. Technical Report UCB//CSD , University of California at Berkeley, April [7] M. Frans Kaashoek, David R. Karger. Koorde: A simple degree-optimal distributed hash table. in 2st International Workshop on Peer-to-Peer Systems (IPTPS'03) Berkeley, CA, USA.

A Framework for Peer-To-Peer Lookup Services based on k-ary search

A Framework for Peer-To-Peer Lookup Services based on k-ary search A Framework for Peer-To-Peer Lookup Services based on k-ary search Sameh El-Ansary Swedish Institute of Computer Science Kista, Sweden Luc Onana Alima Department of Microelectronics and Information Technology

More information

Distributed Hash Table

Distributed Hash Table Distributed Hash Table P2P Routing and Searching Algorithms Ruixuan Li College of Computer Science, HUST rxli@public.wh.hb.cn http://idc.hust.edu.cn/~rxli/ In Courtesy of Xiaodong Zhang, Ohio State Univ

More information

Scalability In Peer-to-Peer Systems. Presented by Stavros Nikolaou

Scalability In Peer-to-Peer Systems. Presented by Stavros Nikolaou Scalability In Peer-to-Peer Systems Presented by Stavros Nikolaou Background on Peer-to-Peer Systems Definition: Distributed systems/applications featuring: No centralized control, no hierarchical organization

More information

Early Measurements of a Cluster-based Architecture for P2P Systems

Early Measurements of a Cluster-based Architecture for P2P Systems Early Measurements of a Cluster-based Architecture for P2P Systems Balachander Krishnamurthy, Jia Wang, Yinglian Xie I. INTRODUCTION Peer-to-peer applications such as Napster [4], Freenet [1], and Gnutella

More information

DYNAMIC TREE-LIKE STRUCTURES IN P2P-NETWORKS

DYNAMIC TREE-LIKE STRUCTURES IN P2P-NETWORKS DYNAMIC TREE-LIKE STRUCTURES IN P2P-NETWORKS Herwig Unger Markus Wulff Department of Computer Science University of Rostock D-1851 Rostock, Germany {hunger,mwulff}@informatik.uni-rostock.de KEYWORDS P2P,

More information

ReCord: A Distributed Hash Table with Recursive Structure

ReCord: A Distributed Hash Table with Recursive Structure ReCord: A Distributed Hash Table with Recursive Structure Jianyang Zeng and Wen-Jing Hsu Abstract We propose a simple distributed hash table called ReCord, which is a generalized version of Randomized-

More information

A Chord-Based Novel Mobile Peer-to-Peer File Sharing Protocol

A Chord-Based Novel Mobile Peer-to-Peer File Sharing Protocol A Chord-Based Novel Mobile Peer-to-Peer File Sharing Protocol Min Li 1, Enhong Chen 1, and Phillip C-y Sheu 2 1 Department of Computer Science and Technology, University of Science and Technology of China,

More information

Athens University of Economics and Business. Dept. of Informatics

Athens University of Economics and Business. Dept. of Informatics Athens University of Economics and Business Athens University of Economics and Business Dept. of Informatics B.Sc. Thesis Project report: Implementation of the PASTRY Distributed Hash Table lookup service

More information

Building a low-latency, proximity-aware DHT-based P2P network

Building a low-latency, proximity-aware DHT-based P2P network Building a low-latency, proximity-aware DHT-based P2P network Ngoc Ben DANG, Son Tung VU, Hoai Son NGUYEN Department of Computer network College of Technology, Vietnam National University, Hanoi 144 Xuan

More information

A Directed-multicast Routing Approach with Path Replication in Content Addressable Network

A Directed-multicast Routing Approach with Path Replication in Content Addressable Network 2010 Second International Conference on Communication Software and Networks A Directed-multicast Routing Approach with Path Replication in Content Addressable Network Wenbo Shen, Weizhe Zhang, Hongli Zhang,

More information

Decentralized Object Location In Dynamic Peer-to-Peer Distributed Systems

Decentralized Object Location In Dynamic Peer-to-Peer Distributed Systems Decentralized Object Location In Dynamic Peer-to-Peer Distributed Systems George Fletcher Project 3, B649, Dr. Plale July 16, 2003 1 Introduction One of the key requirements for global level scalability

More information

Query Processing Over Peer-To-Peer Data Sharing Systems

Query Processing Over Peer-To-Peer Data Sharing Systems Query Processing Over Peer-To-Peer Data Sharing Systems O. D. Şahin A. Gupta D. Agrawal A. El Abbadi Department of Computer Science University of California at Santa Barbara odsahin, abhishek, agrawal,

More information

Fault Resilience of Structured P2P Systems

Fault Resilience of Structured P2P Systems Fault Resilience of Structured P2P Systems Zhiyu Liu 1, Guihai Chen 1, Chunfeng Yuan 1, Sanglu Lu 1, and Chengzhong Xu 2 1 National Laboratory of Novel Software Technology, Nanjing University, China 2

More information

Distriubted Hash Tables and Scalable Content Adressable Network (CAN)

Distriubted Hash Tables and Scalable Content Adressable Network (CAN) Distriubted Hash Tables and Scalable Content Adressable Network (CAN) Ines Abdelghani 22.09.2008 Contents 1 Introduction 2 2 Distributed Hash Tables: DHT 2 2.1 Generalities about DHTs............................

More information

A Scalable Content- Addressable Network

A Scalable Content- Addressable Network A Scalable Content- Addressable Network In Proceedings of ACM SIGCOMM 2001 S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker Presented by L.G. Alex Sung 9th March 2005 for CS856 1 Outline CAN basics

More information

A Structured Overlay for Non-uniform Node Identifier Distribution Based on Flexible Routing Tables

A Structured Overlay for Non-uniform Node Identifier Distribution Based on Flexible Routing Tables A Structured Overlay for Non-uniform Node Identifier Distribution Based on Flexible Routing Tables Takehiro Miyao, Hiroya Nagao, Kazuyuki Shudo Tokyo Institute of Technology 2-12-1 Ookayama, Meguro-ku,

More information

Peer-to-Peer Systems. Chapter General Characteristics

Peer-to-Peer Systems. Chapter General Characteristics Chapter 2 Peer-to-Peer Systems Abstract In this chapter, a basic overview is given of P2P systems, architectures, and search strategies in P2P systems. More specific concepts that are outlined include

More information

Degree Optimal Deterministic Routing for P2P Systems

Degree Optimal Deterministic Routing for P2P Systems Degree Optimal Deterministic Routing for P2P Systems Gennaro Cordasco Luisa Gargano Mikael Hammar Vittorio Scarano Abstract We propose routing schemes that optimize the average number of hops for lookup

More information

Cycloid: A Constant-Degree and Lookup-Efficient P2P Overlay Network

Cycloid: A Constant-Degree and Lookup-Efficient P2P Overlay Network Cycloid: A Constant-Degree and Lookup-Efficient P2P Overlay Network Haiying Shen and Cheng-Zhong Xu, Wayne State University, Detroit, MI 48202 Guihai Chen, Nanjing University, Nanjing, China {shy,czxu,gchen}@ece.eng.wayne.edu

More information

L3S Research Center, University of Hannover

L3S Research Center, University of Hannover , University of Hannover Dynamics of Wolf-Tilo Balke and Wolf Siberski 21.11.2007 *Original slides provided by S. Rieche, H. Niedermayer, S. Götz, K. Wehrle (University of Tübingen) and A. Datta, K. Aberer

More information

PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity

PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity 546 PAPER Special Section on Parallel/Distributed Computing and Networking PChord: Improvement on Chord to Achieve Better Routing Efficiency by Exploiting Proximity Feng HONG a),mingluli,minyouwu, and

More information

: Scalable Lookup

: Scalable Lookup 6.824 2006: Scalable Lookup Prior focus has been on traditional distributed systems e.g. NFS, DSM/Hypervisor, Harp Machine room: well maintained, centrally located. Relatively stable population: can be

More information

SplitQuest: Controlled and Exhaustive Search in Peer-to-Peer Networks

SplitQuest: Controlled and Exhaustive Search in Peer-to-Peer Networks SplitQuest: Controlled and Exhaustive Search in Peer-to-Peer Networks Pericles Lopes Ronaldo A. Ferreira pericles@facom.ufms.br raf@facom.ufms.br College of Computing, Federal University of Mato Grosso

More information

P2P Overlay Networks of Constant Degree

P2P Overlay Networks of Constant Degree P2P Overlay Networks of Constant Degree Guihai Chen,2, Chengzhong Xu 2, Haiying Shen 2, and Daoxu Chen State Key Lab of Novel Software Technology, Nanjing University, China 2 Department of Electrical and

More information

LessLog: A Logless File Replication Algorithm for Peer-to-Peer Distributed Systems

LessLog: A Logless File Replication Algorithm for Peer-to-Peer Distributed Systems LessLog: A Logless File Replication Algorithm for Peer-to-Peer Distributed Systems Kuang-Li Huang, Tai-Yi Huang and Jerry C. Y. Chou Department of Computer Science National Tsing Hua University Hsinchu,

More information

Distributed Hash Tables

Distributed Hash Tables Distributed Hash Tables Chord Smruti R. Sarangi Department of Computer Science Indian Institute of Technology New Delhi, India Smruti R. Sarangi Chord 1/29 Outline Overview 1 Overview 2 3 Smruti R. Sarangi

More information

Overlay and P2P Networks. Structured Networks and DHTs. Prof. Sasu Tarkoma

Overlay and P2P Networks. Structured Networks and DHTs. Prof. Sasu Tarkoma Overlay and P2P Networks Structured Networks and DHTs Prof. Sasu Tarkoma 6.2.2014 Contents Today Semantic free indexing Consistent Hashing Distributed Hash Tables (DHTs) Thursday (Dr. Samu Varjonen) DHTs

More information

PEER-TO-PEER (P2P) systems are now one of the most

PEER-TO-PEER (P2P) systems are now one of the most IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 25, NO. 1, JANUARY 2007 15 Enhancing Peer-to-Peer Systems Through Redundancy Paola Flocchini, Amiya Nayak, Senior Member, IEEE, and Ming Xie Abstract

More information

Content Overlays. Nick Feamster CS 7260 March 12, 2007

Content Overlays. Nick Feamster CS 7260 March 12, 2007 Content Overlays Nick Feamster CS 7260 March 12, 2007 Content Overlays Distributed content storage and retrieval Two primary approaches: Structured overlay Unstructured overlay Today s paper: Chord Not

More information

Dynamic Load Sharing in Peer-to-Peer Systems: When some Peers are more Equal than Others

Dynamic Load Sharing in Peer-to-Peer Systems: When some Peers are more Equal than Others Dynamic Load Sharing in Peer-to-Peer Systems: When some Peers are more Equal than Others Sabina Serbu, Silvia Bianchi, Peter Kropf and Pascal Felber Computer Science Department, University of Neuchâtel

More information

L3S Research Center, University of Hannover

L3S Research Center, University of Hannover , University of Hannover Structured Peer-to to-peer Networks Wolf-Tilo Balke and Wolf Siberski 3..6 *Original slides provided by K. Wehrle, S. Götz, S. Rieche (University of Tübingen) Peer-to-Peer Systems

More information

Lecture 6: Overlay Networks. CS 598: Advanced Internetworking Matthew Caesar February 15, 2011

Lecture 6: Overlay Networks. CS 598: Advanced Internetworking Matthew Caesar February 15, 2011 Lecture 6: Overlay Networks CS 598: Advanced Internetworking Matthew Caesar February 15, 2011 1 Overlay networks: Motivations Protocol changes in the network happen very slowly Why? Internet is shared

More information

Architectures for Distributed Systems

Architectures for Distributed Systems Distributed Systems and Middleware 2013 2: Architectures Architectures for Distributed Systems Components A distributed system consists of components Each component has well-defined interface, can be replaced

More information

P2P: Distributed Hash Tables

P2P: Distributed Hash Tables P2P: Distributed Hash Tables Chord + Routing Geometries Nirvan Tyagi CS 6410 Fall16 Peer-to-peer (P2P) Peer-to-peer (P2P) Decentralized! Hard to coordinate with peers joining and leaving Peer-to-peer (P2P)

More information

Cycloid: A Constant-Degree and Lookup-Efficient P2P Overlay Network

Cycloid: A Constant-Degree and Lookup-Efficient P2P Overlay Network Cycloid: A Constant-Degree and Lookup-Efficient P2P Overlay Network Haiying Shen and Cheng-Zhong Xu Department of Electrical & Computer Engg. Wayne State University, Detroit, MI 48202 {shy,czxu}@ece.eng.wayne.edu

More information

BAKE: A Balanced Kautz Tree Structure for Peer-to-Peer Networks

BAKE: A Balanced Kautz Tree Structure for Peer-to-Peer Networks : A Balanced Kautz Tree Structure for Peer-to-Peer Networks Deke Guo, Honghui Chen, Yunhao Liu, and Xiangyang Li College of Information Systems and Management, National University of Defense Technology,

More information

Motivation. The Impact of DHT Routing Geometry on Resilience and Proximity. Different components of analysis. Approach:Component-based analysis

Motivation. The Impact of DHT Routing Geometry on Resilience and Proximity. Different components of analysis. Approach:Component-based analysis The Impact of DHT Routing Geometry on Resilience and Proximity Presented by Karthik Lakshminarayanan at P2P Systems class (Slides liberally borrowed from Krishna s SIGCOMM talk) Krishna Gummadi, Ramakrishna

More information

Structured P2P. Complexity O(log N)

Structured P2P. Complexity O(log N) Structured P2P. Complexity O(log N) Student: Santiago Peña Luque Communication Technologies 1 Year : 2005 INDEX 1. Introduction to P2P systems 2. Complexity 3. Structured Systems:DHT 4. Specific DHT algorithms

More information

CS555: Distributed Systems [Fall 2017] Dept. Of Computer Science, Colorado State University

CS555: Distributed Systems [Fall 2017] Dept. Of Computer Science, Colorado State University CS 555: DISTRIBUTED SYSTEMS [P2P SYSTEMS] Shrideep Pallickara Computer Science Colorado State University Frequently asked questions from the previous class survey Byzantine failures vs malicious nodes

More information

The Impact of DHT Routing Geometry on Resilience and Proximity. Acknowledgement. Motivation

The Impact of DHT Routing Geometry on Resilience and Proximity. Acknowledgement. Motivation The Impact of DHT Routing Geometry on Resilience and Proximity Presented by Noorullah Moghul Krishna Gummadi, Ramakrishna Gummadi, Sylvia Ratnasamy, Steve Gribble, Scott Shenker, Ion Stoica Acknowledgement

More information

Implications of Neighbor Selection on DHT Overlays

Implications of Neighbor Selection on DHT Overlays Implications of Neighbor Selection on DHT Overlays Yingwu Zhu Department of CSSE, Seattle University zhuy@seattleu.edu Xiaoyu Yang Department of ECECS, University of Cincinnati yangxu@ececs.uc.edu Abstract

More information

Simulations of Chord and Freenet Peer-to-Peer Networking Protocols Mid-Term Report

Simulations of Chord and Freenet Peer-to-Peer Networking Protocols Mid-Term Report Simulations of Chord and Freenet Peer-to-Peer Networking Protocols Mid-Term Report Computer Communications and Networking (SC 546) Professor D. Starobinksi Brian Mitchell U09-62-9095 James Nunan U38-03-0277

More information

CS514: Intermediate Course in Computer Systems

CS514: Intermediate Course in Computer Systems Distributed Hash Tables (DHT) Overview and Issues Paul Francis CS514: Intermediate Course in Computer Systems Lecture 26: Nov 19, 2003 Distributed Hash Tables (DHT): Overview and Issues What is a Distributed

More information

UC Berkeley UC Berkeley Previously Published Works

UC Berkeley UC Berkeley Previously Published Works UC Berkeley UC Berkeley Previously Published Works Title Impact of neighbor selection on performance and resilience of structured P2P networks Permalink https://escholarship.org/uc/item/9tq2wn2 Authors

More information

Should we build Gnutella on a structured overlay? We believe

Should we build Gnutella on a structured overlay? We believe Should we build on a structured overlay? Miguel Castro, Manuel Costa and Antony Rowstron Microsoft Research, Cambridge, CB3 FB, UK Abstract There has been much interest in both unstructured and structured

More information

Flexible Information Discovery in Decentralized Distributed Systems

Flexible Information Discovery in Decentralized Distributed Systems Flexible Information Discovery in Decentralized Distributed Systems Cristina Schmidt and Manish Parashar The Applied Software Systems Laboratory Department of Electrical and Computer Engineering, Rutgers

More information

Chord : A Scalable Peer-to-Peer Lookup Protocol for Internet Applications

Chord : A Scalable Peer-to-Peer Lookup Protocol for Internet Applications : A Scalable Peer-to-Peer Lookup Protocol for Internet Applications Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M. Frans Kaashock, Frank Dabek, Hari Balakrishnan March 4, 2013 One slide

More information

Evolution of Peer-to-peer algorithms: Past, present and future.

Evolution of Peer-to-peer algorithms: Past, present and future. Evolution of Peer-to-peer algorithms: Past, present and future. Alexei Semenov Helsinki University of Technology alexei.semenov@hut.fi Abstract Today peer-to-peer applications are widely used for different

More information

Peer-To-Peer Techniques

Peer-To-Peer Techniques PG DynaSearch Markus Benter 31th October, 2013 Introduction Centralized P2P-Networks Unstructured P2P-Networks Structured P2P-Networks Misc 1 What is a Peer-to-Peer System? Definition Peer-to-peer systems

More information

Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications

Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan Presented by Veranika Liaukevich Jacobs University

More information

Cycloid: A constant-degree and lookup-efficient P2P overlay network

Cycloid: A constant-degree and lookup-efficient P2P overlay network Performance Evaluation xxx (2005) xxx xxx Cycloid: A constant-degree and lookup-efficient P2P overlay network Haiying Shen a, Cheng-Zhong Xu a,, Guihai Chen b a Department of Electrical and Computer Engineering,

More information

Relaxing Routing Table to Alleviate Dynamism in P2P Systems

Relaxing Routing Table to Alleviate Dynamism in P2P Systems Relaxing Routing Table to Alleviate Dynamism in P2P Systems Hui FANG 1, Wen Jing HSU 2, and Larry RUDOLPH 3 1 Singapore-MIT Alliance, National University of Singapore 2 Nanyang Technological University,

More information

Dorina Luminiţa COPACI, Constantin Alin COPACI

Dorina Luminiţa COPACI, Constantin Alin COPACI THE DESIGN OF RESILIENCE P2P NETWORKS WITH DISTRIBUTED HASH TABLES Dorina Luminiţa COPACI, Constantin Alin COPACI lcopaci@yahoo.com, acopaci@yahoo.com Abstract The term resilience in computer systems and

More information

P2P Network Structured Networks: Distributed Hash Tables. Pedro García López Universitat Rovira I Virgili

P2P Network Structured Networks: Distributed Hash Tables. Pedro García López Universitat Rovira I Virgili P2P Network Structured Networks: Distributed Hash Tables Pedro García López Universitat Rovira I Virgili Pedro.garcia@urv.net Index Description of CHORD s Location and routing mechanisms Symphony: Distributed

More information

Peer to peer systems: An overview

Peer to peer systems: An overview Peer to peer systems: An overview Gaurav Veda (Y1148) gveda@cse.iitk.ac.in Computer Science & Engineering Indian Institute of Technology Kanpur, UP, INDIA - 208016 Abstract Peer-to-peer (p2p) systems is

More information

08 Distributed Hash Tables

08 Distributed Hash Tables 08 Distributed Hash Tables 2/59 Chord Lookup Algorithm Properties Interface: lookup(key) IP address Efficient: O(log N) messages per lookup N is the total number of servers Scalable: O(log N) state per

More information

DATA. The main challenge in P2P computing is to design and implement LOOKING UP. in P2P Systems

DATA. The main challenge in P2P computing is to design and implement LOOKING UP. in P2P Systems LOOKING UP DATA in P2P Systems By Hari Balakrishnan, M. Frans Kaashoek, David Karger, Robert Morris, and Ion Stoica The main challenge in P2P computing is to design and implement a robust and scalable

More information

EARM: An Efficient and Adaptive File Replication with Consistency Maintenance in P2P Systems.

EARM: An Efficient and Adaptive File Replication with Consistency Maintenance in P2P Systems. : An Efficient and Adaptive File Replication with Consistency Maintenance in P2P Systems. 1 K.V.K.Chaitanya, 2 Smt. S.Vasundra, M,Tech., (Ph.D), 1 M.Tech (Computer Science), 2 Associate Professor, Department

More information

Peer-to-Peer Systems and Distributed Hash Tables

Peer-to-Peer Systems and Distributed Hash Tables Peer-to-Peer Systems and Distributed Hash Tables CS 240: Computing Systems and Concurrency Lecture 8 Marco Canini Credits: Michael Freedman and Kyle Jamieson developed much of the original material. Selected

More information

Diminished Chord: A Protocol for Heterogeneous Subgroup Formation in Peer-to-Peer Networks

Diminished Chord: A Protocol for Heterogeneous Subgroup Formation in Peer-to-Peer Networks Diminished Chord: A Protocol for Heterogeneous Subgroup Formation in Peer-to-Peer Networks David R. Karger 1 and Matthias Ruhl 2 1 MIT Computer Science and Artificial Intelligence Laboratory Cambridge,

More information

BOOTSTRAPPING LOCALITY-AWARE P2P NETWORKS

BOOTSTRAPPING LOCALITY-AWARE P2P NETWORKS BOOTSTRAPPING LOCALITY-AWARE PP NETWORKS Curt Cramer, Kendy Kutzner, and Thomas Fuhrmann Institut für Telematik, Universität Karlsruhe (TH), Germany {curt.cramer kendy.kutzner thomas.fuhrmann}@ira.uka.de

More information

Chord: A Scalable Peer-to-peer Lookup Service For Internet Applications

Chord: A Scalable Peer-to-peer Lookup Service For Internet Applications Chord: A Scalable Peer-to-peer Lookup Service For Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan Presented by Jibin Yuan ION STOICA Professor of CS

More information

A Survey of Peer-to-Peer Content Distribution Technologies

A Survey of Peer-to-Peer Content Distribution Technologies A Survey of Peer-to-Peer Content Distribution Technologies Stephanos Androutsellis-Theotokis and Diomidis Spinellis ACM Computing Surveys, December 2004 Presenter: Seung-hwan Baek Ja-eun Choi Outline Overview

More information

Today. Why might P2P be a win? What is a Peer-to-Peer (P2P) system? Peer-to-Peer Systems and Distributed Hash Tables

Today. Why might P2P be a win? What is a Peer-to-Peer (P2P) system? Peer-to-Peer Systems and Distributed Hash Tables Peer-to-Peer Systems and Distributed Hash Tables COS 418: Distributed Systems Lecture 7 Today 1. Peer-to-Peer Systems Napster, Gnutella, BitTorrent, challenges 2. Distributed Hash Tables 3. The Chord Lookup

More information

Peer-to-Peer (P2P) Systems

Peer-to-Peer (P2P) Systems Peer-to-Peer (P2P) Systems What Does Peer-to-Peer Mean? A generic name for systems in which peers communicate directly and not through a server Characteristics: decentralized self-organizing distributed

More information

Structured Peer-to-Peer Networks

Structured Peer-to-Peer Networks Structured Peer-to-Peer Networks The P2P Scaling Problem Unstructured P2P Revisited Distributed Indexing Fundamentals of Distributed Hash Tables DHT Algorithms Chord Pastry Can Programming a DHT Graphics

More information

CSE 486/586 Distributed Systems

CSE 486/586 Distributed Systems CSE 486/586 Distributed Systems Distributed Hash Tables Slides by Steve Ko Computer Sciences and Engineering University at Buffalo CSE 486/586 Last Time Evolution of peer-to-peer Central directory (Napster)

More information

Searching for Shared Resources: DHT in General

Searching for Shared Resources: DHT in General 1 ELT-53206 Peer-to-Peer Networks Searching for Shared Resources: DHT in General Mathieu Devos Tampere University of Technology Department of Electronics and Communications Engineering Based on the original

More information

Searching for Shared Resources: DHT in General

Searching for Shared Resources: DHT in General 1 ELT-53207 P2P & IoT Systems Searching for Shared Resources: DHT in General Mathieu Devos Tampere University of Technology Department of Electronics and Communications Engineering Based on the original

More information

Distributed Balanced Tables: Not Making a Hash of it All

Distributed Balanced Tables: Not Making a Hash of it All Distributed Balanced Tables: Not Making a Hash of it All Prasanna Ganesan Mayank Bawa Stanford University fprasanna, bawag@db.stanford.edu Abstract DHTs implement a distributed dictionary, supporting key

More information

Lecture-2 Content Sharing in P2P Networks Different P2P Protocols

Lecture-2 Content Sharing in P2P Networks Different P2P Protocols Lecture-2 Content Sharing in P2P Networks Different P2P Protocols Zhou Shuigeng March 10, 2005 Outline Classification of content sharing P2P systems Content sharing P2P systems Napster; Gnutella; Freenet

More information

Resilience of Structured Peer to Peer Systems: Analysis and Enhancement

Resilience of Structured Peer to Peer Systems: Analysis and Enhancement Resilience of Structured Peer to Peer Systems: 1 Analysis and Enhancement Dong Xuan, Sriram Chellappan and Xun Wang Abstract In this paper, we attempt to provide an extensive and detailed summary of existing

More information

Symphony. Symphony. Acknowledgement. DHTs: : The Big Picture. Spectrum of DHT Protocols. Distributed Hashing in a Small World

Symphony. Symphony. Acknowledgement. DHTs: : The Big Picture. Spectrum of DHT Protocols. Distributed Hashing in a Small World Distributed Hashing in a Small World Gurmeet Singh Manku Stanford University with Mayank Bawa and Prabhakar Raghavan Acknowledgement The following slides are borrowed from the author s talk at USITS 2003.

More information

Performance Modelling of Peer-to-Peer Routing

Performance Modelling of Peer-to-Peer Routing Performance Modelling of Peer-to-Peer Routing Idris A. Rai, Andrew Brampton, Andrew MacQuire and Laurent Mathy Computing Department, Lancaster University {rai,brampton,macquire,laurent}@comp.lancs.ac.uk

More information

Introduction to Peer-to-Peer Systems

Introduction to Peer-to-Peer Systems Introduction Introduction to Peer-to-Peer Systems Peer-to-peer (PP) systems have become extremely popular and contribute to vast amounts of Internet traffic PP basic definition: A PP system is a distributed

More information

A Hybrid Peer-to-Peer Architecture for Global Geospatial Web Service Discovery

A Hybrid Peer-to-Peer Architecture for Global Geospatial Web Service Discovery A Hybrid Peer-to-Peer Architecture for Global Geospatial Web Service Discovery Shawn Chen 1, Steve Liang 2 1 Geomatics, University of Calgary, hschen@ucalgary.ca 2 Geomatics, University of Calgary, steve.liang@ucalgary.ca

More information

CIS 700/005 Networking Meets Databases

CIS 700/005 Networking Meets Databases Announcements CIS / Networking Meets Databases Boon Thau Loo Spring Lecture Paper summaries due at noon today. Office hours: Wed - pm ( Levine) Project proposal: due Feb. Student presenter: rd Jan: A Scalable

More information

Survive Under High Churn in Structured P2P Systems: Evaluation and Strategy

Survive Under High Churn in Structured P2P Systems: Evaluation and Strategy Survive Under High Churn in Structured P2P Systems: Evaluation and Strategy Zhiyu Liu, Ruifeng Yuan, Zhenhua Li, Hongxing Li, and Guihai Chen State Key Laboratory of Novel Software Technology, Nanjing

More information

Exploiting the Synergy between Peer-to-Peer and Mobile Ad Hoc Networks

Exploiting the Synergy between Peer-to-Peer and Mobile Ad Hoc Networks Exploiting the Synergy between Peer-to-Peer and Mobile Ad Hoc Networks Y. Charlie Hu, Saumitra M. Das, and Himabindu Pucha Purdue University West Lafayette, IN 47907 {ychu, smdas, hpucha}@purdue.edu Abstract

More information

A Super-Peer Based Lookup in Structured Peer-to-Peer Systems

A Super-Peer Based Lookup in Structured Peer-to-Peer Systems A Super-Peer Based Lookup in Structured Peer-to-Peer Systems Yingwu Zhu Honghao Wang Yiming Hu ECECS Department ECECS Department ECECS Department University of Cincinnati University of Cincinnati University

More information

March 10, Distributed Hash-based Lookup. for Peer-to-Peer Systems. Sandeep Shelke Shrirang Shirodkar MTech I CSE

March 10, Distributed Hash-based Lookup. for Peer-to-Peer Systems. Sandeep Shelke Shrirang Shirodkar MTech I CSE for for March 10, 2006 Agenda for Peer-to-Peer Sytems Initial approaches to Their Limitations CAN - Applications of CAN Design Details Benefits for Distributed and a decentralized architecture No centralized

More information

Impact of Neighbor Selection on Performance and Resilience of Structured P2P Networks

Impact of Neighbor Selection on Performance and Resilience of Structured P2P Networks Impact of Neighbor Selection on Performance and Resilience of Structured P2P Networks Byung-Gon Chun, Ben Y. Zhao 2, and John D. Kubiatowicz Computer Science Division, U.C. Berkeley {bgchun, kubitron}@cs.berkeley.edu

More information

Distributed hash table - Wikipedia, the free encyclopedia

Distributed hash table - Wikipedia, the free encyclopedia Page 1 sur 6 Distributed hash table From Wikipedia, the free encyclopedia Distributed hash tables (DHTs) are a class of decentralized distributed systems that provide a lookup service similar to a hash

More information

Telecommunication Services Engineering Lab. Roch H. Glitho

Telecommunication Services Engineering Lab. Roch H. Glitho 1 Support Infrastructure Support infrastructure for application layer Why? Re-usability across application layer protocols Modularity (i.e. separation between application layer protocol specification /

More information

Goals. EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Solution. Overlay Networks: Motivations.

Goals. EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Solution. Overlay Networks: Motivations. Goals CS : Introduction to Computer Networks Overlay Networks and PP Networks Ion Stoica Computer Science Division Department of lectrical ngineering and Computer Sciences University of California, Berkeley

More information

Application Layer Multicast For Efficient Peer-to-Peer Applications

Application Layer Multicast For Efficient Peer-to-Peer Applications Application Layer Multicast For Efficient Peer-to-Peer Applications Adam Wierzbicki 1 e-mail: adamw@icm.edu.pl Robert Szczepaniak 1 Marcin Buszka 1 1 Polish-Japanese Institute of Information Technology

More information

Badri Nath Rutgers University

Badri Nath Rutgers University lookup services Badri Nath Rutgers University badri@cs.rutgers.edu 1. CAN: A scalable content addressable network, Sylvia Ratnasamy et.al. SIGCOMM 2001 2. Chord: A scalable peer-to-peer lookup protocol

More information

Introduction to P2P Computing

Introduction to P2P Computing Introduction to P2P Computing Nicola Dragoni Embedded Systems Engineering DTU Compute 1. Introduction A. Peer-to-Peer vs. Client/Server B. Overlay Networks 2. Common Topologies 3. Data Location 4. Gnutella

More information

Diminished Chord: A Protocol for Heterogeneous Subgroup Formation in Peer-to-Peer Networks

Diminished Chord: A Protocol for Heterogeneous Subgroup Formation in Peer-to-Peer Networks Diminished Chord: A Protocol for Heterogeneous Subgroup Formation in Peer-to-Peer Networks David R. Karger MIT karger@lcs.mit.edu Matthias Ruhl IBM Almaden ruhl@almaden.ibm.com Abstract In most of the

More information

Securing Chord for ShadowWalker. Nandit Tiku Department of Computer Science University of Illinois at Urbana-Champaign

Securing Chord for ShadowWalker. Nandit Tiku Department of Computer Science University of Illinois at Urbana-Champaign Securing Chord for ShadowWalker Nandit Tiku Department of Computer Science University of Illinois at Urbana-Champaign tiku1@illinois.edu ABSTRACT Peer to Peer anonymous communication promises to eliminate

More information

Chord-based Key Establishment Schemes for Sensor Networks

Chord-based Key Establishment Schemes for Sensor Networks Chord-based Key Establishment Schemes for Sensor Networks Fan Zhang, Zhijie Jerry Shi, Bing Wang Department of Computer Science and Engineering, University of Connecticut, Storrs, CT 06269 Abstract Because

More information

FPN: A Distributed Hash Table for Commercial Applications

FPN: A Distributed Hash Table for Commercial Applications FPN: A Distributed Hash Table for Commercial Applications Cezary Dubnicki, Cristian Ungureanu, Wojciech Kilian NEC Laboratories Princeton, NJ, USA {dubnicki, cristian, wkilian}@nec-labs.com Abstract Distributed

More information

CompSci 356: Computer Network Architectures Lecture 21: Overlay Networks Chap 9.4. Xiaowei Yang

CompSci 356: Computer Network Architectures Lecture 21: Overlay Networks Chap 9.4. Xiaowei Yang CompSci 356: Computer Network Architectures Lecture 21: Overlay Networks Chap 9.4 Xiaowei Yang xwy@cs.duke.edu Overview Problem Evolving solutions IP multicast Proxy caching Content distribution networks

More information

Overlay and P2P Networks. Structured Networks and DHTs. Prof. Sasu Tarkoma

Overlay and P2P Networks. Structured Networks and DHTs. Prof. Sasu Tarkoma Overlay and P2P Networks Structured Networks and DHTs Prof. Sasu Tarkoma 2.2.2015 Contents Today Geometries revisited Distributed Hash Tables (DHTs) Thursday Power-law networks Geometries revisited The

More information

Routing Table Construction Method Solely Based on Query Flows for Structured Overlays

Routing Table Construction Method Solely Based on Query Flows for Structured Overlays Routing Table Construction Method Solely Based on Query Flows for Structured Overlays Yasuhiro Ando, Hiroya Nagao, Takehiro Miyao and Kazuyuki Shudo Tokyo Institute of Technology Abstract In structured

More information

GIAN Course on Distributed Network Algorithms. Network Topologies and Local Routing

GIAN Course on Distributed Network Algorithms. Network Topologies and Local Routing GIAN Course on Distributed Network Algorithms Network Topologies and Local Routing Stefan Schmid @ T-Labs, 2011 GIAN Course on Distributed Network Algorithms Network Topologies and Local Routing If you

More information

A Survey of Peer-to-Peer Systems

A Survey of Peer-to-Peer Systems A Survey of Peer-to-Peer Systems Kostas Stefanidis Department of Computer Science, University of Ioannina, Greece kstef@cs.uoi.gr Abstract Peer-to-Peer systems have become, in a short period of time, one

More information

Mill: Scalable Area Management for P2P Network based on Geographical Location

Mill: Scalable Area Management for P2P Network based on Geographical Location Mill: Scalable Area Management for PP Network based on Geographical Location MATSUURA Satoshi sato-mat@is.naist.jp FUJIKAWA Kazutoshi fujikawa@itc.naist.jp SUNAHARA Hideki suna@wide.ad.jp Graduate School

More information

Peer Clustering and Firework Query Model

Peer Clustering and Firework Query Model Peer Clustering and Firework Query Model Cheuk Hang Ng, Ka Cheung Sia Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin, N.T., Hong Kong SAR {chng,kcsia}@cse.cuhk.edu.hk

More information

EFFICIENT ROUTING OF LOAD BALANCING IN GRID COMPUTING

EFFICIENT ROUTING OF LOAD BALANCING IN GRID COMPUTING EFFICIENT ROUTING OF LOAD BALANCING IN GRID COMPUTING MOHAMMAD H. NADIMI-SHAHRAKI*, FARAMARZ SAFI, ELNAZ SHAFIGH FARD Department of Computer Engineering, Najafabad branch, Islamic Azad University, Najafabad,

More information