Topologies and behavioral properties of the network Yvon Kermarrec Based on tml.

Slides:



Advertisements
Similar presentations
Performance in Decentralized Filesharing Networks Theodore Hong Freenet Project.
Advertisements

Data Communications and Networking
CAN 1.Distributed Hash Tables a)DHT recap b)Uses c)Example – CAN.
P2P data retrieval DHT (Distributed Hash Tables) Partially based on Hellerstein’s presentation at VLDB2004.
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.
Clayton Sullivan PEER-TO-PEER NETWORKS. INTRODUCTION What is a Peer-To-Peer Network A Peer Application Overlay Network Network Architecture and System.
© 2007 Cisco Systems, Inc. All rights reserved. Valašské Meziříčí Connecting to the Network.
P2P Topologies Centralized Ring Hierarchical Decentralized Hybrid.
Peer-to-Peer is Not Always Decentralized …when Centralization is Good Nelson Minar
P2P Topologies CentralizedCentralized RingRing HierarchicalHierarchical DecentralizedDecentralized HybridHybrid.
Reliability on Web Services Presented by Pat Chan 17/10/2005.
1.Optimizing P2P Networks: Lessons learned from social networking a)Social Networks b)Lessons Learned c)Are P2P Networks Social?? d)Organizing P2P Networks.
Network Management Overview IACT 918 July 2004 Gene Awyzio SITACS University of Wollongong.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
Overview Distributed vs. decentralized Why distributed databases
A. Frank 1 Internet Resources Discovery (IRD) Peer-to-Peer (P2P) Technology (1) Thanks to Carmit Valit and Olga Gamayunov.
EEC-681/781 Distributed Computing Systems Lecture 3 Wenbing Zhao Department of Electrical and Computer Engineering Cleveland State University
presented by Hasan SÖZER1 Scalable P2P Search Daniel A. Menascé George Mason University.
1 Client-Server versus P2P  Client-server Computing  Purpose, definition, characteristics  Relationship to the GRID  Research issues  P2P Computing.
A Routing Control Platform for Managing IP Networks Jennifer Rexford Princeton University
Chord-over-Chord Overlay Sudhindra Rao Ph.D Qualifier Exam Department of ECECS.
Topics in Reliable Distributed Systems Fall Dr. Idit Keidar.
Conclusions in Peer-to-Peer Systems Παρουσίαση: Τάσος Καραγιάννης, Σπυριδούλα Μαργαρίτη, Κώστας Στεφανίδης, Θοδωρής Τσώτσος.
INTRODUCTION TO COMPUTER NETWORKS INTRODUCTION Lecture # 1 (
Network Topologies.
Introduction to Cyberspace
Introduction to Peer-to-Peer Networks. What is a P2P network Uses the vast resource of the machines at the edge of the Internet to build a network that.

Introduction to Peer-to-Peer Networks. What is a P2P network A P2P network is a large distributed system. It uses the vast resource of PCs distributed.
Peer-to-Peer Networking. Presentation Introduction Characteristics and Challenges of Peer-to-Peer Peer-to-Peer Applications Classification of Peer-to-Peer.
Peer-to-Peer Networks University of Jordan. Server/Client Model What?
Jonathan Walpole CSE515 - Distributed Computing Systems 1 Teaching Assistant for CSE515 Rahul Dubey.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Network Services Networking for Home and Small Businesses – Chapter 6.
 A P2P IRC Network Built on Top of the Kademlia Distributed Hash Table.
CSC Intro. to Computing Lecture 23: Networks.
Architectures of distributed systems Fundamental Models
PSI Peer Search Infrastructure. Introduction What are P2P Networks? The term "peer-to-peer" refers to a class of systems and applications that employ.
 Topology Topology  Different types of topology Different types of topology  bus topologybus topology  ring topologyring topology  star topologystar.
The McGraw- AS Computing LAN Topologies. The McGraw- Categories of LAN Topology.
Peer-to-Peer Network Tzu-Wei Kuo. Outline What is Peer-to-Peer(P2P)? P2P Architecture Applications Advantages and Weaknesses Security Controversy.
SIGCOMM 2001 Lecture slides by Dr. Yingwu Zhu Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.
th CODATA 2006, BEJING1 A P2P Service Discovery Strategy Based on Content Catalogues Dr. Lican Huang, Director Institute of Network & Distributed.
Distributed Information Systems. Motivation ● To understand the problems that Web services try to solve it is helpful to understand how distributed information.
A Scalable Virtual Registry Service for jGMA Matthew Grove DSG Seminar 3 rd May 2005.
Peer to Peer Network Design Discovery and Routing algorithms
Peer to Peer Computing. What is Peer-to-Peer? A model of communication where every node in the network acts alike. As opposed to the Client-Server model,
Data Communications and Networks Chapter 9 – Distributed Systems ICT-BVF8.1- Data Communications and Network Trainer: Dr. Abbes Sebihi.
Introduction to Active Directory
1 Active Directory Service in Windows 2000 Li Yang SID: November 2000.
P2P Search COP P2P Search Techniques Centralized P2P systems  e.g. Napster, Decentralized & unstructured P2P systems  e.g. Gnutella.
Malugo – a scalable peer-to-peer storage system..
Network Topology Computer network topology is the way various components of a network (like nodes, links, peripherals, etc) are arranged. Network topologies.
Composing Web Services and P2P Infrastructure. PRESENTATION FLOW Related Works Paper Idea Our Project Infrastructure.
INTRODUCTION TO COMPUTER NETWORKS
Peer-to-peer networking
Distributed Systems CS
Software Design and Architecture
CHAPTER 3 Architectures for Distributed Systems
DHT Routing Geometries and Chord
Peer-to-Peer Information Systems Week 6: Performance
DATA RETRIEVAL IN ADHOC NETWORKS
Architectures of distributed systems Fundamental Models
Distributed computing deals with hardware
Architectures of distributed systems Fundamental Models
INTRODUCTION TO COMPUTER NETWORKS
INTRODUCTION TO COMPUTER NETWORKS
Distributed Systems CS
A P2P Service Discovery Strategy Based on Content Catalogues
Architectures of distributed systems Fundamental Models
Presentation transcript:

Topologies and behavioral properties of the network Yvon Kermarrec Based on tml

Dpt/Auteur Key player : the network The network plays a central role for communication and coordination How is it structured ? How does it behave ? What are its impacts on the applications ?

Dpt/Auteur Agenda Topologies and structural properties of the network Behavioral properties of the network

Dpt/Auteur Topologies issues Centralized vs. decentralized systems How the nodes in the system are connected. Topology can be considered at many different levels: physical, logical, connection, or organizational. Topology is considered in terms of the information flow. Nodes in the graph are individual computers or programs, links between nodes indicate that those nodes are sharing information regularly in the system.

Dpt/Auteur Centralized topology (star) Centralized Client/server Web servers Databases Napster search Instant Messaging Popular Power

Dpt/Auteur Centralized topology Centralized systems are the most familiar form of topology Typically seen as the client/server pattern used by databases, web servers, and other simple distributed systems. All function and information is centralized into one server with many clients connecting directly to the server to send and receive information. is a fully centralized architecture with the job dispatcher as the server

Dpt/Auteur Ring topology

Dpt/Auteur Ring topology A single centralized server cannot handle high client load, so a common solution is to use a cluster of machines arranged in a ring to act as a distributed server. Communication between the nodes coordinates state- sharing, producing a group of nodes that provide identical function but have failover and load-balancing capabilities. Unlike the other topologies here, ring systems are generally built assuming the machines are all nearby on the network and owned by a single organization.

Dpt/Auteur Hierarchical

Dpt/Auteur Hierarchical Hierarchical systems have a long history on the Internet, but in practice are often overlooked as a distinct distributed systems topology. The best-known hierarchical system on the Internet is the Domain Name Service, where authority flows from the root name-servers to the server for the registered name.Domain Name Service NTP, the Network Time Protocol, creates another hierarchical system.Network Time Protocol

Dpt/Auteur Hierarchical In NTP, there are root time servers that have authoritative clocks; other computers synchronize to root time servers in a self- organizing tree. NTP has over 175,000 hosts with most hosts being two or three links away from a root time source.over 175,000 hosts Usenet is another large hierarchical system, using a tree-like structure to copy articles between servers.

Dpt/Auteur Decentralized

Dpt/Auteur Decentralized The final topology we consider here is decentralized systems, where all peers communicate symmetrically and have equal roles. Gnutella is probably the most "pure" decentralized system used in practice today, with only a small centralized function to bootstrap a new host. Many other file-sharing systems are also designed to be decentralized, such as Freenet or OceanStore. Decentralized systems are not new; the Internet routing architecture itself is largely decentralized, with the Border Gateway Protocol used to coordinate the peering links between various autonomous systems.Border Gateway Protocol

Dpt/Auteur

Hybrid topologies Distributed systems often have a more complex organization than any one simple topology. Real-world systems often combine several topologies into one system, making a hybrid topology. Nodes typically play multiple roles in such a system. For example, a node might have a centralized interaction with one part of the system, while being part of a hierarchy in another part.

Dpt/Auteur Central + ring

Dpt/Auteur Central + ring As mentioned above, serious web server applications often have a ring of servers for load balancing and failover. The server system itself is a ring, but the system as a whole (including the clients) is a hybrid: a centralized system where the server is itself a ring. The result is the simplicity of a centralized system (from the client's point of view) with the robustness of a ring.

Dpt/Auteur Centralized + centralized

Dpt/Auteur Centralized + centralized The server in a centralized system is itself often a client of one or more other servers. Stacking multiple centralized systems is the core of n-tier application frameworks. For example, when a web browser contacts a server, the software on that server may just be formatting results into HTML for presentation and itself calling to servers hosting business logic or data. Web services intermediaries such as Grand Central Networks also create several layers of centralized system. Centralized systems are often stacked as a way to compose function.Grand Central Networks

Dpt/Auteur Centralized + decentralized Clip2 Gnutella Reflector FastTrack / KaZaA Morpheus

Dpt/Auteur Strength and weakness Plenty of topologies to choose from What is each kind good for? Need a set of properties to measure

Dpt/Auteur Issues to be considered Manageability How hard is it to keep working? Information coherence How authoritative is info? (Auditing, non-repudiation) Extensibility How easy is it to grow? Fault tolerance How well can it handle failures? Security How hard is it to subvert? Resistance to legal or political intervention How hard is it to shut down? (Can be good or bad) Scalability How big can it grow?

Dpt/Auteur Centralized Manageable Coherent Extensible Fault Tolerant Secure Scalable System is all in one place All information is in one place X No one can add on to system X Single point of failure ? One machine.

Dpt/Auteur Ring Manageable Coherent Extensible Fault Tolerant Secure Scalable Simple rules for relationships Easy logic for state X Only ring owner can add Fail-over to next host As long as ring has one owner Just add more hosts

Dpt/Auteur Hierarchical Manageable Coherent Extensible Fault Tolerant Secure Scalable ½ Chain of authority ½ Cache consistency ½ Add more leaves, rebalance ½ Root is vulnerable X Too easy to spoof links Hugely scalable – DNS

Dpt/Auteur Decentralized Manageable Coherent Extensible Fault Tolerant Secure Scalable X Very difficult, many owners X Difficult, unreliable peers Anyone can join in! Redundancy X Difficult, open research ? Theory – yes : Practice – no

Dpt/Auteur Centralized + Ring Manageable Coherent Extensible Fault Tolerant Secure Scalable Just manage the ring As coherent as ring X No more than ring Ring is a huge win As secure as ring Ring is a huge win

Dpt/Auteur Centralized + Decentralized Manageable Coherent Extensible Fault Tolerant Secure Scalable X Same as decentralized ½ Better than decentralized Anyone can still join! Plenty of redundancy X Same as decentralized ? Looking very hopeful

Dpt/Auteur Centralized vs. Decentralized Centralized is pretty good! Manageable Coherent Security Decentralized is exciting Extensible Massive fault tolerance Lawsuit-proof Scalability is the big question

Dpt/Auteur Conclusions Importance of regularity Impacts of the topology on the application code : To communicate with other machines: routing To broadcast To deal with failure The application and the underlying topology are closely related The application can benefit of the topology and can rely on multiple ‘logical’ topologies

Dpt/Auteur Conclusions Centralized is easy to deal with Major architecture for distributed systems Combines well with rings Decentralized is good, needs research Coherence, Manageability, Security Scalability Hierarchical is overlooked Combining architectures is powerful

Dpt/Auteur Behavioral properties of the network Ideal nertwork does not : Loose a message Duplicate message Alter the message content Desequence messages Provide bound for communication times But we have to deal with non perfect networks !