Outline Introduction Six Degrees of Separation P2P Networks OSI Model References. Graphs and Networks. Aravind Ranganathan

Size: px
Start display at page:

Download "Outline Introduction Six Degrees of Separation P2P Networks OSI Model References. Graphs and Networks. Aravind Ranganathan"

Transcription

1 Graphs and Networks Aravind Ranganathan PhD Candidate, University of Cincinnati Alumni, SSNCE August 27, 2007

2 Outline Modeling Networks as Graphs Six degrees of separation P2P Networks OSI Layers Wireless Networks

3 Outline Modeling Networks as Graphs Six degrees of separation P2P Networks OSI Layers Wireless Networks

4 Definitions Network: Any interconnected group or system Examples: Human Networks Computer Networks Biological Networks Graph: Collection of Nodes and Edges

5 Definitions Network: Any interconnected group or system Examples: Human Networks Computer Networks Biological Networks Graph: Collection of Nodes and Edges Why model networks as graphs?

6 Why Model Networks as Graphs? To solve the problems theoretically!!

7 Why Model Networks as Graphs? Facility Location Problem: Where to place 10 new Fresh shops around the city?

8 Why Model Networks as Graphs? Some Well Known Problems (and Algorithms): Traveling Salesman Problem Minimum Spanning Trees: Kruskal / Prim s Algorithm Shortest Path: Bellman-Ford / Dijkstra / Floyd s Algorithm Perfect Matching: Hungarian Algorithm Max-Flow/Min-Cut: Ford-Fulkerson s Algorithm

9 Why Model Networks as Graphs? Some Well Known Problems (and Algorithms): Traveling Salesman Problem Minimum Spanning Trees: Kruskal / Prim s Algorithm Shortest Path: Bellman-Ford / Dijkstra / Floyd s Algorithm Perfect Matching: Hungarian Algorithm Max-Flow/Min-Cut: Ford-Fulkerson s Algorithm Not all problems have polynomial time complexity :(

10 6 Degrees of Separation Idea that everyone is no more than 6 steps away from any person on Earth Small world phenomenon

11 Small World Experiments Stanley Milgram s Experiments ( 67) To determine the probability that two randomly selected people would know each other Selected several pairs of random individuals (start and end) Each person to forward the letter only to a friend Human Society is a small world type network!! Duncan Watts recreating Milgram s Experiment ( 01) Milgram s experiment on the internet using Degree of separation was still 6!!

12 Small World Experiments Stanley Milgram s Experiments ( 67) To determine the probability that two randomly selected people would know each other Selected several pairs of random individuals (start and end) Each person to forward the letter only to a friend Human Society is a small world type network!! Duncan Watts recreating Milgram s Experiment ( 01) Milgram s experiment on the internet using Degree of separation was still 6!!

13 Theoretical basis Let: Then, Total Population = P, Avg. No. of friends per person = f, Degrees of separation = d. P = f d implies, d = ln P ln f If P=6 billion, for d=6, each person must know 42 people (approx) Note: 6 degree of separation is only in the average sense

14 Theoretical basis Let: Then, Total Population = P, Avg. No. of friends per person = f, Degrees of separation = d. P = f d implies, d = ln P ln f If P=6 billion, for d=6, each person must know 42 people (approx) Note: 6 degree of separation is only in the average sense

15 Six Degrees of Kevin Bacon Trivia game based on the small world phenomenon Any actor can be linked, through their film roles, to actor Kevin Bacon Figure: Kevin Bacon

16 6 Degrees - Examples - Kevin Bacon and Amitabh Bachchan Kevin Bacon has an Amitabh Bachchan number of 3. Kevin Bacon was in Sleepers ( 96) with Michael J. Burg Burg was in One-Third ( 06) with Greg D Agostino D Agostino was in Kabhi Alvida Naa Kehna ( 06) with Amitabh Bachchan

17 6 Degrees - Examples - Al Pacino and RajniKanth Al Pacino has a RajniKanth number of 3. Al Pacino was in Revolution ( 85) with Steven Berkoff Berkoff was in Bokshu the Myth ( 02) with Vineeth Vineeth was in Chandramukhi ( 05) with Rajnikanth

18 Peer-to-Peer Network Client-Client Architecture vs. Client-Server Architecture Distributed computer network Utilizes cumulative resources of nodes Popular uses: Digital content sharing Streaming audio, video, and realtime data

19 Napster By Shawn Fanning (and Sean Parker) on June 1, 1999 Sharing music (as.mp3) Central servers to maintain lists of connected systems and files they provided Eventually shutdown

20 BitTorrent P2P communications protocol by Bram Cohen ( 01) Each file is split into several chunks A Tracker maintains lists of the clients currently participating in the torrent Information stored in.torrent file To download the file Peer downloads the.torrent file Gets list of other peers sharing the file from Tracker Downloads new chunks from available peers Uploads downloaded chunks to other peers Reduces cost, More redundancy

21 BitTorrent Animation Coloured bars - Individual chunks of the file Chunks individually transferred from client to client Original seeder only sends out 1 copy of the file for all the clients to receive a copy

22 BitTorrent Animation Coloured bars - Individual chunks of the file Chunks individually transferred from client to client Original seeder only sends out 1 copy of the file for all the clients to receive a copy

23 BitTorrent Animation Coloured bars - Individual chunks of the file Chunks individually transferred from client to client Original seeder only sends out 1 copy of the file for all the clients to receive a copy

24 BitTorrent Animation Coloured bars - Individual chunks of the file Chunks individually transferred from client to client Original seeder only sends out 1 copy of the file for all the clients to receive a copy

25 BitTorrent Animation Coloured bars - Individual chunks of the file Chunks individually transferred from client to client Original seeder only sends out 1 copy of the file for all the clients to receive a copy

26 BitTorrent Animation Coloured bars - Individual chunks of the file Chunks individually transferred from client to client Original seeder only sends out 1 copy of the file for all the clients to receive a copy

27 Classification of Networks Computer Networks: LANs, MANs and WANs Wired vs. Wireless Examples: Internet IEEE Networks Ad-hoc Networks Sensor Networks Mesh Networks Cellular Networks

28 Classification of Networks Computer Networks: LANs, MANs and WANs Wired vs. Wireless Examples: Internet IEEE Networks Ad-hoc Networks Sensor Networks Mesh Networks Cellular Networks

29 OSI Model Open Systems Interconnection Basic Reference Model Abstract model of networking and set of concrete protocols Networking system is divided into layers Within each layer, one or more entities implement its functionality Each entity interacts only with layer immediately beneath it, provides facilities for the layer above it

30 Snail Mail Scenario Karthik from Chennai and Amit from Delhi are Pen pals. Letter from Karthik to Amit 1 Karthik writes a letter and addresses it to Amit 2 Karthik posts the letter in the postbox 3 Letter collected from postbox, reaches local Post Office (PO) 4 PO sorts the letter and places it with other letters to Delhi 5 Letters to Delhi are physically transported to Delhi PO 6 PO postman delivers Karthik s letter to Amit s house 7 Amit reads the letter from Karthik

31 Advantages of the Layered Approach Data Abstraction Easy to add / modify functionality Interoperability among vendors

32 OSI Layers Appln, Presentation, Session Layers: Provides network services to user applns Transport Layer Responsible for end-to-end data txn Network Layer Routing data from one node to another Data Link Layer Physical txn of data in a link Physical Layer Sends & receives in bits

33 References Wikipedia Six degrees of separation P2P Networks OSI Model Kevin Bacon Oracle: links.html

34 Contact www: rangana

ECS 253 / MAE 253, Lecture 8 April 21, Web search and decentralized search on small-world networks

ECS 253 / MAE 253, Lecture 8 April 21, Web search and decentralized search on small-world networks ECS 253 / MAE 253, Lecture 8 April 21, 2016 Web search and decentralized search on small-world networks Search for information Assume some resource of interest is stored at the vertices of a network: Web

More information

Network Thinking. Complexity: A Guided Tour, Chapters 15-16

Network Thinking. Complexity: A Guided Tour, Chapters 15-16 Network Thinking Complexity: A Guided Tour, Chapters 15-16 Neural Network (C. Elegans) http://gephi.org/wp-content/uploads/2008/12/screenshot-celegans.png Food Web http://1.bp.blogspot.com/_vifbm3t8bou/sbhzqbchiei/aaaaaaaaaxk/rsc-pj45avc/

More information

Introduction To Graphs and Networks. Fall 2013 Carola Wenk

Introduction To Graphs and Networks. Fall 2013 Carola Wenk Introduction To Graphs and Networks Fall 203 Carola Wenk On the Internet, links are essentially weighted by factors such as transit time, or cost. The goal is to find the shortest path from one node to

More information

The Open System Interconnect model

The Open System Interconnect model The Open System Interconnect model Telecomunicazioni Undergraduate course in Electrical Engineering University of Rome La Sapienza Rome, Italy 2007-2008 1 Layered network design Data networks are usually

More information

Math 443/543 Graph Theory Notes 10: Small world phenomenon and decentralized search

Math 443/543 Graph Theory Notes 10: Small world phenomenon and decentralized search Math 443/543 Graph Theory Notes 0: Small world phenomenon and decentralized search David Glickenstein November 0, 008 Small world phenomenon The small world phenomenon is the principle that all people

More information

Example 1: An algorithmic view of the small world phenomenon

Example 1: An algorithmic view of the small world phenomenon Lecture Notes: Social Networks: Models, Algorithms, and Applications Lecture 1: Jan 17, 2012 Scribes: Preethi Ambati and Azar Aliyev Example 1: An algorithmic view of the small world phenomenon The story

More information

Introduction. Computer Networks Term B10

Introduction. Computer Networks Term B10 Introduction Computer Networks Term B10 Introduction Outline Preliminary Definitions Internet Components Network Application Paradigms Classifying networks by transmission technology by size/scale by topology

More information

King Fahd University of Petroleum & Minerals Computer Engineering g Dept

King Fahd University of Petroleum & Minerals Computer Engineering g Dept King Fahd University of Petroleum & Minerals Computer Engineering g Dept COE 540 Computer Networks Term 121 Dr. Ashraf S. Hasan Mahmoud Rm 22-420 Ext. 1724 Email: ashraf@kfupm.edu.sa 9/1/2012 Dr. Ashraf

More information

BitTorrent. Masood Khosroshahy. July Tech. Report. Copyright 2009 Masood Khosroshahy, All rights reserved.

BitTorrent. Masood Khosroshahy. July Tech. Report. Copyright 2009 Masood Khosroshahy, All rights reserved. BitTorrent Masood Khosroshahy July 2009 Tech. Report Copyright 2009 Masood Khosroshahy, All rights reserved. www.masoodkh.com Contents Contents 1 Basic Concepts 1 2 Mechanics 3 2.1 Protocols: Tracker and

More information

Extreme Computing. BitTorrent and incentive-based overlay networks.

Extreme Computing. BitTorrent and incentive-based overlay networks. Extreme Computing BitTorrent and incentive-based overlay networks BitTorrent Today we will focus on BitTorrent The technology really has three aspects A standard that BitTorrent client systems follow Some

More information

Review of course COMP-251B winter 2010

Review of course COMP-251B winter 2010 Review of course COMP-251B winter 2010 Lecture 1. Book Section 15.2 : Chained matrix product Matrix product is associative Computing all possible ways of parenthesizing Recursive solution Worst-case running-time

More information

L Modelling and Simulating Social Systems with MATLAB

L Modelling and Simulating Social Systems with MATLAB 851-0585-04L Modelling and Simulating Social Systems with MATLAB Lesson 6 Graphs (Networks) Anders Johansson and Wenjian Yu (with S. Lozano and S. Wehrli) ETH Zürich 2010-03-29 Lesson 6 Contents History:

More information

4/8/11. Single-Source Shortest Path. Shortest Paths. Shortest Paths. Chapter 24

4/8/11. Single-Source Shortest Path. Shortest Paths. Shortest Paths. Chapter 24 /8/11 Single-Source Shortest Path Chapter 1 Shortest Paths Finding the shortest path between two nodes comes up in many applications o Transportation problems o Motion planning o Communication problems

More information

Last Lecture SMTP. SUNY at Buffalo; CSE 489/589 Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 1

Last Lecture SMTP. SUNY at Buffalo; CSE 489/589 Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 1 Last Lecture SMTP SUNY at Buffalo; CSE 489/589 Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 1 This Lecture Peer-to-Peer (P2P) Applications SUNY at Buffalo; CSE 489/589 Modern Networking

More information

1. What is a Computer Network? interconnected collection of autonomous computers connected by a communication technology

1. What is a Computer Network? interconnected collection of autonomous computers connected by a communication technology Review Questions for exam Preparation (22-07-2017) 1. What is a Computer Network? interconnected collection of autonomous computers connected by a communication technology 2. What is the Internet? "network

More information

Analysis of Algorithms

Analysis of Algorithms Second Edition Design and Analysis of Algorithms Prabhakar Gupta Vineet Agarwal Manish Varshney Design and Analysis of ALGORITHMS SECOND EDITION PRABHAKAR GUPTA Professor, Computer Science and Engineering

More information

Introduction. Communication

Introduction. Communication Introduction These slides are created by Dr. Yih Huang of George Mason University. Students registered in Dr. Huang's courses at GMU can make a single machine-readable copy and print a single copy of each

More information

Nick Hamilton Institute for Molecular Bioscience. Essential Graph Theory for Biologists. Image: Matt Moores, The Visible Cell

Nick Hamilton Institute for Molecular Bioscience. Essential Graph Theory for Biologists. Image: Matt Moores, The Visible Cell Nick Hamilton Institute for Molecular Bioscience Essential Graph Theory for Biologists Image: Matt Moores, The Visible Cell Outline Core definitions Which are the most important bits? What happens when

More information

Lecture 18 Solving Shortest Path Problem: Dijkstra s Algorithm. October 23, 2009

Lecture 18 Solving Shortest Path Problem: Dijkstra s Algorithm. October 23, 2009 Solving Shortest Path Problem: Dijkstra s Algorithm October 23, 2009 Outline Lecture 18 Focus on Dijkstra s Algorithm Importance: Where it has been used? Algorithm s general description Algorithm steps

More information

Networks and stability

Networks and stability Networks and stability Part 1A. Network topology www.weaklink.sote.hu csermelypeter@yahoo.com Peter Csermely 1. network topology 2. network dynamics 3. examples for networks 4. synthesis (complex equilibria,

More information

E-Commerce. Infrastructure I: Computer Networks

E-Commerce. Infrastructure I: Computer Networks E-Commerce Infrastructure I: Computer Networks Almost all computers today are networked or part of a distributed system. I will provide an overview of networking and a basic description of network technology.

More information

CS224W: Social and Information Network Analysis Jure Leskovec, Stanford University

CS224W: Social and Information Network Analysis Jure Leskovec, Stanford University CS224W: Social and Information Network Analysis Jure Leskovec, Stanford University http://cs224w.stanford.edu 10/4/2011 Jure Leskovec, Stanford CS224W: Social and Information Network Analysis, http://cs224w.stanford.edu

More information

Applications of Linear Programming

Applications of Linear Programming Applications of Linear Programming lecturer: András London University of Szeged Institute of Informatics Department of Computational Optimization Lecture 6 based on Juraj Stacho s lecture notes ad the

More information

Graph Algorithms (part 3 of CSC 282),

Graph Algorithms (part 3 of CSC 282), Graph Algorithms (part of CSC 8), http://www.cs.rochester.edu/~stefanko/teaching/10cs8 1 Schedule Homework is due Thursday, Oct 1. The QUIZ will be on Tuesday, Oct. 6. List of algorithms covered in the

More information

Mathematics (JUN10MD0101) General Certificate of Education Advanced Subsidiary Examination June Unit Decision TOTAL

Mathematics (JUN10MD0101) General Certificate of Education Advanced Subsidiary Examination June Unit Decision TOTAL Centre Number Candidate Number For Examiner s Use Surname Other Names Candidate Signature Examiner s Initials Mathematics Unit Decision 1 Wednesday 9 June 2010 General Certificate of Education Advanced

More information

Computer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ

Computer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ Computer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ Lecture 5: Network Layer Reference: Chapter 5 - Computer Networks, Andrew S. Tanenbaum, 4th Edition, Prentice Hall, 2003. Contents The

More information

Guide to Networking Essentials, 6 th Edition. Chapter 6: Network Reference Models and Standards

Guide to Networking Essentials, 6 th Edition. Chapter 6: Network Reference Models and Standards Guide to Networking Essentials, 6 th Edition Chapter 6: Network Reference Models and Standards Objectives Explain the OSI reference model layers and their relationship to hardware and software Explain

More information

ECE 333: Introduction to Communication Networks Fall 2001

ECE 333: Introduction to Communication Networks Fall 2001 ECE : Introduction to Communication Networks Fall 00 Lecture : Routing and Addressing I Introduction to Routing/Addressing Lectures 9- described the main components of point-to-point networks, i.e. multiplexed

More information

Data Communication. Introduction of Communication. Data Communication. Elements of Data Communication (Communication Model)

Data Communication. Introduction of Communication. Data Communication. Elements of Data Communication (Communication Model) Data Communication Introduction of Communication The need to communicate is part of man s inherent being. Since the beginning of time the human race has communicated using different techniques and methods.

More information

Peer-to-peer networks: pioneers, self-organisation, small-world-phenomenons

Peer-to-peer networks: pioneers, self-organisation, small-world-phenomenons Peer-to-peer networks: pioneers, self-organisation, small-world-phenomenons Patrick Baier October 10, 2008 Contents 1 Introduction 1 1.1 Preamble.................................... 1 1.2 Definition....................................

More information

Principles of Wireless Sensor Networks. Routing, Zigbee, and RPL

Principles of Wireless Sensor Networks. Routing, Zigbee, and RPL http://www.ee.kth.se/~carlofi/teaching/pwsn-2011/wsn_course.shtml Lecture 8 Stockholm, November 11, 2011 Routing, Zigbee, and RPL Royal Institute of Technology - KTH Stockholm, Sweden e-mail: carlofi@kth.se

More information

SRI VENKATESWARA COLLEGE OF ENGINEERING. COURSE DELIVERY PLAN - THEORY Page 1 of 6

SRI VENKATESWARA COLLEGE OF ENGINEERING. COURSE DELIVERY PLAN - THEORY Page 1 of 6 COURSE DELIVERY PLAN - THEORY Page 1 of 6 Department of Computer Science and Engineering B.E/B.Tech/M.E/M.Tech : B.E(CSE) & B.Tech (IT) Regulation:2016 PG Specialisation : -- : I LP: CS16301 Rev. No: 00

More information

Protocols and Layers. Networked Systems (H) Lecture 2

Protocols and Layers. Networked Systems (H) Lecture 2 Protocols and Layers Networked Systems (H) Lecture 2 This work is licensed under the Creative Commons Attribution-NoDerivatives 4.0 International License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nd/4.0/

More information

Azureus Plugin for Facebook Integration

Azureus Plugin for Facebook Integration Azureus Plugin for Facebook Integration Mike House-Vording, 100300955 mhvordin@connect.carleton.ca 1. Introduction This project seeks to integrate two major trends currently taking place on the internet:

More information

Lecture 10 Graph Algorithms

Lecture 10 Graph Algorithms Lecture 10 Graph Algorithms Euiseong Seo (euiseong@skku.edu) 1 Graph Theory Study of the properties of graph structures It provides us with a language with which to talk about graphs Keys to solving problems

More information

Internet. Class-In charge: S.Sasirekha

Internet. Class-In charge: S.Sasirekha Internet Class-In charge: S.Sasirekha COMPUTER NETWORK A computer network is a collection of two or more computers, which are connected together to share information and resources. Network Operating Systems

More information

Principles of Wireless Sensor Networks

Principles of Wireless Sensor Networks Principles of Wireless Sensor Networks https://www.kth.se/social/course/el2745/ Lecture 6 Routing Carlo Fischione Associate Professor of Sensor Networks e-mail:carlofi@kth.se http://www.ee.kth.se/ carlofi/

More information

Introduction to Algorithms Third Edition

Introduction to Algorithms Third Edition Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein Introduction to Algorithms Third Edition The MIT Press Cambridge, Massachusetts London, England Preface xiü I Foundations Introduction

More information

Principles of Wireless Sensor Networks

Principles of Wireless Sensor Networks Principles of Wireless Sensor Networks www.kth.se/student/program-kurser/kurshemsidor/kurshemsidor/control/el2745 Lecture 6 Stockholm, February 6, 2012 Carlo Fischione Royal Institute of Technology - KTH

More information

MATHEMATICS Unit Decision 1

MATHEMATICS Unit Decision 1 General Certificate of Education June 2008 Advanced Subsidiary Examination MATHEMATICS Unit Decision 1 MD01 Friday 6 June 2008 1.30 pm to 3.00 pm For this paper you must have: an 8-page answer book the

More information

Introduction to Networks (2) Networked Systems 3 Lecture 2

Introduction to Networks (2) Networked Systems 3 Lecture 2 Introduction to Networks (2) Networked Systems 3 Lecture 2 Lecture Outline Network Protocols Protocol Layering OSI Reference Model Protocol Standards 2 Network Protocols Communication occurs when hosts

More information

Taming the Flood: How I Learned to Stop Worrying and Love the Swarm Yogesh Vedpathak Cleversafe

Taming the Flood: How I Learned to Stop Worrying and Love the Swarm Yogesh Vedpathak Cleversafe Taming the Flood: How I Learned to Stop Worrying and Love the Swarm Yogesh Vedpathak Cleversafe Topics Popular data Creating broadcasting storage system Bittorrent protocol Creating swarms and destroying

More information

Condensed. Mathematics. General Certificate of Education Advanced Subsidiary Examination June Unit Decision 1. Time allowed * 1 hour 30 minutes

Condensed. Mathematics. General Certificate of Education Advanced Subsidiary Examination June Unit Decision 1. Time allowed * 1 hour 30 minutes General Certificate of Education Advanced Subsidiary Examination June 2010 Mathematics MD01 Unit Decision 1 Wednesday 9 June 2010 1.30 pm to 3.00 pm For this paper you must have: the blue AQA booklet of

More information

MEI Further Mathematics Support Programme

MEI Further Mathematics Support Programme Further Mathematics Support Programme the Further Mathematics Support Programme www.furthermaths.org.uk Modelling and problem solving with Networks Sharon Tripconey Let Maths take you Further Nov 2009

More information

Chapter 1: Introduction

Chapter 1: Introduction EE4272: Computer Networks Chapter 1: Introduction Instructor: Tricia Chigan Dept.: Elec. & Comp. Eng. 1) Data Communications: Deals with the transmission of signals in a reliable & efficient manner. Topics:

More information

Chapter 15 Networks. Chapter Goals. Networking. Chapter Goals. Networking. Networking. Computer network. Node (host) Any device on a network

Chapter 15 Networks. Chapter Goals. Networking. Chapter Goals. Networking. Networking. Computer network. Node (host) Any device on a network Chapter Goals Chapter 15 Networks Describe the core issues related to computer networks List various types of networks and their characteristics Explain various topologies of local-area networks Explain

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

COMS Introduction to Computers. Networking

COMS Introduction to Computers. Networking COMS 1001 Introduction to Computers Networking What's Ahead Networking layers Network Speeds Protocols, sockets, client/server Routing, DNS, Ethernet, LANs, wireless What is a Network? Loose definition:

More information

CS201 Design and Analysis of Algorithms Max.Marks:75

CS201 Design and Analysis of Algorithms Max.Marks:75 Syllabus for M.Sc. Computer Science Programme Semester II CS 201 Design and Analysis of Algorithms 100 ( 75 + 25 ) CS 202 Data Communication and Computer Network 100 ( 75 + 25 ) CS 203 Optimization Techniques

More information

P2P Applications. Reti di Elaboratori Corso di Laurea in Informatica Università degli Studi di Roma La Sapienza Canale A-L Prof.ssa Chiara Petrioli

P2P Applications. Reti di Elaboratori Corso di Laurea in Informatica Università degli Studi di Roma La Sapienza Canale A-L Prof.ssa Chiara Petrioli P2P Applications Reti di Elaboratori Corso di Laurea in Informatica Università degli Studi di Roma La Sapienza Canale A-L Prof.ssa Chiara Petrioli Server-based Network Peer-to-peer networks A type of network

More information

1. Let n and m be positive integers with n m. a. Write the inclusion/exclusion formula for the number S(n, m) of surjections from {1, 2,...

1. Let n and m be positive integers with n m. a. Write the inclusion/exclusion formula for the number S(n, m) of surjections from {1, 2,... MATH 3012, Quiz 3, November 24, 2015, WTT Student Name and ID Number 1. Let n and m be positive integers with n m. a. Write the inclusion/exclusion formula for the number S(n, m) of surjections from {1,

More information

Standard 2: Problem Solving

Standard 2: Problem Solving Unit 2 Day 17 Standard 2: Problem Solving Objective 1: Students will be given opportunities to become "computational thinkers" by applying a variety of problem-solving techniques as they create solutions

More information

Basics of datacommunication

Basics of datacommunication Data communication I Lecture 1 Course Introduction About the course Basics of datacommunication How is information transported between digital devices? Essential data communication protocols Insight into

More information

Graph Theory and Applications

Graph Theory and Applications Graph Theory and Applications with Exercises and Problems Jean-Claude Fournier WILEY Table of Contents Introduction 17 Chapter 1. Basic Concepts 21 1.1 The origin of the graph concept 21 1.2 Definition

More information

networks List various types of networks and their

networks List various types of networks and their Chapter 15 Networks Chapter Goals Describe the core issues related to computer networks List various types of networks and their characteristics Explain various topologies of local-area networks Explain

More information

Lecture 19 Shortest Path vs Spanning Tree Max-Flow Problem. October 25, 2009

Lecture 19 Shortest Path vs Spanning Tree Max-Flow Problem. October 25, 2009 Shortest Path vs Spanning Tree Max-Flow Problem October 25, 2009 Outline Lecture 19 Undirected Network Illustration of the difference between the shortest path tree and the spanning tree Modeling Dilemma:

More information

P2P. 1 Introduction. 2 Napster. Alex S. 2.1 Client/Server. 2.2 Problems

P2P. 1 Introduction. 2 Napster. Alex S. 2.1 Client/Server. 2.2 Problems P2P Alex S. 1 Introduction The systems we will examine are known as Peer-To-Peer, or P2P systems, meaning that in the network, the primary mode of communication is between equally capable peers. Basically

More information

COMPUTER NETWORKING. By: Dr. Noor Dayana Abd Halim

COMPUTER NETWORKING. By: Dr. Noor Dayana Abd Halim COMPUTER NETWORKING By: Dr. Noor Dayana Abd Halim Defining Computer Network Computer network is a collection of computers and other hardware devices so that network users can share hardware, software,

More information

Network Models. Behrouz A. Forouzan Data communication and Networking Fourth edition

Network Models. Behrouz A. Forouzan Data communication and Networking Fourth edition Chapter 2 Network Models Behrouz A. Forouzan Data communication and Networking Fourth edition 1 Layered Tasks We use the concept of layers in our daily life. As an example, let us consider two friends

More information

Multimedia Networking

Multimedia Networking Multimedia Networking Victor Gau Information Processing Lab. 2008/03/07 Outline Introduction Network Basics Quality of Service Applications VoIP IPTV Telematics Multimedia Multimedia (Lat. Multum + Medium)

More information

Communicating over the Network

Communicating over the Network Communicating over the Network Network Fundamentals Chapter 2 1 Objectives Describe the structure of a network, including the devices and media that are necessary for successful communications. Explain

More information

CHAPTER -1. Introduction to Computer Networks

CHAPTER -1. Introduction to Computer Networks CHAPTER -1 Introduction to Computer Networks PRELIMINARY DEFINITIONS computer network :: [Tanenbaum] a collection of autonomous computers interconnected by a single technology. communications network ::a

More information

Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest. Introduction to Algorithms

Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest. Introduction to Algorithms Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Introduction to Algorithms Preface xiii 1 Introduction 1 1.1 Algorithms 1 1.2 Analyzing algorithms 6 1.3 Designing algorithms 1 1 1.4 Summary 1 6

More information

SUGGESTION : read all the questions and their values before you start.

SUGGESTION : read all the questions and their values before you start. Faculty of Science Final Examination Computer Science 308-251B Examiner: Prof. Claude Crépeau Date: April 30, 2010 Associate Examiner: Prof. Patrick Hayden Time: 09:00 12:00 INSTRUCTIONS: This examination

More information

Networking and Health Information Exchange: ISO Open System Interconnection (OSI)

Networking and Health Information Exchange: ISO Open System Interconnection (OSI) Networking and Health Information Exchange: ISO Open System Interconnection (OSI) Lecture 4 Audio Transcript Slide 1 Welcome to Networking and Health Information Exchange, ISO Open System Interconnection

More information

Peer to Peer Systems and Probabilistic Protocols

Peer to Peer Systems and Probabilistic Protocols Distributed Systems 600.437 Peer to Peer Systems & Probabilistic Protocols Department of Computer Science The Johns Hopkins University 1 Peer to Peer Systems and Probabilistic Protocols Lecture 11 Good

More information

31270 Networking Essentials Focus, Pre-Quiz, and Sample Exam Answers

31270 Networking Essentials Focus, Pre-Quiz, and Sample Exam Answers 31270 Networking Essentials Focus, Pre-Quiz, and Sample Exam Answers CONTENTS Focus Questions... 2 Chapter 1: Explore the Network... 2 Chapter 2: Configure a Network Operating System... 5 Chapter 3: Network

More information

Lecture 17: Peer-to-Peer System and BitTorrent

Lecture 17: Peer-to-Peer System and BitTorrent CSCI-351 Data communication and Networks Lecture 17: Peer-to-Peer System and BitTorrent (I swear I only use it for Linux ISOs) The slide is built with the help of Prof. Alan Mislove, Christo Wilson, and

More information

Introduction to P P Networks

Introduction to P P Networks Introduction to P P Networks B Sc Florian Adamsky florianadamsky@iemthmde http://florianadamskyit/ cbd Internet Protocols and Applications SS B Sc Florian Adamsky IPA / Outline Introduction What is P P?

More information

Math/Stat 2300 Modeling using Graph Theory (March 23/25) from text A First Course in Mathematical Modeling, Giordano, Fox, Horton, Weir, 2009.

Math/Stat 2300 Modeling using Graph Theory (March 23/25) from text A First Course in Mathematical Modeling, Giordano, Fox, Horton, Weir, 2009. Math/Stat 2300 Modeling using Graph Theory (March 23/25) from text A First Course in Mathematical Modeling, Giordano, Fox, Horton, Weir, 2009. Describing Graphs (8.2) A graph is a mathematical way of describing

More information

CAD Algorithms. Categorizing Algorithms

CAD Algorithms. Categorizing Algorithms CAD Algorithms Categorizing Algorithms Mohammad Tehranipoor ECE Department 2 September 2008 1 Categorizing Algorithms Greedy Algorithms Prim s Algorithm (Minimum Spanning Tree) A subgraph that is a tree

More information

6 Computer Networks 6.1. Foundations of Computer Science Cengage Learning

6 Computer Networks 6.1. Foundations of Computer Science Cengage Learning 6 Computer Networks 6.1 Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: 6.2 Describe network criteria, physical structures and categories

More information

Communicating over the Network. Network Fundamentals. ITE PC v4.0 Chapter Cisco Systems, Inc. All rights reserved.

Communicating over the Network. Network Fundamentals. ITE PC v4.0 Chapter Cisco Systems, Inc. All rights reserved. Communicating over the Network Network Fundamentals 1 Network Structure Define e the components of a network Network components hardware software 2 Network Structure End Devices and their Role in the Network

More information

CSE 373: Data Structures and Algorithms

CSE 373: Data Structures and Algorithms CSE 373: Data Structures and Algorithms Lecture 21: Finish Sorting, P vs NP Instructor: Lilian de Greef Quarter: Summer 2017 Today Announcements Finish up sorting Radix Sort Final comments on sorting Complexity

More information

Introduction to Computer Networks INTRODUCTION TO COMPUTER NETWORKS

Introduction to Computer Networks INTRODUCTION TO COMPUTER NETWORKS INTRODUCTION TO COMPUTER NETWORKS Computer Networks Computer network connects two or more autonomous computers. The computers can be geographically located anywhere. LAN, MAN & WAN Network in small geographical

More information

RANDOM-REAL NETWORKS

RANDOM-REAL NETWORKS RANDOM-REAL NETWORKS 1 Random networks: model A random graph is a graph of N nodes where each pair of nodes is connected by probability p: G(N,p) Random networks: model p=1/6 N=12 L=8 L=10 L=7 The number

More information

CCNA 1: Chapter 2 Exam Answer v %

CCNA 1: Chapter 2 Exam Answer v % 1. Refer to the exhibit. Cell A at IP address 10.0.0.34 has established an IP session with IP Phone 1? at IP address 172.16.1.103. Based upon the graphic, which device type best describes the function

More information

EEC-484/584 Computer Networks

EEC-484/584 Computer Networks EEC-484/584 Computer Networks Lecture 1 Department of Electrical and Computer Engineering Cleveland State University wenbing@ieee.org (Lecture nodes are based on materials supplied by Dr. Louise Moser

More information

1 Q1. Attempt any THREE 09 1 Give the difference between Human Network and

1 Q1. Attempt any THREE 09 1 Give the difference between Human Network and Sanjivani Rural Education Society s CLASS-TEST-I YEAR:- 2015-16 SANJIVANI K.B.P.POLYTECHNIC, KOPARGAON Model Answer Sub:- Computer Network Sub. Code:- 17429 Class :- Div:- A & B SYCM Dept. :- Computer

More information

Student Name and ID Number. MATH 3012, Quiz 3, April 16, 2018, WTT

Student Name and ID Number. MATH 3012, Quiz 3, April 16, 2018, WTT MATH 3012, Quiz 3, April 16, 2018, WTT Student Name and ID Number 1. A graph with weights on edges is shown below. In the space to the right of the figure, list in order the edges which make up a minimum

More information

Graph Algorithms. A Brief Introduction. 高晓沨 (Xiaofeng Gao) Department of Computer Science Shanghai Jiao Tong Univ.

Graph Algorithms. A Brief Introduction. 高晓沨 (Xiaofeng Gao) Department of Computer Science Shanghai Jiao Tong Univ. Graph Algorithms A Brief Introduction 高晓沨 (Xiaofeng Gao) Department of Computer Science Shanghai Jiao Tong Univ. 目录 2015/5/7 1 Graph and Its Applications 2 Introduction to Graph Algorithms 3 References

More information

VISUAL SUMMARY COMMUNICATION CHANNELS COMMUNICATIONS. Communications and Networks

VISUAL SUMMARY COMMUNICATION CHANNELS COMMUNICATIONS. Communications and Networks Rev.Confirming Pages VISUAL SUMMARY Communications and Networks COMMUNICATIONS COMMUNICATION CHANNELS Communications is the process of sharing data, programs, and information between two or more computers.

More information

SECURED SOCIAL TUBE FOR VIDEO SHARING IN OSN SYSTEM

SECURED SOCIAL TUBE FOR VIDEO SHARING IN OSN SYSTEM ABSTRACT: SECURED SOCIAL TUBE FOR VIDEO SHARING IN OSN SYSTEM J.Priyanka 1, P.Rajeswari 2 II-M.E(CS) 1, H.O.D / ECE 2, Dhanalakshmi Srinivasan Engineering College, Perambalur. Recent years have witnessed

More information

Graph Algorithms (part 3 of CSC 282),

Graph Algorithms (part 3 of CSC 282), Graph Algorithms (part of CSC 8), http://www.cs.rochester.edu/~stefanko/teaching/11cs8 Homework problem sessions are in CSB 601, 6:1-7:1pm on Oct. (Wednesday), Oct. 1 (Wednesday), and on Oct. 19 (Wednesday);

More information

CS 3516: Advanced Computer Networks

CS 3516: Advanced Computer Networks Welcome to CS 3516: Advanced Computer Networks Prof. Yanhua Li Time: 9:00am 9:50am M, T, R, and F Location: Fuller 320 Fall 2017 A-term 1 Some slides are originally from the course materials of the textbook

More information

Department of Computer Science Institute for System Architecture, Chair for Computer Networks. File Sharing

Department of Computer Science Institute for System Architecture, Chair for Computer Networks. File Sharing Department of Computer Science Institute for System Architecture, Chair for Computer Networks File Sharing What is file sharing? File sharing is the practice of making files available for other users to

More information

Wireless Networks (CSC-7602) Lecture 1 (27 Aug 2007)

Wireless Networks (CSC-7602) Lecture 1 (27 Aug 2007) Wireless Networks (CSC-7602) Lecture 1 (27 Aug 2007) Seung-Jong Park (Jay) http://www.csc.lsu.edu/~sjpark 1 Handouts Class information Schedule (check online frequently) 2 1 Goals Principles on Wireless

More information

Pervasive and Mobile Computing. Dr. Atiq Ahmed. Introduction Network Definitions Network Technologies Network Functions 1/38

Pervasive and Mobile Computing. Dr. Atiq Ahmed. Introduction Network Definitions Network Technologies Network Functions 1/38 Department of Computer Science & Information Technology University of Balochistan Course Objectives To discuss the fundamental problems in the emerging area of mobile and pervasive computing, along with

More information

Introduction to the Special Issue on AI & Networks

Introduction to the Special Issue on AI & Networks Introduction to the Special Issue on AI & Networks Marie desjardins, Matthew E. Gaston, and Dragomir Radev March 16, 2008 As networks have permeated our world, the economy has come to resemble an ecology

More information

Introduction to Network Technologies & Layered Architecture BUPT/QMUL

Introduction to Network Technologies & Layered Architecture BUPT/QMUL Introduction to Network Technologies & Layered Architecture BUPT/QMUL 2015-3-5 Review What is the Internet? How does it work? When & how did it come about? Who controls it? Where is it going? 2 Agenda

More information

CSE 373: Data Structures and Algorithms

CSE 373: Data Structures and Algorithms CSE 373: Data Structures and Algorithms Lecture 21: Finish Sorting, P vs NP Instructor: Lilian de Greef Quarter: Summer 2017 Today Announcements Finish up sorting Radix Sort Final comments on sorting Complexity

More information

P2P content distribution

P2P content distribution P2P content distribution T-110.7100 Applications and Services in Internet, Fall 2010 Jukka K. Nurminen 1 V1-Filename.ppt / yyyy-mm-dd / Initials Steps of content sharing Share content Find content Transfer

More information

416 Distributed Systems. Mar 3, Peer-to-Peer Part 2

416 Distributed Systems. Mar 3, Peer-to-Peer Part 2 416 Distributed Systems Mar 3, Peer-to-Peer Part 2 Scaling Problem Millions of clients server and network meltdown 2 P2P System Leverage the resources of client machines (peers) Traditional: Computation,

More information

Client Server and Parallel Programming

Client Server and Parallel Programming Client Server and Parallel Programming 31666 Spring 2013, Ort Braude College Electrical Engineering Department 1 1 Course Program Lecturer: Dr. Samy Zafrany Credits: 5.0 Hours: 3 lecture, 2 laboratory

More information

Department of Computer Applications. MCA 312: Design and Analysis of Algorithms. [Part I : Medium Answer Type Questions] UNIT I

Department of Computer Applications. MCA 312: Design and Analysis of Algorithms. [Part I : Medium Answer Type Questions] UNIT I MCA 312: Design and Analysis of Algorithms [Part I : Medium Answer Type Questions] UNIT I 1) What is an Algorithm? What is the need to study Algorithms? 2) Define: a) Time Efficiency b) Space Efficiency

More information

Small-World Models and Network Growth Models. Anastassia Semjonova Roman Tekhov

Small-World Models and Network Growth Models. Anastassia Semjonova Roman Tekhov Small-World Models and Network Growth Models Anastassia Semjonova Roman Tekhov Small world 6 billion small world? 1960s Stanley Milgram Six degree of separation Small world effect Motivation Not only friends:

More information

We have already seen the transportation problem and the assignment problem. Let us take the transportation problem, first.

We have already seen the transportation problem and the assignment problem. Let us take the transportation problem, first. Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 19 Network Models In this lecture, we will discuss network models. (Refer

More information

Model Answer. Section A Q.1 - (20 1=10) B.Tech. (Fifth Semester) Examination Analysis and Design of Algorithm (IT3105N) (Information Technology)

Model Answer. Section A Q.1 - (20 1=10) B.Tech. (Fifth Semester) Examination Analysis and Design of Algorithm (IT3105N) (Information Technology) B.Tech. (Fifth Semester) Examination 2013 Analysis and Design of Algorithm (IT3105N) (Information Technology) Model Answer. Section A Q.1 - (20 1=10) 1. Merge Sort uses approach to algorithm design. Ans:

More information

Examples of Complex Networks

Examples of Complex Networks Examples of Complex Networks Neural Network (C. Elegans) http://gephi.org/wp-content/uploads/2008/12/screenshot-celegans.png Food Web http://1.bp.blogspot.com/_vifbm3t8bou/sbhzqbchiei/aaaaaaaaaxk/rsc-

More information

Networking. Bin Li Assistant Professor Dept. of Electrical, Computer and Biomedical Engineering University of Rhode Island

Networking. Bin Li Assistant Professor Dept. of Electrical, Computer and Biomedical Engineering University of Rhode Island Networking Bin Li Assistant Professor Dept. of Electrical, Computer and Biomedical Engineering University of Rhode Island Why is Networking Needed? To enhance many devices Cars communicating to reduce

More information