Analyzing the Chord Peer-to-Peer Network for Power Grid Applications

Size: px
Start display at page:

Download "Analyzing the Chord Peer-to-Peer Network for Power Grid Applications"

Transcription

1 Analyzing the Chord Peer-to-Peer Network for Power Grid Applications Hakem Beitollahi Geert Deconinck Katholieke Universiteit Leuven Electrical Engineering Kasteelpark Arenberg 10, Leuven, Belgium Abstract Various smart power grid applications can be based on agent control systems such as intelligent protection, agents in power market, supply demand matching, autonomous electricity grid (AEG), etc. The dynamic nature of these applications makes that the information infrastructure underlying the power grid is needed not only for static configuration of application but also for modification at run time. This dynamic nature, along with a geographically distributed nature of power grid applications makes the necessity of a robust ICT network, especially based on dependability, security, dynamicity and scalability attributes. Chord is a purely decentralized peer-to-peer network. Its structure is a ring that is constructed using distributed hashing tables (DHT). This paper analyzes and studies properties of Chord network for power grid applications. Analyses show the major advantages of Chord network for power grid applications are fault-tolerance, scalability, self-organization, decentralization, and efficient lookup network. This paper also analyzes dependability aspects of Chord network for power grid applications. It considers dependability with reference to reliability, scalability, availability, and security. This paper shows Chord network is suitable for power grid applications from reliability, scalability, availability, dynamicity and quick search view but it is not suitable from security perspective. 1 Introduction The power grid transports and distributes electricity from the power plants to the consumers [11]. Improving performance of power grid (optimize power quality, cost, energy Acknowledgements: This work has been partially supported by the K.U.Leuven Research Council (project GOA/2007/09) and by the European Commission (project IST CRUTIAL) loss, etc.) needs precise management and distributed control [12]. Today the security of major international and national infrastructures in all countries has became a more critical concern to governments and industry. So nowadays a dependable networked ICT system for the management and control of the electric power grid is desired [5]. The dynamic nature of applications on power grid (e.g. the Autonomous Electricity Network applications [10]), along with a geographically distributed nature of power grid applications makes that information infrastructure on power grid is needed not only for static configuration but also for modification during run time of application. For example the set of components that needs to communicate varies over time because of switching of generators and loads in the distributed generation and hence, the logical communication topology has to follow accordingly [12]. This dynamic nature of applications provides opportunities to use the Chord peer-to-peer network [9]. The main advantages of Chord network for power grids are that it is scalable, selforganizing and distributed. Furthermore it degrades gracefully in the advent of failures, restores automatically after repair and can cope with a dynamic environment. It allows construction of a communication structure that requires little communication and also allows implementation of distributed algorithms for the control and coordination among nodes as well as for the aggregation of measured data. This paper analyzes and studies properties of Chord network for power grid applications. This paper also analyzes dependability aspects of Chord network for power grid applications. Dependability can be defined as the trustworthiness justifiably placed on the service that it delivers [2]. This paper considers dependability with reference to scalability, reliability, security, and availability. Scalability and reliability depend on number of peers and their interconnections, security depends on system s open nature and Internet s communication infrastructure, and availability depends on structure of the system.

2 It shows Chord network is suitable for power grid applications from reliability, scalability, availability, dynamicity and quick search view but it is not suitable from security view. The rest of this paper is organized as follows: in section 2 the Chord network is presented. Section 3 briefly studies the basic control base for new power grid system. In Section 4 it analyzes properties of the Chord network for power grid applications. Section 5 analyzes dependability aspects of the Chord network for power grid applications and section 6 presents conclusion. K54 N56 N51 N48 N1 Source N8 N14 N21 N8+1 N14 N8+2 N14 N8+4 N14 N8+8 N14 N8+16 N32 N8+32 N42 Finger table 2 Chord Network Chord is a decentralized P2P lookup service that stores key/value pairs for distributed data items [9]. Given a key, the node responsible for storing the key s value can be determined using a hash function that assigns an identifier to each node and to each key (by hashing the node s IP address and the key). Each key k is stored on the first node whose identifier id is equal or follows k in the identifier space. Chord uses SHA-1 algorithm [7] as a consistent hashing to map nodes onto an m-bit circular identifier space. Consistent hashing is designed to let peers enter and leave the network with minimal interruption. This decentralized scheme tends to balance the load on the system, since each peer receives roughly the same number of keys, and there is little movement of keys when peers join and leave the system. In Chord, active nodes will form a connected Ring P2P topology under ideal case. In a steady state, for N peers in the system, each peer maintains routing state information for about only O(logN) other peers (N number of peers in the system). In fact, Chord is similar to binary search, where the searching space will be reduced half after a search/routing-hop. So the number of nodes that must be contacted to resolve a query in a N-node network is O(logN). Chord routing algorithm suppose m is the number of bits in the key/node identifier space. Each node n maintains a routing table with up to m entries, called the finger table. The ith in the table at node n contains the identity of the first nodes s that succeeds n by at least 2 i /2 on the identifier circle, i.e.,s = successor(n + 2 i /2), where 1 i m (and all arithmetic is modulo 2 m ). We call node s the ith finger of node n. Note that the first finger of n is the immediate successor of n on the circle and we call it the successor of node n. The example in figure 1 shows finger table of node 8. The fist finger of node 8 points to node 14, as node 14 is the N42 N38 N32 Figure 1. Chord routing model: finger table entries for node 8 K54 N51 N48 N56 N42 N38 N1 Destination Source N8 N32 N14 N21 Figure 2. Chord routing model: path of query for key 54 starting at node 8 first node that succeeds ( )mod2 6 = 9, where m = 6. Similarly, the last finger of node 8 points to node 42, as node 42 is the first node that succeeds ( )mod2 6 = 40. Now suppose node 8 wants to find the successor of key 54 (figure 2). Since the largest finger of node 8 that precedes 54 is node 42, node 8 will ask node 42 to resolve query. In turn, node 42 will determine the largest finger in its finger table that precedes 54, i.e., node 51. Finally node 51 will discover that its own successor, node 56, succeeds key 54, and thus return node 56 to node 8. Since each node has finger entries at power of two intervals around the identifier circle. Each node can forward a query at least halfway along the remaining distance between the node and the largest identifier.

3 3 Basic control base for new power grid system Today, there is an important trend to use small dispersed generators in low or medium voltage, also referred to as Distributed Generation (DG), for producing electricity [1, 3, 8]. However, this dramatically change in power grid has changed the traditional distributed grid topology, control systems, security measurements, etc [1, 3]. All these changes put new and extra stress on power grid where power is one of the most important commodities for industrial, economical and everyday activities. Control of power elements in power grid has three control levels [10, 8]: A) Primary control is used to balance both active and reactive power, based on frequency measured locally. This kind of control has no need for communications. B) Secondary control is mainly used for maintaining rated voltage levels or rated frequency and scheduled power transfers C) tertiary control optimizes generators output for economic criteria. The last two control levels both require some form of coordination and communication with other generator controllers. By adding DGs to the power grid for these levels of control, traditional central control systems are not suitable due to expenses such as expensive, dedicated communication lines and a large number of load balancing servers. So we are looking for less expensive ICT-infrastructure for these control paradigms. Agent based control systems Evolutions in the power grid have convinced us to design an intelligent, distributed control scheme [1, 12]. In this scheme power grid components (e.g. generators, dispatching loads) are equipped with an autonomous control entity (agent). These agents are implemented on some electronic devices (e.g. PCs or DSPs). Agents can supervise the grid component at hand, fetching state parameters of the components of the component from various sensors. Agents interpret these parameters and aggregate these into a high level conclusion on the current state of the component. Agents may also send control parameters to the control system (e.g. SCADA) of the component. An important aspect of agents, besides autonomy, is that they communicate with a society of (similar) agents, from which they may fetch external knowledge of their interest. This way of exchanging information enables an agent to not be only aware of the state of its own component, but also to have a notion of the global environment in which it is operating. These societies can be built easily by setting up a peerto-peer network. Agent based control scheme by using Low Voltage Distribution Grid with embedded DG Corresponding Peer-to-peer Network Househould (with smart loads) Wind torbin Fossil fuel driven small generator Photovolic generator Peer-to-peer network links Public communications LV power line Grid connected transform Controller agent Figure 3. Example of P2P network that applied to power grid [8] P2P communication opens new opportunities for controlling power grid elements. Some of these opportunities (applications) are Intelligent Protection [6], Power Market [4], Supply demand matching [4], intelligent load shedding, and Autonomous electricity grid (AEG) [10]. A simple example of P2P network formed between agents is shown in figure 3.

4 4 Analyzing properties of the Chord network for power grid applications The dynamic nature of applications on power grid (e.g. the Autonomous Electricity Network applications), along with a geographically distributed nature of power grid agent controllers makes opportunity to use Chord peer-to-peer network. The main advantages of Chord network for power girds are efficient lookup search, decentralization, selforganization, and no partitioning. Efficient lookup search: in power grid agents need to communicate with other agents. For instant an agent needs to search a data in other agents or needs to send a message to the some specific agents. Sometimes an agent needs to collect other agent s decision. Using a Chord network, all of these communication scenarios can be done efficiently and quickly because the Chord network can find a data or send a message to any arbitrary node in only O(log N) steps (N is the number of agents). Decentralization: Chord is fully distributed; no node is more important than any other. This improves robustness and makes Chord appropriate for loosely organized P2P applications. Distributed generation controllers (DG agents) in power grid due to same logic function, and geographically distributed nature need to be distributed. Power grid agents act as peers in Chord network. No agent (peer) is important than any other. Self-organization: as a result of decentralization, there is no node that centrally coordinates its activity or a database to centrally store global information about the system. Therefore nodes have to self-organize themselves, based on whatever local information is available and interacting with locally reachable nodes. By this property any agent itself can decide to leave the system or again join the system. In power grid, an agent may be needed to leave system due to some technical problems (e.g., repair or update) and is joined the system after solving the problems. In fact agents are autonomous and independent from other agents by this property. Leaving and joining of agents does not have bad effect on system performance. Hence, selforganizing property is necessary for agents network. No partitioning: the Chord network never partitions. In a Chord network, when at least one node works, the system works. By Chord network, healthy agents always can communicate with each other without partitioning. If agent network is partitioned, power grid misses its performance and agents cannot control the system correctly. Hence by using Chord network we guarantee that agent network never will be partitioned. 5 Analyzing dependability aspects of the Chord network for power grid applications The section analyzes dependability aspects of Chord network for power grid applications. It considers dependability with reference to reliability, scalability, availability, and security. Reliability: Chord topology is purely decentralized and there is no single point of failure. Furthermore, these systems store a reference to a resource in the nearest peers instead only storing one reference in the next one (replication). Moreover, each peer runs a stabilization algorithm that maintains correctness of references. So agent s network is reliable. Failure of an agent does not have effect on system performance and it simply remove from the network without bad effect on the system. The rest of agents can communicate and control the system. The failure agent can come back the system after reparation. Scalability: As Chord network has efficient query routing searches, a growing number of search queries does not negatively influence on traffic. So the cost of a Chord lookup grows as the log of the number of nodes. Hence even very large systems are feasible. In power grid network may be some generators added the system in future and so new agents may be required. By this property of Chord as much agents as necessary can be supported and added to the system. Availability: Chord automatically adjust its internal tables to reflect newly joined nodes as well as node failures, ensuring that, barring major failures in the underlying network, the node responsible for a key can always be found. This is true even if the system is in a continuous state of change. This property of Chord is very important for power grid system because agents must be available always for controlling the system. It guarantees that agents are available always. Agents are available even when they are in update situation. However other network types maybe are not available always. Security: Chord network is not good from a security point of view. It has a systematic and algorithmic structure. Any peer can be a reference point for attackers. As an attacker gets access to a peer, he/she can start various attacks. Main attacks are routing poisoning, partitioning and virtualization into incorrect network when a new peer joins and contacts a malicious peer, lookup and storage attack, inconsistent behaviors of peers, DoS attack and unsolicited responses to a lookup query. By Chord network if an attacker get access to an agent, he/she can start various attacks

5 against other agents. For example he/she can send wrong control instructions to other agents. However, Chord network is suitable for power grid system from reliability, scalability and availability point of view. Chord network is not good from security point of view for power grid system. 6 Conclusion Dynamic nature of applications on power grid (e.g. the Autonomous Electricity Network applications), along with a geographically distributed nature of power grid agent controllers makes opportunity to use Chord peer-to-peer network. This paper analyzes Chord network for power grid system. It shows the main advantages of Chord network for power grids are efficient lookup search, decentralization, self-organization, and no partitioning. The paper also analyzes dependability aspects of Chord network for power grid applications. It shows Chord network is suitable for power grid applications from reliability, scalability, and availability but it is not suitable from security view. References [1] S.M. Amin and B. F. Wollenberg. Toward a smart grid. IEEE Power and Energy Magazine, 3(5):34 41, September [8] T. Rigole, K. Vanthournout, and G. Deconinck. Interdependencies between an electric power infrastructure with distributed control, and the underlying ict infrastructure. In International Workshop on Complex Network and Infrastructure Protection, pages , Rome, Italy, March [9] I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 01), pages , San Diego, California, USA, August [10] K. Vanthournout. A semantic overlay network based robust data-infrastructure, applied to the electric power grid. PhD thesis, Department of Electrotechniek-ESAT, Katholieke universiteit Leuven, April [11] K. Vanthournout, G. Deconinck, and R. Belmans. A middleware control layer for distributed generation systems. In IEEE Power Systems Conference and Exhibition (PSCE), [12] K. Vanthournout, G. Deconinck, and R. Belmans. Agora: Distributed tertiary control of distributed resources. In 15th Power Systems Computation Conference, Liege, Belgium. [2] A. Burns and A. Wellings. Real-Time Systems and Programming languages. Third Edition. Addison Wesley, [3] J. Cardell, M. Ilic, and R. D. Tabors. Integrating small scale distributed generation into a deregulated market: Control strategies and price feedback. Technical Report MITEL , MIT Energy Laboratory, April [4] J.K. Kok, C.J. Warner, and I.G. Kamphuis. Powermatcher: Multiagent control in the electricity infrastructure. In Proceedings of Autonomous Agents and Multi-Agent Systems, [5] K. Lin and K.E. Holbert. Pra for vulnerability assessment of power system infrastructure security. In 37th Annual North America, Power Symposium, [6] NERC. Review of selected electric system disturbances in north America. NERC Disturbances Analysis Working Group, [7] NIST, U.S. Dept. of Commerce, National Technical Information Service FIPS Secure hash standard, April 1995.

Peer-to-Peer Networks Applied to Power Grid *

Peer-to-Peer Networks Applied to Power Grid * Peer-to-Peer Networks Applied to Power Grid * Hakem Beitollahi Hakem.Beitollahi@esat.kuleuven.be Abstract In order to improve and deploy distributed control systems for the power grid a robust ICT infrastructure

More information

Comparing Chord, CAN, and Pastry Overlay Networks for Resistance to DoS Attacks

Comparing Chord, CAN, and Pastry Overlay Networks for Resistance to DoS Attacks Comparing Chord, CAN, and Pastry Overlay Networks for Resistance to DoS Attacks Hakem Beitollahi Hakem.Beitollahi@esat.kuleuven.be Geert Deconinck Geert.Deconinck@esat.kuleuven.be Katholieke Universiteit

More information

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

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

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

LECT-05, S-1 FP2P, Javed I.

LECT-05, S-1 FP2P, Javed I. A Course on Foundations of Peer-to-Peer Systems & Applications LECT-, S- FPP, javed@kent.edu Javed I. Khan@8 CS /99 Foundation of Peer-to-Peer Applications & Systems Kent State University Dept. of Computer

More information

Building Dependable Peer-to-Peer systems

Building Dependable Peer-to-Peer systems Building Dependable Peer-to-Peer systems Koen Vanthournout Geert Deconinck Ronnie Belmans K.U.Leuven, Dept. Elektrotechniek, Kasteelpark Arenberg 10, B-3001 Leuven-Heverlee, Belgium Tel: +32/16/32.18.12

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

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

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

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

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

P2P Based Architecture for Global Home Agent Dynamic Discovery in IP Mobility

P2P Based Architecture for Global Home Agent Dynamic Discovery in IP Mobility P2P Based Architecture for Global Home Agent Dynamic Discovery in IP Mobility Rubén Cuevas, Carmen Guerrero, Ángel Cuevas, María Calderón, Carlos J. Bernardos Departamento de Ingeniería Telemática, Universidad

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

CRESCENDO GEORGE S. NOMIKOS. Advisor: Dr. George Xylomenos

CRESCENDO GEORGE S. NOMIKOS. Advisor: Dr. George Xylomenos CRESCENDO Implementation of Hierarchical Chord (Crescendo), according to Canon paradigm and evaluation, via simulation over realistic network topologies, of the Crescendo's advantages in comparison to

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

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

Providing File Services using a Distributed Hash Table

Providing File Services using a Distributed Hash Table Providing File Services using a Distributed Hash Table Lars Seipel, Alois Schuette University of Applied Sciences Darmstadt, Department of Computer Science, Schoefferstr. 8a, 64295 Darmstadt, Germany lars.seipel@stud.h-da.de

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

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

CPSC 426/526. P2P Lookup Service. Ennan Zhai. Computer Science Department Yale University

CPSC 426/526. P2P Lookup Service. Ennan Zhai. Computer Science Department Yale University CPSC 4/5 PP Lookup Service Ennan Zhai Computer Science Department Yale University Recall: Lec- Network basics: - OSI model and how Internet works - Socket APIs red PP network (Gnutella, KaZaA, etc.) UseNet

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

Finding Data in the Cloud using Distributed Hash Tables (Chord) IBM Haifa Research Storage Systems

Finding Data in the Cloud using Distributed Hash Tables (Chord) IBM Haifa Research Storage Systems Finding Data in the Cloud using Distributed Hash Tables (Chord) IBM Haifa Research Storage Systems 1 Motivation from the File Systems World The App needs to know the path /home/user/my pictures/ The Filesystem

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

: 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

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

*Adapted from slides provided by Stefan Götz and Klaus Wehrle (University of Tübingen)

*Adapted from slides provided by Stefan Götz and Klaus Wehrle (University of Tübingen) Distributed Hash Tables (DHT) Jukka K. Nurminen *Adapted from slides provided by Stefan Götz and Klaus Wehrle (University of Tübingen) The Architectures of st and nd Gen. PP Client-Server Peer-to-Peer.

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

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

Semester Thesis on Chord/CFS: Towards Compatibility with Firewalls and a Keyword Search

Semester Thesis on Chord/CFS: Towards Compatibility with Firewalls and a Keyword Search Semester Thesis on Chord/CFS: Towards Compatibility with Firewalls and a Keyword Search David Baer Student of Computer Science Dept. of Computer Science Swiss Federal Institute of Technology (ETH) ETH-Zentrum,

More information

Effect of Links on DHT Routing Algorithms 1

Effect of Links on DHT Routing Algorithms 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, 200030 Shanghai, China zoufutai@cs.sjtu.edu.cn

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 Introduction to DHT s Origins of structured overlays Case studies Chord

More information

Back-Up Chord: Chord Ring Recovery Protocol for P2P File Sharing over MANETs

Back-Up Chord: Chord Ring Recovery Protocol for P2P File Sharing over MANETs Back-Up Chord: Chord Ring Recovery Protocol for P2P File Sharing over MANETs Hong-Jong Jeong, Dongkyun Kim, Jeomki Song, Byung-yeub Kim, and Jeong-Su Park Department of Computer Engineering, Kyungpook

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

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

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

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 Systems. 17. Distributed Lookup. Paul Krzyzanowski. Rutgers University. Fall 2016

Distributed Systems. 17. Distributed Lookup. Paul Krzyzanowski. Rutgers University. Fall 2016 Distributed Systems 17. Distributed Lookup Paul Krzyzanowski Rutgers University Fall 2016 1 Distributed Lookup Look up (key, value) Cooperating set of nodes Ideally: No central coordinator Some nodes can

More information

Detecting and Recovering from Overlay Routing. Distributed Hash Tables. MS Thesis Defense Keith Needels March 20, 2009

Detecting and Recovering from Overlay Routing. Distributed Hash Tables. MS Thesis Defense Keith Needels March 20, 2009 Detecting and Recovering from Overlay Routing Attacks in Peer-to-Peer Distributed Hash Tables MS Thesis Defense Keith Needels March 20, 2009 Thesis Information Committee: Chair: Professor Minseok Kwon

More information

*Adapted from slides provided by Stefan Götz and Klaus Wehrle (University of Tübingen)

*Adapted from slides provided by Stefan Götz and Klaus Wehrle (University of Tübingen) Distributed Hash Tables (DHT) Jukka K. Nurminen *Adapted from slides provided by Stefan Götz and Klaus Wehrle (University of Tübingen) The Architectures of st and nd Gen. PP Client-Server Peer-to-Peer.

More information

Routing Protocols of Distributed Hash Table Based Peer to Peer Networks

Routing Protocols of Distributed Hash Table Based Peer to Peer Networks IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 16, Issue 1, Ver. II (Jan. 2014), PP 70-74 Routing Protocols of Distributed Hash Table Based Peer to Peer Networks

More information

A LIGHTWEIGHT FRAMEWORK FOR PEER-TO-PEER PROGRAMMING *

A LIGHTWEIGHT FRAMEWORK FOR PEER-TO-PEER PROGRAMMING * A LIGHTWEIGHT FRAMEWORK FOR PEER-TO-PEER PROGRAMMING * Nadeem Abdul Hamid Berry College 2277 Martha Berry Hwy. Mount Berry, Georgia 30165 (706) 368-5632 nadeem@acm.org ABSTRACT Peer-to-peer systems (P2P)

More information

NodeId Verification Method against Routing Table Poisoning Attack in Chord DHT

NodeId Verification Method against Routing Table Poisoning Attack in Chord DHT NodeId Verification Method against Routing Table Poisoning Attack in Chord DHT 1 Avinash Chaudhari, 2 Pradeep Gamit 1 L.D. College of Engineering, Information Technology, Ahmedabad India 1 Chaudhari.avi4u@gmail.com,

More information

DISTRIBUTED HASH TABLE PROTOCOL DETECTION IN WIRELESS SENSOR NETWORKS

DISTRIBUTED HASH TABLE PROTOCOL DETECTION IN WIRELESS SENSOR NETWORKS DISTRIBUTED HASH TABLE PROTOCOL DETECTION IN WIRELESS SENSOR NETWORKS Mr. M. Raghu (Asst.professor) Dr.Pauls Engineering College Ms. M. Ananthi (PG Scholar) Dr. Pauls Engineering College Abstract- Wireless

More information

Distributed Hash Tables (DHT)

Distributed Hash Tables (DHT) Distributed Hash Tables (DHT) Jukka K. Nurminen Aalto University *Adapted from slides provided by Stefan Götz and Klaus Wehrle (University of Tübingen) The Architectures of st and nd Gen. PP Client-Server

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 LOAD BALANCING ALGORITHM BASED ON MOVEMENT OF NODE DATA FOR DYNAMIC STRUCTURED P2P SYSTEMS

A LOAD BALANCING ALGORITHM BASED ON MOVEMENT OF NODE DATA FOR DYNAMIC STRUCTURED P2P SYSTEMS A LOAD BALANCING ALGORITHM BASED ON MOVEMENT OF NODE DATA FOR DYNAMIC STRUCTURED P2P SYSTEMS 1 Prof. Prerna Kulkarni, 2 Amey Tawade, 3 Vinit Rane, 4 Ashish Kumar Singh 1 Asst. Professor, 2,3,4 BE Student,

More information

Problems in Reputation based Methods in P2P Networks

Problems in Reputation based Methods in P2P Networks WDS'08 Proceedings of Contributed Papers, Part I, 235 239, 2008. ISBN 978-80-7378-065-4 MATFYZPRESS Problems in Reputation based Methods in P2P Networks M. Novotný Charles University, Faculty of Mathematics

More information

Peer-to-Peer Systems. Network Science: Introduction. P2P History: P2P History: 1999 today

Peer-to-Peer Systems. Network Science: Introduction. P2P History: P2P History: 1999 today Network Science: Peer-to-Peer Systems Ozalp Babaoglu Dipartimento di Informatica Scienza e Ingegneria Università di Bologna www.cs.unibo.it/babaoglu/ Introduction Peer-to-peer (PP) systems have become

More information

A Decentralized Content-based Aggregation Service for Pervasive Environments

A Decentralized Content-based Aggregation Service for Pervasive Environments A Decentralized Content-based Aggregation Service for Pervasive Environments Nanyan Jiang, Cristina Schmidt, Manish Parashar The Applied Software Systems Laboratory Rutgers, The State University of New

More information

Part 1: Introducing DHTs

Part 1: Introducing DHTs Uni Innsbruck Informatik - Peer-to to-peer Systems Structured PP file sharing systems Michael Welzl michael.welzl@uibk.ac.at DPS NSG Team http://dps.uibk.ac.at dps.uibk.ac.at/nsg Institute of Computer

More information

DRing: A Layered Scheme for Range Queries over DHTs

DRing: A Layered Scheme for Range Queries over DHTs DRing: A Layered Scheme for Range Queries over DHTs Nicolas Hidalgo, Erika Rosas, Luciana Arantes, Olivier Marin, Pierre Sens and Xavier Bonnaire Université Pierre et Marie Curie, CNRS INRIA - REGAL, Paris,

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

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

Overview Computer Networking Lecture 16: Delivering Content: Peer to Peer and CDNs Peter Steenkiste

Overview Computer Networking Lecture 16: Delivering Content: Peer to Peer and CDNs Peter Steenkiste Overview 5-44 5-44 Computer Networking 5-64 Lecture 6: Delivering Content: Peer to Peer and CDNs Peter Steenkiste Web Consistent hashing Peer-to-peer Motivation Architectures Discussion CDN Video Fall

More information

Finding Data in the Cloud using Distributed Hash Tables (Chord) IBM Haifa Research Storage Systems

Finding Data in the Cloud using Distributed Hash Tables (Chord) IBM Haifa Research Storage Systems Finding Data in the Cloud using Distributed Hash Tables (Chord) IBM Haifa Research Storage Systems 1 In File Systems The App needs to know the path /home/user/my pictures/ The Filesystem looks up the directory

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

12/5/16. Peer to Peer Systems. Peer-to-peer - definitions. Client-Server vs. Peer-to-peer. P2P use case file sharing. Topics

12/5/16. Peer to Peer Systems. Peer-to-peer - definitions. Client-Server vs. Peer-to-peer. P2P use case file sharing. Topics // Topics Peer to Peer Systems Introduction Client-server vs peer to peer Peer-to-peer networks Routing Overlays Structured vs unstructured Example PP Systems Skype login server Peer-to-peer - definitions

More information

CS535 Big Data Fall 2017 Colorado State University 11/7/2017 Sangmi Lee Pallickara Week 12- A.

CS535 Big Data Fall 2017 Colorado State University  11/7/2017 Sangmi Lee Pallickara Week 12- A. CS Big Data Fall Colorado State University http://www.cs.colostate.edu/~cs // Week - A // CS Big Data - Fall Week -A- CS BIG DATA FAQs PA deadline has been extended (/) PART. SCALABLE FRAMEWORKS FOR REAL-TIME

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

Subway : Peer-To-Peer Clustering of Clients for Web Proxy

Subway : Peer-To-Peer Clustering of Clients for Web Proxy Subway : Peer-To-Peer Clustering of Clients for Web Proxy Kyungbaek Kim and Daeyeon Park Department of Electrical Engineering & Computer Science, Division of Electrical Engineering, Korea Advanced Institute

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

Distributed K-Ary System

Distributed K-Ary System A seminar presentation Arne Vater and Prof. Schindelhauer Professorship for Computer Networks and Telematik Department of Computer Science University of Freiburg 2007-03-01 Outline 1 2 3 4 5 Outline 1

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

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

Data-Centric Query in Sensor Networks

Data-Centric Query in Sensor Networks Data-Centric Query in Sensor Networks Jie Gao Computer Science Department Stony Brook University 10/27/05 Jie Gao, CSE590-fall05 1 Papers Chalermek Intanagonwiwat, Ramesh Govindan and Deborah Estrin, Directed

More information

Trust Management in Wireless Networks

Trust Management in Wireless Networks 1 Trust Management in Wireless Networks Eduardo Cardoce and Muthu Pitchaimani Department of Electric Engineering and Computer Science University of Kansas 1520 West 15 th Street Lawrence, KS, 66045-7621

More information

Distributed Information Processing

Distributed Information Processing Distributed Information Processing 14 th Lecture Eom, Hyeonsang ( 엄현상 ) Department of Computer Science & Engineering Seoul National University Copyrights 2016 Eom, Hyeonsang All Rights Reserved Outline

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

Peer to Peer I II 1 CS 138. Copyright 2015 Thomas W. Doeppner, Rodrigo Fonseca. All rights reserved.

Peer to Peer I II 1 CS 138. Copyright 2015 Thomas W. Doeppner, Rodrigo Fonseca. All rights reserved. Peer to Peer I II 1 Roadmap This course will feature key concepts in Distributed Systems, often illustrated by their use in example systems Start with Peer-to-Peer systems, which will be useful for your

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

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

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

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

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

Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 11, NO. 1, FEBRUARY 2003 17 Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger,

More information

Last Time. CSE 486/586 Distributed Systems Distributed Hash Tables. What We Want. Today s Question. What We Want. What We Don t Want C 1

Last Time. CSE 486/586 Distributed Systems Distributed Hash Tables. What We Want. Today s Question. What We Want. What We Don t Want C 1 Last Time Distributed Systems Distributed Hash Tables Evolution of peer-to-peer Central directory (Napster) Query flooding (Gnutella) Hierarchical overlay (Kazaa, modern Gnutella) BitTorrent Focuses on

More information

416 Distributed Systems. March 23, 2018 CDNs

416 Distributed Systems. March 23, 2018 CDNs 416 Distributed Systems March 23, 2018 CDNs Outline DNS Design (317) Content Distribution Networks 2 Typical Workload (Web Pages) Multiple (typically small) objects per page File sizes are heavy-tailed

More information

C 1. Last Time. CSE 486/586 Distributed Systems Distributed Hash Tables. Today s Question. What We Want. What We Want. What We Don t Want

C 1. Last Time. CSE 486/586 Distributed Systems Distributed Hash Tables. Today s Question. What We Want. What We Want. What We Don t Want Last Time Distributed Systems Distributed Hash Tables Evolution of peer-to-peer Central directory (Napster) Query flooding (Gnutella) Hierarchical overlay (Kazaa, modern Gnutella) BitTorrent Focuses on

More information

Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment

Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment Multi-level Hashing for Peer-to-Peer System in Wireless Ad Hoc Environment Dewan Tanvir Ahmed, Shervin Shirmohammadi Distributed & Collaborative Virtual Environments Research Laboratory School of Information

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

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

Quasi-Chord: physical topology aware structured P2P network

Quasi-Chord: physical topology aware structured P2P network Quasi-Chord: physical topology aware structured PP network UN Mingsong ZHANG Zhongqiu Network Information Center, Harbin University of cience and Technology, China College of Computer ci&tech, Harbin University

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

Peer-to-peer computing research a fad?

Peer-to-peer computing research a fad? Peer-to-peer computing research a fad? Frans Kaashoek kaashoek@lcs.mit.edu NSF Project IRIS http://www.project-iris.net Berkeley, ICSI, MIT, NYU, Rice What is a P2P system? Node Node Node Internet Node

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

DISTRIBUTED SYSTEMS CSCI 4963/ /4/2015

DISTRIBUTED SYSTEMS CSCI 4963/ /4/2015 1 DISTRIBUTED SYSTEMS CSCI 4963/6963 12/4/2015 2 Info Quiz 7 on Tuesday. Project 2 submission URL is posted on the web site Submit your source code and project report (PDF!!!) in a single zip file. If

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

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

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

Agora: Distributed Tertiary Control of Distributed Resources

Agora: Distributed Tertiary Control of Distributed Resources Agora: Distributed Tertiary Control of Distributed Resources Koen Vanthournout Karel De Brabandere Edwin Haesen K.Univ.Leuven K.Univ.Leuven K.Univ.Leuven Leuven, Belgium Leuven, Belgium Leuven, Belgium

More information

Fortum SGEM Program Presentation of ongoing research activities

Fortum SGEM Program Presentation of ongoing research activities Fortum SGEM Program Presentation of ongoing research activities MV and LV Network Automation Solutions in EU Benchmarking Research 1 Existing Distribution Grid Little change in the past few decades Mostly

More information

Distributed Systems. 16. Distributed Lookup. Paul Krzyzanowski. Rutgers University. Fall 2017

Distributed Systems. 16. Distributed Lookup. Paul Krzyzanowski. Rutgers University. Fall 2017 Distributed Systems 16. Distributed Lookup Paul Krzyzanowski Rutgers University Fall 2017 1 Distributed Lookup Look up (key, value) Cooperating set of nodes Ideally: No central coordinator Some nodes can

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

Chapter 2 Communication for Control in Heterogeneous Power Supply

Chapter 2 Communication for Control in Heterogeneous Power Supply Chapter 2 Communication for Control in Heterogeneous Power Supply The need to modernize the power grid infrastructure, and governments commitment for a cleaner environment, is driving the move towards

More information

Peer to Peer Networks

Peer to Peer Networks Sungkyunkwan University Peer to Peer Networks Prepared by T. Le-Duc and H. Choo Copyright 2000-2018 Networking Laboratory P2P Applications Traditional P2P applications: for file sharing BitTorrent, Emule

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

Peer to Peer Networks

Peer to Peer Networks Sungkyunkwan University Peer to Peer Networks Prepared by T. Le-Duc and H. Choo Copyright 2000-2017 Networking Laboratory Presentation Outline 2.1 Introduction 2.2 Client-Server Paradigm 2.3 Peer-To-Peer

More information

Scalable and Self-configurable Eduroam by using Distributed Hash Table

Scalable and Self-configurable Eduroam by using Distributed Hash Table Scalable and Self-configurable Eduroam by using Distributed Hash Table Hiep T. Nguyen Tri, Rajashree S. Sokasane, Kyungbaek Kim Dept. Electronics and Computer Engineering Chonnam National University Gwangju,

More information

DISTRIBUTED COMPUTER SYSTEMS ARCHITECTURES

DISTRIBUTED COMPUTER SYSTEMS ARCHITECTURES DISTRIBUTED COMPUTER SYSTEMS ARCHITECTURES Dr. Jack Lange Computer Science Department University of Pittsburgh Fall 2015 Outline System Architectural Design Issues Centralized Architectures Application

More information

Security Considerations for Peer-to-Peer Distributed Hash Tables

Security Considerations for Peer-to-Peer Distributed Hash Tables Security Considerations for Peer-to-Peer Distributed Hash Tables Emil Sit and Robert Morris Laboratory for Computer Science, MIT 200 Technology Square, Cambridge, MA 02139, USA {sit,rtm}@lcs.mit.edu Abstract.

More information