Peer-to-Peer Networks Applied to Power Grid *

Size: px
Start display at page:

Download "Peer-to-Peer Networks Applied to Power Grid *"

Transcription

1 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 is required partially based on dependable middleware that exploits redundancy and diversity in communication networks. The dynamic nature of power grid applications makes necessity of using peer-to-peer (P2P) networks in this system. The main requirements of P2P networks for power grid are that they are scalable, self-organizing and distributed. Furthermore they degrade gracefully in the advent of failures, restore automatically after repair and need to cope with dynamic environment. This paper at first classifies P2P networks according their architecture and compares them. Then it analyzes P2P networks based on their architectures for controlling power grid components. It shows hybrid decentralized indexing P2P networks are best choice and most suitable architecture for power grid. 1. Introduction Geert Deconinck Geert.Deconinck@esat.kuleuven.be Katholieke Universiteit Leuven, Electrical Engineering, Kasteelpark Arenberg 10, Leuven, Belgium The power grid transports and distributes electricity from the power plants to the consumers [1] (figure 1). Improving performance of power grid (optimize power quality, cost, energy loss, etc.) needs precise management and distributed control [2]. Since Sep 11, 2001 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 [3]. CRUTIAL (CRitical UTility InfrastructurAL resilience) is a recently started European IST research project addressing dependable network for the management of the electric power grid, in which agents controlling the Figure 1: power grid with a small number of power plants connected to the meshed high voltage grid and distributed generation and loads in the radial low voltage distribution physical process of electricity distribution need to be connected with information infrastructures, through corporate networks, which are in turn connected to the internet. The dynamic nature of applications on power grid (e.g. the Autonomous Electricity Network applications [4]) 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 * Acknowledgements: This project is partially supported by the K.U.Leuven Research Council (project GOA/2007/09) and by the European Commission (projects IST CRUTIAL and IST GRID).

2 time because of switching of generators and loads in the distributed generation and hence, the logical communication topology has to follow accordingly [2]. This dynamic nature of applications provides opportunities to use peer-to-peer (P2P) networks. The main requirements of P2P networks for power girds are that they are scalable, self-organizing and distributed. Furthermore they degrade gracefully in the advent of failures, restore automatically after repair and can cope with dynamic environment. They allow construction of a communication structure that requires little communication and also allow implementation of distributed algorithms for the control and coordination among nodes as well as for the aggregation of measured data. So studying and analyzing P2P networks carefully and studying whether they are sufficiently dependable for power grid is very necessary. This paper classifies the P2P networks based on their architectures and enumerates the advantages and disadvantages of them. It then evaluates and analyzes P2P networks for controlling power grid components and shows the hybrid decentralized indexing P2P type is the good and suitable choice for power grid. This paper provides guidance for researchers and practitioners to design robust and effective P2P networks applications requiring basic knowledge about P2P networks, accessibility, fault resilience, control mechanisms of power grid and how a computer network like P2P is applied to power grid. The rest of this paper is organized as follows: in section 2 definition of P2P is presented. Section 3 presents the P2P architectures. Section 4 briefly studies the basic control base for new power grid system. Section 5 shows P2P network is a new opportunity for controlling power grid components and section 6 presents conclusion. 2. Peer-to-Peer systems Many different definitions for P2P exist [5-10]; we can extract several principles about P2P networks from these definitions that will be useful in the context of power grid. 1) The principle of resource sharing: all P2P networks have an aspect of file or resource sharing (both physical resources and logical resources). As a result of resource sharing, applications can be realized which it could not be set up by a single node. 2) The principle of decentralization: Parts of the network or even the entire network are no longer operated centrally. Decentralization is a particular character of P2P networks in order to avoid single point of failure as well as performance bottlenecks in the network. 3) The principle of self-organization: as a result of decentralization, there exists no longer a node that can centrally coordinate its activity or a database to centrally store global information about the system. Therefore nodes have to selforganize themselves, based on whatever local information is available and interacting with locally reachable nodes. In the last few years, P2P systems have rapidly evolved and emerged as a promising platform to deploy new applications and services in the internet [11, 12]. One of the reasons P2P systems are seen as an excellent platform for large scale distributed systems is their resilience in the presence of node failures. However malicious faults (attacks) are serious threats in these systems. 3. Peer-to-peer Architecture According to differences of query search mechanism, logical topology and degree of decentralization, the P2P architecture can be classified into four types. a) Purely unstructured decentralized This P2P system is a distributed system without any centralized control. In such systems all nodes are equivalent in functionality. In these systems nodes are named as servant (SERver + client). This means all nodes of a P2P system can act at the same time as server as well as a client. The logical P2P topology in these systems is often random and unstructured mesh. The query is executed hop-by-hop through the mesh till success/failure or timeout. An example of these systems is Gnutella [13]. Routing algorithm: Purely unstructured systems like Gnutella use flooding broadcast of queries for routing. In these systems each query from a peer is flooded (broadcasted) to directly connected peers, which themselves flood their peers and etc., until the request is answered or a maximum number of flooding steps occur. Different flooding policies have been implemented to improve search in these systems. In Gnutella to find a file, a node issues queries to its neighbors. The most typical query method is flooding where the query is broadcasted to all neighbors (hops) within certain TTL (Time-To-Live) value. At each hop the value of the TTL is decremented, and when it reaches zero the

3 message is dropped. In order to avoid loops, the nodes use the unique message identifiers to detect and drop duplicated messages. When the file was found in a certain node, it initiates a direct out-ofnetwork download, establishing a direct connection between the source and target node (figure 2). Examples of this system are Chord [14], CAN [15], and Pastry [16]. Routing algorithm: In these systems the routing model adds structure to the way information about resources are stored using distributed hash tables. This structure provides a mapping between the resource identifier and location, in the form of distributed routing table. With this method the queries can be efficiently routed to the node with the desired resource. This method also reduces the number of hops that must be taken to locate a resource. Among examples of these systems we have chosen the Chord routing algorithm. Figure 3 shows Chord routing model. N1 Source N8 N8+1 N14 N8+2 N14 N8+4 N14 N8+8 N14 N8+16 N32 N8+32 N42 Finger table Query Response N51 N54 Destinstion N14 Figure 2 : Flooding Search N48 N21 Advantages of these systems: i) They are inherently fault-tolerant, since there is no central point of failure and the loss of a peer or even a number of peers can easily be recovered. ii) They are flexible and robust. Disadvantages of these systems: i) They are slow in routing. ii) No guarantee about quality of service. iii) Predicting system behavior is hard because of the lack of a global view at the system level. iv) They are not scalable. v) Managing the system is hard. b) Purely structured decentralized They are similar to P2P systems of group A with this difference that the logical P2P topology is a structured topology such as mesh, ring, d-dimension torus or butterfly. These structured topologies are usually constructed using distributed hashing tables (DHT) techniques. The query is also executed hopby-hop through the structured topology, and is sure to be successful after some deterministic hops under ideal case. N42 N38 Figure 3: Chord routing model Advantages of these systems: i) They have a quick and efficient query search or in other words they are quick in routing. ii) They provide load balancing. iii) They have a deterministic search guarantee. iv) They are scalable and robust. v) Managing the system is easy. Disadvantages of these systems: i) They are vulnerable under malicious attacks. In comparison with group A they are worse under malicious attacks because they have deterministic and structured architecture and this is a important point for attackers. ii) They are not flexible. c) Hybrid centralized indexing In these systems there is a central server that maintains directions of information about registered N32

4 users to the network. In these systems each arriving node needs to actively notify the server about its information, then other nodes only need to search peer s address from server about its wanted objects. There is the end-to-end interaction between two peer clients. Napster [17] is an example of these systems. Routing algorithm: In these systems the peers of the community connect to a centralized directory server, which stores all information regarding location and usage of resources. Upon request from a peer, the central index will match the request with the best peer in its directory that matches the request. The best peer could be the one that is cheapest, fastest, nearest, or most available, depending on the user needs. Then the data exchange will occur directly between the two peers. Napster uses this method. Figure 4 shows routing in Napster as an example of these systems. and proxy search requests on behalf of these peers. In such systems peers are automatically elected to become super-nodes if they have sufficient bandwidth and good processing power. Like systems of group C there is end-to-end interaction (data exchanging) between two peer clients. Figure 5 shows these systems. Kazaa [18] and Morpheus [19] are two decentralized indexing systems. Super-node Server Peer Where is X.doc A A has X.doc Figure 5: Hybrid decentralized indexing Download X.doc Figure 4: Routing algorithm in Napster Advantages of these systems: i) They are very simple and easy to be deployed. ii) They are quick and efficient for information discovery (routing or query search). iii) Searches are comprehensive and they can provide guarantee in searches. iv) Managing the system is easy. Disadvantages of these systems: i) They are vulnerable to malicious attacks. ii) They are single point failure in server. iii) They have bad scalability. iv) They are not so flexible and robust. d) Hybrid decentralized indexing: In these systems some nodes that called super-nodes are central servers and they register users to the system and also facilitate the peer discovery process. Super-nodes maintain the central indexes for the information shared by local peers connected to them Routing algorithm: In these systems every super-node is associated with a set of nodes and every node connects to a supernode to which it belongs. When a search for a data item issued by node n1, lookup message will follow the path from a super-node of node n1 to all super nodes, the operation will repeat until success or until all paths are completely searched. Advantages of these systems: i) They are quick and efficient for search query (routing). ii) In comparison with other groups they reduce the traffic on message exchanging. iii) In comparison with group C they reduce the workload on central server because they have several servers. iv) In comparison with group C there is no unique point of failure. In these systems if one or more super-nodes go down, the nodes connected to them can open new connections with others, and the network can continue the operation. In fact after super-nodes go down, the existing peers become super-nodes themselves. v) They are scalable.

5 vi) They are flexible and robust. vii) Managing the system is easy. Disadvantages of these systems: i) In comparison with group A and B they are more vulnerable to malicious attacks because of supernodes. ii) In comparison with group C, they present slower information discovery. 4. 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 [20, 21, 22]. However, this dramatically changing in power grid has changed the traditional distributed grid topology, control systems, security measurements, etc [20, 21]. 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 [4, 22, 23] 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 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 control paradigms. Agent based control systems Evolutions in the power grid have convinced us to design an intelligent, distributed control scheme [2, 24]. 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 peer-to-peer network. 5. P2P networks for Microgrid control applications Agent based control scheme by using P2P communication opens new opportunities for controlling power grid elements. Various applications of agent based control schemes (smart grids) have been proposed in literature. Here we give a short overview of some noteworthy applications and role of P2P network on them. Intelligent Protection: paper [25] has shown that malfunctioning or wrongful switching of protection systems are at basis of 63% of all major system disturbances. Therefore various schemes are presented to control these circuit breakers by intelligent agents, using for example fuzzy logic and communication with other agents to decide the best action when a near short circuit current is observed [26]. By the P2P network, the agent floods the problem to other agents and then by collective agreement algorithms they can decide the best action. All types of P2P network can be useful for this application especially type B and D for some time deadlines of best action. This application can also be done by type D very efficiency. The agent encountering a problem sends a message to its server and then the server wants other servers (any server has some agents) to send their commands for solving the problem. So the server can decide the best action intelligently based on all commands. Agents in Power Market: Multi-agent technology can be used for real-time online power markets. Agents buy and/or sell power trying to minimize the costs and/or maximizing income while meeting the demand of their master (e.g. generation facility, factory, household, etc.) [27]. P2P technology provides directly communication between any two agents and also provides communication and discussion of an agent with all other agents. So with

6 these properties of P2P network and also file sharing property of this network, agents can minimize the costs and/or maximize income according the best decision in power market. Supply demand matching: Intelligent forecasting of demand and generation (e.g. for solar cells or wind turbines) and matching these by adjusting generator output or intelligent loads, may reduce regulating needs and costs [27]. Intelligent load shedding: loads may be switched off when network load is high, according to some properties. Heating or air conditioning may be switched off temporary without anyone noticing, while hospitals or traffic signals may only be shed when there are no other options. As nodes (agents here) are autonomous and self-organized in P2P networks, they can switch off some loads like heating or air condition temporarily based on some conditions to balance the network load. Autonomous electricity grid (AEG): An AEG is low voltage net with a decent amount of DG installed, that is self-regulating and possibly able to continue operating, if necessary in a degraded way, when it is disconnected from the high voltage transmission grid [2, 28, 29]. We can consider the control sites of power plants (high voltage plants and DGs) as LANs where any LAN has a super-node to communicate with other LANs. Super-nodes communicate together by a P2P network (recall type D of P2P architecture). As Super-nodes are members of P2P network they are autonomous and selforganized and can leave the network based on their interest or power grid conditions. With this architecture the AEG application is implemented. For example if DG resources are disconnected from the high voltage grid, we can consider that super-nodes of distributed generators LANs have been disconnected from super-nodes of high voltage generators LANs and peer-to-peer connection still exist among super-nodes of distributed generators LANs. Importance of P2P network for secondary and tertiary control As mentioned before secondary and tertiary controls need some form of coordination and communication with other generator s controllers. For this agents (generator s controllers) set up a P2P network which directly or indirectly interconnects all controller agents in the distribution grid. The topology and fault-tolerance mechanisms of this overlay network make it suitable to be used in unbounded systems using an unreliable open network such as Internet. A simple example of P2P network formed between agents has shown in figure 6. 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 6: Example of P2P network that applied to power grid

7 Agents communicate together by gossiping algorithm. In gossiping algorithm, every agent exchanges information at fixed time intervals with one of its neighbors (chosen randomly). If that neighbor exchanges this new information with one of its neighbors (and so forth), the news spreads in the network. All types of P2P architectures implement the gossiping algorithm. In type A it is enough any node (agent) exchanges information with one of its random neighbors and so forth. In type B as any node has its finger table list it is enough any node exchanges information with members of its finger table list and then the members exchange information with members of their finger table list. In types C and D any node just exchanges information to its server (super-node) and then server (super-node) spread information over the network by exchange information to other its nodes or other servers (supernodes) and so forth. Evaluation of the four P2P types for power grids Power grid network is a scalable network and multiple power plants maybe are added to the grid. Some applications of Power grid have time deadlines, which mean that the correctness of a system operation depends not only on its logical results, but also on the time at which these results become available. So power grids need a network with quick and efficient routing. Power grid also requires efficient management for three control levels and power components. With these interpretations and situations type A of P2P is not suitable for power grid because it is not scalable; it is slow in routing; and also management is hard. However this type is good for security and fault-tolerance. Type B of P2P networks for power grid is efficient as it is scalable; it is quick and efficient in routing and also management is easy. However, this type is more vulnerable from security outlook due to deterministic and structural architecture. Type C is not good for power grid as it has bad scalability; it is vulnerable from security point of view because it is enough that the attacker only considers the server, which is a single point of failure (SPF). However, it is simple and easy for management and it has quick routing. As power grid applications shows, type D of P2P is the most suitable and best for power grid because it is scalable and flexible; it has quick and efficient routing. It has not SPF points like type C; management is easy and it is more secure in comparison with other types except type A. 6. Conclusion Considering advantages and disadvantages of different architecture of P2P networks, system designer can choose a topology for their system according to their requirements. Evaluations in the power grid show it requires an intelligent, distributed and dynamic control system. P2P networks are good and suitable choice for power grid due to dynamism, scalable, self-organizing, and decentralized nature. Preliminary studies on P2P types (considering advantages and disadvantages of P2P types and resilience of P2P types to random faults and attacks) show type D, the hybrid decentralized indexing type, is the most suitable and best for power grid among P2P types because of scalability, flexibility, quick and efficient routing and easy management. 7. References [1] K. Vanthournout, G. Deconinck, R. Belmans, A middleware control layer for distributed generation systems, IEEE Power Systems Conference and Exhibition (PSCE), New York City, USA, Oct [2] K. Vanthournout, G. Deconinck, R. Belmans, Agora: Distributed Tertiary Control of Distributed Resources, 15 th Power Systems Computation Conference, 2005, Liege, Belgium. [3] K.Lin, K.E.Holbert, PRA for vulnerability assessment of power system infrastructure security, Proc. of the 37 th Annual North America, Power Symposium, [4] K.Vanthournout, A semantic overlay network based robust data-infrastructure, applied to the electric power grid, Ph.D thesis, Department of Electrotechniek-ESAT, Katholieke universiteit Leuven, April [5] P. S. Munindar, peering at peer-to-peer computing, IEEE Internet computing, 5(1): 4-5, [6] K.Kant, R.Tyer, V.Tewari, A Framework for classifying peer-to-peer technologies, Proc. of the 2 nd IEEE/ACM International symposium on cluster computing and the Grid (CCGRID 02), [7] K.Aberer, P.cudr, M.Hauswirth, The chatty web: emergent semantics through gossiping, Proc. of the 12 th Inter. Conf. on word wide web, pages , ACM press, [8] A.oram, Peer-to-Peer: Harnessing the Power of Disruptive Technologies, O Reilly & Associates, Inc., Sebastopol, CA, USA, 2001.

8 [9] R.Schollmeier, A definition of Peer-to-Peer networking for the classification of peer-to-peer architectures and applications, Proc. of the 1 st Inter. Conf. on peer-to-peer computing (P2P2001), pages IEEE computer Society, Aug [10] K.Aberer, M.Hauswirth, An overview on peer-topeer information systems, Proc. of the workshop on Distributed data and structures (WDAS 2002), Paris, France, [11] R.Buyya, H.Stockinger, J.Giddy, D.Abramson, Economic Models for management of Resources in Peerto-Peer and Grid computing, Proc. of the SPIE Inter. Conf. on Commercial Applications for High-Performance Computing, [12] T.Reti, M.Valimaki, Business Models for content Distribution on Mobile Peer-to-Peer Networks, Working paper, Helsinki Institute for Information Technology, [13] Gnutella: [14] I.Stoica, R.Morris, D.Karger, F.Kaashoek, H.Balakrishnan, Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications, Proc. of the Conf. on applications, technologies, architectures, and protocols for computer communications (SIGCOMM 01), Pages , San Diego, California, USA, August [15] S.Ratnasamy, P.Francis, M.Haudley, R.Karp, S.Shenker, A scalable content addressable network, Proc. of the Conf. on applications, technologies, architectures, and protocols for computer communications (SIGCOMM 01), pages 27-31, San Diego, California, USA, August [16] A.Rowstron, P.Druschel, Pastry: scalable, decentralized object location and routing for large-scale peer-to-peer systems, Proc. of the 18 th IFIP/ACM Inter. Conf. on Distributed Systems Platforms (Middleware 2001), Heidelberg, Germany, November [22] T.Rigole, K. Vanthournout, G. Deconinck, " Interdependencies between an Electric Power Infrastructure with Distributed Control, and the Underlying ICT Infrastructure," International Workshop on Complex Network and Infrastructure Protection , Rome, Italy, March 28-29, 2006; pp [23] T.Rigole, K. Vanthournout, G. Deconinck, " Distributed control systems for electric power applications," 2nd International Workshop on Networked Control Systems: Tolerant ro Faults, Rende (CS), Italy, Nov.23-24, 2006; 7 pages. [24] A. Massoud, S. Wollenberg, Toward a smart grid IEEE Power and Energy Magazine 3(5), 34 41, [25] NERC, Review of selected electric system disturbances in north america, Report of NERC Disturbances Analysis Working Group, [26] J. Huang, S.S. Venkata, Wide area adaptive protection: Architecture, algorithms and communications, International Journal of Critical Infrastructures 1(1), 8 19, [27] J.K. Kok,, C.J.Warner, I.G. Kamphuis, Powermatcher: Multiagent control in the electricity infrastructure, Proceedings of Autonomous Agents and Multi-Agent Systems, Utrecht, Netherlands, [28] A.L. Dimeas, N.D. Hatziagyriou, Operation of a multiagent system for microgrid control, IEEE Transactions on Power Systems, [29] P. Lund,, S. Cherian, T. Ackerman, A cell controller for autonomous operation of a 60kv distribution area, International Journal of Distributed Energy Resources, [17] Napster: [18] S.G. Nathaniel, A.Krekelberg, Usability and privacy: a study of Kazaa P2P file-sharing, Conf. on Human factors in computing systems (CHI 03), pages , ACM Press, [19] Morpheus: [20] J. Cardell, M. Ilić, R. D. Tabors, Integrating Small Scale Distributed Generation into a Deregulated Market: Control Strategies and Price Feedback, MIT Energy Laboratory Technical Report, MITEL , April [21] S. Massoud Amin, B. F. Wollenberg, Toward a Smart Grid, IEEE Power & Energy Magazine, Vol. 3,umber 5, September/October 2005, p

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

Analyzing the Chord Peer-to-Peer Network for Power Grid Applications Analyzing the Chord Peer-to-Peer Network for Power Grid Applications Hakem Beitollahi Hakem.Beitollahi@esat.kuleuven.be Geert Deconinck Geert.Deconinck@esat.kuleuven.be Katholieke Universiteit Leuven Electrical

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

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

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

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

Efficient Resource Management for the P2P Web Caching

Efficient Resource Management for the P2P Web Caching Efficient Resource Management for the P2P Web Caching 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

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

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

Towards Benchmarking of P2P Technologies from a SCADA Systems Protection Perspective

Towards Benchmarking of P2P Technologies from a SCADA Systems Protection Perspective Towards Benchmarking of P2P Technologies from a SCADA Systems Protection Perspective CIIP at Mobilight 2010 Abdelmajid Khelil, Sebastian Jeckel, Daniel Germanus and Neeraj Suri 11.05.10 Abdelmajid Khelil

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

Peer-to-peer systems and overlay networks

Peer-to-peer systems and overlay networks Complex Adaptive Systems C.d.L. Informatica Università di Bologna Peer-to-peer systems and overlay networks Fabio Picconi Dipartimento di Scienze dell Informazione 1 Outline Introduction to P2P systems

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

Telematics Chapter 9: Peer-to-Peer Networks

Telematics Chapter 9: Peer-to-Peer Networks Telematics Chapter 9: Peer-to-Peer Networks Beispielbild User watching video clip Server with video clips Application Layer Presentation Layer Application Layer Presentation Layer Session Layer Session

More information

Overlay and P2P Networks. Introduction and unstructured networks. Prof. Sasu Tarkoma

Overlay and P2P Networks. Introduction and unstructured networks. Prof. Sasu Tarkoma Overlay and P2P Networks Introduction and unstructured networks Prof. Sasu Tarkoma 14.1.2013 Contents Overlay networks and intro to networking Unstructured networks Overlay Networks An overlay network

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

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

Fast Topology Management in Large Overlay Networks

Fast Topology Management in Large Overlay Networks Topology as a key abstraction Fast Topology Management in Large Overlay Networks Ozalp Babaoglu Márk Jelasity Alberto Montresor Dipartimento di Scienze dell Informazione Università di Bologna! Topology

More information

ADAPTIVE AND DYNAMIC LOAD BALANCING METHODOLOGIES FOR DISTRIBUTED ENVIRONMENT

ADAPTIVE AND DYNAMIC LOAD BALANCING METHODOLOGIES FOR DISTRIBUTED ENVIRONMENT ADAPTIVE AND DYNAMIC LOAD BALANCING METHODOLOGIES FOR DISTRIBUTED ENVIRONMENT PhD Summary DOCTORATE OF PHILOSOPHY IN COMPUTER SCIENCE & ENGINEERING By Sandip Kumar Goyal (09-PhD-052) Under the Supervision

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

Evaluating Unstructured Peer-to-Peer Lookup Overlays

Evaluating Unstructured Peer-to-Peer Lookup Overlays Evaluating Unstructured Peer-to-Peer Lookup Overlays Idit Keidar EE Department, Technion Roie Melamed CS Department, Technion ABSTRACT Unstructured peer-to-peer lookup systems incur small constant overhead

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 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

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

Ossification of the Internet

Ossification of the Internet Ossification of the Internet The Internet evolved as an experimental packet-switched network Today, many aspects appear to be set in stone - Witness difficulty in getting IP multicast deployed - Major

More information

Overlay Networks: Motivations. EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Motivations (cont d) Goals.

Overlay Networks: Motivations. EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Motivations (cont d) Goals. Overlay Networks: Motivations CS : Introduction to Computer Networks Overlay Networks and PP Networks Ion Stoica Computer Science Division Department of lectrical ngineering and Computer Sciences University

More information

6. Peer-to-peer (P2P) networks I.

6. Peer-to-peer (P2P) networks I. 6. Peer-to-peer (P2P) networks I. PA159: Net-Centric Computing I. Eva Hladká Faculty of Informatics Masaryk University Autumn 2010 Eva Hladká (FI MU) 6. P2P networks I. Autumn 2010 1 / 46 Lecture Overview

More information

Unit 8 Peer-to-Peer Networking

Unit 8 Peer-to-Peer Networking Unit 8 Peer-to-Peer Networking P2P Systems Use the vast resources of machines at the edge of the Internet to build a network that allows resource sharing without any central authority. Client/Server System

More information

Exploring the Catallactic Coordination Approach for Peer-to-Peer systems *

Exploring the Catallactic Coordination Approach for Peer-to-Peer systems * Exploring the Catallactic Coordination Approach for Peer-to-Peer systems * Oscar Ardaiz 1, Pau Artigas 1, Torsten Eymann 2, Felix Freitag 1, Roc Messeguer 1, Leandro Navarro 1, Michael Reinicke 2 1 Computer

More information

CS 640 Introduction to Computer Networks. Today s lecture. What is P2P? Lecture30. Peer to peer applications

CS 640 Introduction to Computer Networks. Today s lecture. What is P2P? Lecture30. Peer to peer applications Introduction to Computer Networks Lecture30 Today s lecture Peer to peer applications Napster Gnutella KaZaA Chord What is P2P? Significant autonomy from central servers Exploits resources at the edges

More information

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

EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Overlay Networks: Motivations EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley

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

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

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

Peer-to-Peer Architectures and Signaling. Agenda

Peer-to-Peer Architectures and Signaling. Agenda Peer-to-Peer Architectures and Signaling Juuso Lehtinen Juuso@netlab.hut.fi Slides based on presentation by Marcin Matuszewski in 2005 Introduction P2P architectures Skype Mobile P2P Summary Agenda 1 Introduction

More information

Flooded Queries (Gnutella) Centralized Lookup (Napster) Routed Queries (Freenet, Chord, etc.) Overview N 2 N 1 N 3 N 4 N 8 N 9 N N 7 N 6 N 9

Flooded Queries (Gnutella) Centralized Lookup (Napster) Routed Queries (Freenet, Chord, etc.) Overview N 2 N 1 N 3 N 4 N 8 N 9 N N 7 N 6 N 9 Peer-to-Peer Networks -: Computer Networking L-: PP Typically each member stores/provides access to content Has quickly grown in popularity Bulk of traffic from/to CMU is Kazaa! Basically a replication

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

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

Design of a New Hierarchical Structured Peer-to-Peer Network Based On Chinese Remainder Theorem

Design of a New Hierarchical Structured Peer-to-Peer Network Based On Chinese Remainder Theorem Design of a New Hierarchical Structured Peer-to-Peer Network Based On Chinese Remainder Theorem Bidyut Gupta, Nick Rahimi, Henry Hexmoor, and Koushik Maddali Department of Computer Science Southern Illinois

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

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

Distributed Systems. Characteristics of Distributed Systems. Lecture Notes 1 Basic Concepts. Operating Systems. Anand Tripathi

Distributed Systems. Characteristics of Distributed Systems. Lecture Notes 1 Basic Concepts. Operating Systems. Anand Tripathi 1 Lecture Notes 1 Basic Concepts Anand Tripathi CSci 8980 Operating Systems Anand Tripathi CSci 8980 1 Distributed Systems A set of computers (hosts or nodes) connected through a communication network.

More information

Distributed Systems. Characteristics of Distributed Systems. Characteristics of Distributed Systems. Goals in Distributed System Designs

Distributed Systems. Characteristics of Distributed Systems. Characteristics of Distributed Systems. Goals in Distributed System Designs 1 Anand Tripathi CSci 8980 Operating Systems Lecture Notes 1 Basic Concepts Distributed Systems A set of computers (hosts or nodes) connected through a communication network. Nodes may have different speeds

More information

Smart Distribution Grid: Status, Goals, Vision and Pathway for Success

Smart Distribution Grid: Status, Goals, Vision and Pathway for Success Smart Distribution Grid: Status, Goals, Vision and Pathway for Success S.S. (Mani) Venkata University of Washington, Seattle, WA venkata@ee.washington.edu 520-820-8005 Contributors: S. Roy, A. Pahwa, G.

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

Peer-to-Peer Internet Applications: A Review

Peer-to-Peer Internet Applications: A Review Peer-to-Peer Internet Applications: A Review Davide Quaglia 01/14/10 Introduction Key points Lookup task Outline Centralized (Napster) Query flooding (Gnutella) Distributed Hash Table (Chord) Simulation

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

Motivation for peer-to-peer

Motivation for peer-to-peer Peer-to-peer systems INF 5040 autumn 2015 lecturer: Roman Vitenberg INF5040, Frank Eliassen & Roman Vitenberg 1 Motivation for peer-to-peer Ø Inherent restrictions of the standard client/ server model

More information

A P2P Approach for Membership Management and Resource Discovery in Grids1

A P2P Approach for Membership Management and Resource Discovery in Grids1 A P2P Approach for Membership Management and Resource Discovery in Grids1 Carlo Mastroianni 1, Domenico Talia 2 and Oreste Verta 2 1 ICAR-CNR, Via P. Bucci 41 c, 87036 Rende, Italy mastroianni@icar.cnr.it

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

Assignment 5. Georgia Koloniari

Assignment 5. Georgia Koloniari Assignment 5 Georgia Koloniari 2. "Peer-to-Peer Computing" 1. What is the definition of a p2p system given by the authors in sec 1? Compare it with at least one of the definitions surveyed in the last

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

Time-related replication for p2p storage system

Time-related replication for p2p storage system Seventh International Conference on Networking Time-related replication for p2p storage system Kyungbaek Kim E-mail: University of California, Irvine Computer Science-Systems 3204 Donald Bren Hall, Irvine,

More information

Making Gnutella-like P2P Systems Scalable

Making Gnutella-like P2P Systems Scalable Making Gnutella-like P2P Systems Scalable Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, S. Shenker Presented by: Herman Li Mar 2, 2005 Outline What are peer-to-peer (P2P) systems? Early P2P systems

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

Peer-to-peer systems

Peer-to-peer systems Prof. Dr. Claudia Müller-Birn Institute for Computer Science, Networked Information Systems Peer-to-peer systems Netzprogrammierung (lgorithmen und Programmierung V) Where are we on our topic map? Descriptive

More information

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK PEER-TO-PEER FILE SHARING WITH THE BITTORRENT PROTOCOL APURWA D. PALIWAL 1, PROF.

More information

Resilient Smart Grids

Resilient Smart Grids Resilient Smart Grids André Teixeira Kaveh Paridari, Henrik Sandberg KTH Royal Institute of Technology, Sweden SPARKS 2nd Stakeholder Workshop Cork, Ireland March 25th, 2015 Legacy Distribution Grids Main

More information

HIGH LEVEL REQUIREMENTS OF FAST SIMULATION AND MODELLING SUITE OF TOOLS FOR FUTURE SELF-HEALING DISTRIBUTION POWER SYSTEM

HIGH LEVEL REQUIREMENTS OF FAST SIMULATION AND MODELLING SUITE OF TOOLS FOR FUTURE SELF-HEALING DISTRIBUTION POWER SYSTEM HIGH LEVEL REQUIREMENTS OF FAST SIMULATION AND MODELLING SUITE OF TOOLS FOR FUTURE SELF-HEALING DISTRIBUTION POWER SYSTEM A. Valenti* I Bel ** S. Lee *EDF **EPRI E2I ConEdison France USA USA arnaud.valenti@edf.fr

More information

Peer-to-Peer Networks

Peer-to-Peer Networks Peer-to-Peer Networks 14-740: Fundamentals of Computer Networks Bill Nace Material from Computer Networking: A Top Down Approach, 6 th edition. J.F. Kurose and K.W. Ross Administrivia Quiz #1 is next week

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

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

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

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

A Survey on Resource Allocation policies in Mobile ad-hoc Computational Network

A Survey on Resource Allocation policies in Mobile ad-hoc Computational Network A Survey on policies in Mobile ad-hoc Computational S. Kamble 1, A. Savyanavar 2 1PG Scholar, Department of Computer Engineering, MIT College of Engineering, Pune, Maharashtra, India 2Associate Professor,

More information

Chapter 2 State Estimation and Visualization

Chapter 2 State Estimation and Visualization Chapter 2 State Estimation and Visualization One obvious application of GPS-synchronized measurements is the dynamic monitoring of the operating conditions of the system or the dynamic state estimation

More information

File Sharing in Less structured P2P Systems

File Sharing in Less structured P2P Systems File Sharing in Less structured P2P Systems. Bhosale S.P. 1, Sarkar A.R. 2 Computer Science And Engg. Dept., SVERI s College of Engineering Pandharpur Solapur, India1 Asst.Prof, Computer Science And Engg.

More information

IN recent years, the amount of traffic has rapidly increased

IN recent years, the amount of traffic has rapidly increased , March 15-17, 2017, Hong Kong Content Download Method with Distributed Cache Management Masamitsu Iio, Kouji Hirata, and Miki Yamamoto Abstract This paper proposes a content download method with distributed

More information

Page 1. How Did it Start?" Model" Main Challenge" CS162 Operating Systems and Systems Programming Lecture 24. Peer-to-Peer Networks"

Page 1. How Did it Start? Model Main Challenge CS162 Operating Systems and Systems Programming Lecture 24. Peer-to-Peer Networks How Did it Start?" CS162 Operating Systems and Systems Programming Lecture 24 Peer-to-Peer Networks" A killer application: Napster (1999) Free music over the Internet Key idea: share the storage and bandwidth

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

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

Super-Peer Architectures for Distributed Computing

Super-Peer Architectures for Distributed Computing Whitepaper Super-Peer Architectures for Distributed Computing Fiorano Software, Inc. 718 University Avenue, Suite 212 Los Gatos, CA 95032 U.S.A. +1.408.354.3210 email info@fiorano.com www.fiorano.com Entire

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

A Super-Peer Selection Strategy for Peer-to-Peer Systems

A Super-Peer Selection Strategy for Peer-to-Peer Systems , pp.25-29 http://dx.doi.org/10.14257/astl.2016.125.05 A Super-Peer Selection Strategy for Peer-to-Peer Systems Won-Ho Chung 1 1 Department of Digital Media, Duksung Womens University whchung@duksung.ac.kr

More information

Client Server & Distributed System. A Basic Introduction

Client Server & Distributed System. A Basic Introduction Client Server & Distributed System A Basic Introduction 1 Client Server Architecture A network architecture in which each computer or process on the network is either a client or a server. Source: http://webopedia.lycos.com

More information

Peer-to-Peer Signalling. Agenda

Peer-to-Peer Signalling. Agenda Peer-to-Peer Signalling Marcin Matuszewski marcin@netlab.hut.fi S-38.115 Signalling Protocols Introduction P2P architectures Skype Mobile P2P Summary Agenda 1 Introduction Peer-to-Peer (P2P) is a communications

More information

WSN Routing Protocols

WSN Routing Protocols WSN Routing Protocols 1 Routing Challenges and Design Issues in WSNs 2 Overview The design of routing protocols in WSNs is influenced by many challenging factors. These factors must be overcome before

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

Routing protocols in WSN

Routing protocols in WSN Routing protocols in WSN 1.1 WSN Routing Scheme Data collected by sensor nodes in a WSN is typically propagated toward a base station (gateway) that links the WSN with other networks where the data can

More information

REALISATION OF AN INTELLIGENT AND CONTINUOUS PROCESS CONNECTION IN SUBSTATIONS

REALISATION OF AN INTELLIGENT AND CONTINUOUS PROCESS CONNECTION IN SUBSTATIONS REALISATION OF AN INTELLIGENT AND CONTINUOUS PROCESS CONNECTION IN SUBSTATIONS Christina SÜFKE Carsten HAVERKAMP Christian WEHLING Westnetz GmbH - Germany Westnetz GmbH - Germany Westnetz GmbH - Germany

More information

CSE 486/586 Distributed Systems Peer-to-Peer Architectures

CSE 486/586 Distributed Systems Peer-to-Peer Architectures CSE 486/586 Distributed Systems eer-to-eer Architectures Steve Ko Computer Sciences and Engineering University at Buffalo CSE 486/586 Last Time Gossiping Multicast Failure detection Today s Question How

More information

CBRBrain: Provide Content Based Routing Service Over Internet Backbone

CBRBrain: Provide Content Based Routing Service Over Internet Backbone CBRBrain: Provide Content Based Routing Service Over Internet Backbone Wen-Zhan Song Xiang-Yang Li 1 Abstract Peer-to-peer(P2P) networking has come to a family of technologies and techniques for organizing

More information

A New Adaptive, Semantically Clustered Peer-to-Peer Network Architecture

A New Adaptive, Semantically Clustered Peer-to-Peer Network Architecture A New Adaptive, Semantically Clustered Peer-to-Peer Network Architecture 1 S. Das 2 A. Thakur 3 T. Bose and 4 N.Chaki 1 Department of Computer Sc. & Engg, University of Calcutta, India, soumava@acm.org

More information

Chapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP BLM431 Computer Networks Dr.

Chapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP BLM431 Computer Networks Dr. Chapter 5 (Week 9) The Network Layer ANDREW S. TANENBAUM COMPUTER NETWORKS FOURTH EDITION PP. 343-396 1 5.1. NETWORK LAYER DESIGN ISSUES 5.2. ROUTING ALGORITHMS 5.3. CONGESTION CONTROL ALGORITHMS 5.4.

More information

Constructing Overlay Networks through Gossip

Constructing Overlay Networks through Gossip Constructing Overlay Networks through Gossip Márk Jelasity Università di Bologna Project funded by the Future and Emerging Technologies arm of the IST Programme The Four Main Theses 1: Topology (network

More information

System models for distributed systems

System models for distributed systems System models for distributed systems INF5040/9040 autumn 2010 lecturer: Frank Eliassen INF5040 H2010, Frank Eliassen 1 System models Purpose illustrate/describe common properties and design choices for

More information

Addressed Issue. P2P What are we looking at? What is Peer-to-Peer? What can databases do for P2P? What can databases do for P2P?

Addressed Issue. P2P What are we looking at? What is Peer-to-Peer? What can databases do for P2P? What can databases do for P2P? Peer-to-Peer Data Management - Part 1- Alex Coman acoman@cs.ualberta.ca Addressed Issue [1] Placement and retrieval of data [2] Server architectures for hybrid P2P [3] Improve search in pure P2P systems

More information

Virtual Multi-homing: On the Feasibility of Combining Overlay Routing with BGP Routing

Virtual Multi-homing: On the Feasibility of Combining Overlay Routing with BGP Routing Virtual Multi-homing: On the Feasibility of Combining Overlay Routing with BGP Routing Zhi Li, Prasant Mohapatra, and Chen-Nee Chuah University of California, Davis, CA 95616, USA {lizhi, prasant}@cs.ucdavis.edu,

More information

Peer-to-Peer Resource Detection by Random Walkers Using Rateless Codes Based on Interest Clusters

Peer-to-Peer Resource Detection by Random Walkers Using Rateless Codes Based on Interest Clusters Peer-to-Peer Resource Detection by Random Walkers Using Rateless Codes Based on Interest Clusters J.Srimathi 1 and R.Jayaraj 2 1 M.Tech scholar, Computer Science &Engineering Department, SRM University,

More information

A Resource Exchange Architecture for Peer-to-Peer File Sharing Applications

A Resource Exchange Architecture for Peer-to-Peer File Sharing Applications The Computer Journal Vol. 48 No. 1 The British Computer Society 2005; all rights reserved DOI:10.1093/comjnl/bxh055 A Resource Exchange Architecture for -to- File Sharing Applications Chung-Ming Huang

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

D DAVID PUBLISHING. Big Data; Definition and Challenges. 1. Introduction. Shirin Abbasi

D DAVID PUBLISHING. Big Data; Definition and Challenges. 1. Introduction. Shirin Abbasi Journal of Energy and Power Engineering 10 (2016) 405-410 doi: 10.17265/1934-8975/2016.07.004 D DAVID PUBLISHING Shirin Abbasi Computer Department, Islamic Azad University-Tehran Center Branch, Tehran

More information

EE 122: Peer-to-Peer Networks

EE 122: Peer-to-Peer Networks EE 122: Peer-to-Peer Networks Ion Stoica (and Brighten Godfrey) TAs: Lucian Popa, David Zats and Ganesh Ananthanarayanan http://inst.eecs.berkeley.edu/~ee122/ (Materials with thanks to Vern Paxson, Jennifer

More information

Scalable overlay Networks

Scalable overlay Networks overlay Networks Dr. Samu Varjonen 1 Lectures MO 15.01. C122 Introduction. Exercises. Motivation. TH 18.01. DK117 Unstructured networks I MO 22.01. C122 Unstructured networks II TH 25.01. DK117 Bittorrent

More information

Peer-to-Peer (P2P) Communication

Peer-to-Peer (P2P) Communication eer-to-eer (2) Communication 1 References Lv, Cao, Cohen, Li and Shenker, Search and Replication in Unstructured eer-to-eer Networks, In 16 th ACM Intl Conf on Supercomputing (ICS), 2002. S. Kang and M.

More information

Scalable overlay Networks

Scalable overlay Networks overlay Networks Dr. Samu Varjonen 1 Contents Course overview Lectures Assignments/Exercises 2 Course Overview Overlay networks and peer-to-peer technologies have become key components for building large

More information

Virtualization and Softwarization Technologies for End-to-end Networking

Virtualization and Softwarization Technologies for End-to-end Networking ization and Softwarization Technologies for End-to-end Networking Naoki Oguchi Toru Katagiri Kazuki Matsui Xi Wang Motoyoshi Sekiya The emergence of 5th generation mobile networks (5G) and Internet of

More information

DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S. TANENBAUM MAARTEN VAN STEEN. Chapter 1. Introduction

DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S. TANENBAUM MAARTEN VAN STEEN. Chapter 1. Introduction DISTRIBUTED SYSTEMS Principles and Paradigms Second Edition ANDREW S. TANENBAUM MAARTEN VAN STEEN Chapter 1 Introduction Modified by: Dr. Ramzi Saifan Definition of a Distributed System (1) A distributed

More information

High Assurance Communication Technique for. Autonomous File Sharing Community

High Assurance Communication Technique for. Autonomous File Sharing Community High Assurance Communication Technique for Autonomous File Sharing Community Khaled Ragab, Takanori Ono and Kinji Mori Tokyo Institute of Technology 2-12-1 Ookayama, Meguro, Tokyo 152-8552 Tel: +81-3-5734-2664,

More information

Coordination and Control of Multiple Microgrids Using Multi- Agent Systems

Coordination and Control of Multiple Microgrids Using Multi- Agent Systems Coordination and Control of Multiple Microgrids Using Multi- Agent Systems Sergio Rivera, Amro Farid, Kamal Youcef-Toumi Abstract As distributed renewable generation sources continue to be integrated into

More information