Lecture 5: Internetworking: A closer View By Dr. Najla Al-Nabhan Introduction 1-1.

Slides:



Advertisements
Similar presentations
Introduction 2 1: Introduction.
Advertisements

CS 381 Introduction to computer networks Lecture 2 1/29/2015.
James 1:5 If any of you lacks wisdom, he should ask God, who gives generously to all without finding fault, and it will be given to him.
CS 381 Introduction to computer networks Chapter 1 - Lecture 3 2/5/2015.
Introduction© Dr. Ayman Abdel-Hamid, CS4254 Spring CS4254 Computer Network Architecture and Programming Dr. Ayman A. Abdel-Hamid Computer Science.
Chapter 4 Network Layer slides are modified from J. Kurose & K. Ross CPE 400 / 600 Computer Communication Networks Lecture 14.
Lecture 2 Introduction 1-1 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit.
10 - Network Layer. Network layer r transport segment from sending to receiving host r on sending side encapsulates segments into datagrams r on rcving.
Chapter 4 Network Layer slides are modified from J. Kurose & K. Ross CPE 400 / 600 Computer Communication Networks Lecture 13.
1-1 Foundation Objectives: 1.1 What’s the Internet? 1.2 Network edge 1.3 Network core 1.4 Network access and physical media 1.5 Internet structure and.
Lecture Internet Overview: roadmap 1.1 What is the Internet? (A simple overview last week) Today, A closer look at the Internet structure! 1.2 Network.
Lecture Internet Overview: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit switching,
Lecture Internet Overview: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit switching,
Lecture 1 Overview: roadmap 1.1 What is computer network? the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  network.
What’s the Internet: “nuts and bolts” view
1: Introduction1 Part I: Introduction Goal: r get context, overview, “feel” of networking r more depth, detail later in course r approach: m descriptive.
Introduction A closer look at network structure: network edge: – hosts: clients and servers – servers often in data centers  access networks, physical.
Introduction 1-1 Lecture 3 Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 CS3516: These slides.
Introduction 1-1 Chapter 1 Introduction Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 A note on.
CS671 Advanced Computer Networking Chen Qian Fall 2014 Introduction CQ (2014) 1-1.
1 Computer Communication & Networks Lecture 4 Circuit Switching, Packet Switching, Delays Waleed.
RSC Part I: Introduction Redes y Servicios de Comunicaciones Universidad Carlos III de Madrid These slides are, mainly, part of the companion slides to.
Adapted from: Computer Networking, Kurose/Ross 1-1 1DT066 Distributed Information Systems Chapter 1 Introduction.
Introduction 1-1 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit switching,
Slides originally from Professor Williamson at U Calgary1-1 Introduction Part II  Network Core  Delay & Loss in Packet-switched Networks  Structure.
Introduction 1-1 Chapter 1 Part 2 Network Core These slides derived from Computer Networking: A Top Down Approach, 6 th edition. Jim Kurose, Keith Ross.
Instructor: Christopher Cole Some slides taken from Kurose & Ross book IT 347: Chapter 1.
Introduction1-1 Course Code:EE/TE533 Instructor: Muddathir Qamar.
Network Layer4-1 Chapter 4: Network Layer Chapter goals: r understand principles behind network layer services: m network layer service models m forwarding.
Introduction 1-1 Chapter 1 Introduction Computer Networking: A Top Down Approach, 5 th edition. Jim Kurose, Keith Ross Addison-Wesley, April 2009.
Introduction Switches and Access. 2 Chapter 1 Introduction Computer Networking: A Top Down Approach Featuring the Internet, 5 rd edition. Jim.
Chapter 4 Network Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 Network Layer introduction.
Chapter 4 Network Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 A note on the use of these.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
Chapter 1 Introduction Circuit/Packet Switching Protocols Computer Networking: A Top Down Approach, 5 th edition. Jim Kurose, Keith Ross Addison-Wesley,
Introduction Chapter 1: roadmap 1.1 what is the Internet? 1.2 network edge  end systems, access networks, links 1.3 network core  packet switching, circuit.
RSC Part I: Introduction Redes y Servicios de Comunicaciones Universidad Carlos III de Madrid These slides are, mainly, part of the companion slides to.
Introduction to Computer Networks
Introduction1-1 Chapter 1 Computer Networks and the Internet Computer Networking: A Top Down Approach Featuring the Internet, 2 nd edition. Jim Kurose,
Lecture 1: Overview of Internet Architecture Communication Networks ELEN E6761 Instructor: Javad Ghaderi Lecture Slides adapted from “Computer Networking:
1 Network Core and Network Edge By Muhammad Hanif To BS IT 4 th Semester.
1 Computer Networks & The Internet Lecture 4 Imran Ahmed University of Management & Technology.
CS 3830 Day 4 Introduction 1-1. Announcements  No office hour 12pm-1pm today only  Quiz on Friday  Program 1 due on Friday (put in DropBox on S drive)
Forwarding.
EEC-484/584 Computer Networks
Chapter 1 Introduction Computer Networking: A Top Down Approach 6th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 A note on the use of these.
Ch 1. Computer Networks and the Internet Myungchul Kim
Introduction1-1 Computer Network (  Instructor  Ai-Chun Pang 逄愛君, m Office Number: 417  Textbook.
CSE 413: Computer Network Circuit Switching and Packet Switching Networks Md. Kamrul Hasan
Lecture 2: Internet Structure & Internetworking By Dr. Najla Al-Nabhan edited by Maysoon Al Duwais Introduction 1-1.
Introduction1-1 Data Communications and Computer Networks Chapter 1 CS 3830 Lecture 2 Omar Meqdadi Department of Computer Science and Software Engineering.
Introduction 1-1 1DT057 Distributed Information Systems Chapter 1 Introduction.
A special acknowledge goes to J.F Kurose and K.W. Ross Some of the slides used in this lecture are adapted from their original slides that accompany the.
Lecture # 3: WAN Data Communication Network L.Rania Ahmed Tabeidi.
@Yuan Xue A special acknowledge goes to J.F Kurose and K.W. Ross Some of the slides used in this lecture are adapted from their.
A special acknowledge goes to J.F Kurose and K.W. Ross Some of the slides used in this lecture are adapted from their original slides that accompany the.
CSEN 404 Introduction to Networks Amr El Mougy Lamia AlBadrawy.
Introduction1-1 Data Communications and Computer Networks Chapter 1 CS 3830 Lecture 3 Omar Meqdadi Department of Computer Science and Software Engineering.
A special acknowledge goes to J.F Kurose and K.W. Ross Some of the slides used in this lecture are adapted from their original slides that accompany the.
Computer Networks Dr. Adil Yousif CS Lecture 1.
Graciela Perera Introduction Graciela Perera
Introduction to Networks
Part 0: Networking Review
Chapter 1: Introduction
CS4470 Computer Networking Protocols
Lecture 2: Internet Structure & Internetworking
Comp 365 Computer Networks Chapter 1 Part 2 Network Core Fall 2014
EEC-484/584 Computer Networks
Chapter 1 Introduction Computer Networking: A Top Down Approach
Presentation transcript:

Lecture 5: Internetworking: A closer View By Dr. Najla Al-Nabhan Introduction 1-1

Introduction Outlines Review previous lecture: Internet? network edge  end systems, access networks, links network core  packet switching, circuit switching, network structure Packet-switching vs. circuit-switching delay, loss, throughput in networks protocol layers, service models 1-2

Introduction What’s the Internet: “nuts and bolts” view  millions of connected computing devices:  hosts = end systems  running network apps  communication links  fiber, copper, radio, satellite  transmission rate: bandwidth  Packet switches: forward packets (chunks of data)  routers and switches wired links wireless links router mobile network global ISP regional ISP home network institutional network smartphone PC server wireless laptop 1-3

Introduction a human protocol and a computer network protocol: Q: other human protocols? Hi Got the time? 2:00 TCP connection response Get time TCP connection request What’s a protocol? 1-4

Introduction A closer look at network structure:  network edge:  hosts: clients and servers  servers often in data centers  access networks, physical media: wired, wireless communication links  network core:  interconnected routers  network of networks mobile network global ISP regional ISP home network institutional network 1-5

Introduction Access net: home network to/from headend or central office cable or DSL modem router, firewall, NAT wired Ethernet (100 Mbps) wireless access point (54 Mbps) wireless devices often combined in single box 1-6

Introduction Enterprise access networks (Ethernet)  typically used in companies, universities, etc  10 Mbps, 100Mbps, 1Gbps, 10Gbps transmission rates  today, end systems typically connect into Ethernet switch Ethernet switch institutional mail, web servers institutional router institutional link to ISP (Internet) 1-7

Host: sends packets of data host sending function:  takes application message  breaks into smaller chunks, known as packets, of length L bits  transmits packet into access network at transmission rate R R: link transmission rate host 1 2 two packets, L bits each packet transmission delay time needed to transmit L-bit packet into link L (bits) R (bits/sec) = = 1-8

Introduction  mesh of interconnected routers  packet-switching: hosts break application-layer messages into packets  forward packets from one router to the next, across links on path from source to destination  each packet transmitted at full link capacity Packet-switching 1-9

Introduction Packet-switching: store-and-forward  takes L/R seconds to transmit (push out) L-bit packet into link at R bps  store and forward: entire packet must arrive at router before it can be transmitted on next link more on delay shortly … 1-10 source R bps destination L bits per packet R bps  end-end delay = 2L/R (assuming zero propagation delay)

Introduction Packet Switching: queueing delay, loss A B C R = 100 Mb/s R = 1.5 Mb/s D E queue of packets waiting for output link 1-11 queuing and loss:  If arrival rate (in bits) to link exceeds transmission rate of link for a period of time:  packets will queue, wait to be transmitted on link  packets can be dropped (lost) if memory (buffer) fills up

Network Layer 4-12 Two key network-core functions forwarding : move packets from router’s input to appropriate router output routing: determines source- destination route taken by packets  routing algorithms routing algorithm local forwarding table header value output link dest address in arriving packet’s header

Introduction Alternative core: circuit switching end-end resources allocated to, reserved for “call” between source & dest:  In diagram, each link has four circuits.  call gets 2 nd circuit in top link and 1 st circuit in right link.  dedicated resources: no sharing  circuit-like (guaranteed) performance  circuit segment idle if not used by call (no sharing)  Commonly used in traditional telephone networks 1-13

Introduction Circuit switching: FDM versus TDM FDM frequency time TDM frequency time 4 users Example: 1-14

Introduction Packet switching versus circuit switching example:  1 Mb/s link  each user: 100 kb/s when “active” active 10% of time  circuit-switching:  10 users  packet switching:  with 35 users, probability > 10 active at same time is less than.0004 * packet switching allows more users to use network! N users 1 Mbps link Q: how did we get value ? Q: what happens if > 35 users ? … * Check out the online interactive exercises for more examples

Introduction  great for bursty data  resource sharing  simpler, no call setup  excessive congestion possible: packet delay and loss  protocols needed for reliable data transfer, congestion control  Q: How to provide circuit-like behavior?  bandwidth guarantees needed for audio/video apps  still an unsolved problem (chapter 7) packet switching Q: human analogies of reserved resources (circuit switching) versus on-demand allocation (packet-switching)? Packet switching versus circuit switching 1-16

Internet structure: network of networks Question: given millions of access ISPs, how to connect them together? access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net … … … … … …

Internet structure: network of networks Option: connect each access ISP to every other access ISP? access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net … … … … … … … … … … … connecting each access ISP to each other directly doesn’t scale: O(N 2 ) connections.

Internet structure: network of networks access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net … … … … … … Option: connect each access ISP to a global transit ISP? Customer and provider ISPs have economic agreement. global ISP

Internet structure: network of networks access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net … … … … … … … and regional networks may arise to connect access nets to ISPS ISP B ISP A ISP C IXP regional net

Internet structure: network of networks access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net access net … … … … … … … and content provider networks (e.g., Google, Microsoft, Akamai ) may run their own network, to bring services, content close to end users ISP B ISP A ISP B IXP regional net Content provider network

Introduction Internet structure: network of networks  at center: small # of well-connected large networks  “tier-1” commercial ISPs (e.g., Level 3, Sprint, AT&T, NTT), national & international coverage  content provider network (e.g, Google): private network that connects it data centers to Internet, often bypassing tier-1, regional ISPs 1-22 access ISP access ISP access ISP access ISP access ISP access ISP access ISP access ISP Regional ISP IXP Tier 1 ISP Google IXP

Introduction Tier-1 ISP: e.g., Sprint … to/from customers peering to/from backbone … … … … POP: point-of-presence 1-23

Introduction How do loss and delay occur? packets queue in router buffers  packet arrival rate to link (temporarily) exceeds output link capacity  packets queue, wait for turn A B packet being transmitted (delay) packets queueing (delay) free (available) buffers: arriving packets dropped (loss) if no free buffers 1-24

Introduction Four sources of packet delay d proc : nodal processing  check bit errors  determine output link  typically < msec A B propagation transmission nodal processing queueing d queue : queueing delay  time waiting at output link for transmission  depends on congestion level of router d nodal = d proc + d queue + d trans + d prop 1-25

Introduction d trans : transmission delay:  L: packet length (bits)  R: link bandwidth (bps)  d trans = L/R d prop : propagation delay:  d: length of physical link  s: propagation speed in medium (~2x10 8 m/sec)  d prop = d/s d trans and d prop very different Four sources of packet delay propagation nodal processing queueing d nodal = d proc + d queue + d trans + d prop 1-26 A B transmission * Check out the Java applet for an interactive animation on trans vs. prop delay

Introduction Packet loss  queue (buffer) preceding link in buffer has finite capacity  packet arriving to full queue dropped (lost)  lost packet may be retransmitted by previous node, by source end system, or not at all A B packet being transmitted packet arriving to full buffer is lost buffer (waiting area) 1-27 * Check out the Java applet for an interactive animation on queuing and loss

Introduction Throughput  throughput: rate (bits/time unit) at which bits transferred between sender/receiver  instantaneous: rate at given point in time  average: rate over longer period of time server, with file of F bits to send to client link capacity R s bits/sec link capacity R c bits/sec server sends bits (fluid) into pipe pipe that can carry fluid at rate R s bits/sec) pipe that can carry fluid at rate R c bits/sec) 1-28

Introduction Internet protocol stack  application: supporting network applications  FTP, SMTP, HTTP  transport: process-process data transfer  TCP, UDP  network: routing of datagrams from source to destination  IP, routing protocols  link: data transfer between neighboring network elements  Ethernet, (WiFi), PPP  physical: bits “on the wire” application transport network link physical 1-29

Introduction source application transport network link physical HtHt HnHn M segment HtHt datagram destination application transport network link physical HtHt HnHn HlHl M HtHt HnHn M HtHt M M network link physical link physical HtHt HnHn HlHl M HtHt HnHn M HtHt HnHn M HtHt HnHn HlHl M router switch Encapsulation message M HtHt M HnHn frame 1-30

Network Layer 4-31 Network layer  transport segment from sending to receiving host  on sending side encapsulates segments into datagrams  on receiving side, delivers segments to transport layer  network layer protocols in every host, router  router examines header fields in all IP datagrams passing through it application transport network data link physical application transport network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical

Network Layer 4-32 Two key network-layer functions  forwarding: move packets from router’s input to appropriate router output  routing: determine route taken by packets from source to dest.  routing algorithms analogy:  routing: process of planning trip from source to dest  forwarding: process of getting through single interchange

Network Layer value in arriving packet’s header routing algorithm local forwarding table header value output link Interplay between routing and forwarding routing algorithm determines end-end-path through network forwarding table determines local forwarding at this router

Network Layer 4-34 Connection setup  3 rd important function in some network architectures:  ATM, frame relay, X.25  before datagrams flow, two end hosts and intervening routers establish virtual connection  routers get involved  network vs transport layer connection service:  network: between two hosts (may also involve intervening routers in case of VCs)  transport: between two processes

Network Layer 4-35 Network service model Q: What service model for “channel” transporting datagrams from sender to receiver? example services for individual datagrams:  guaranteed delivery  guaranteed delivery with less than 40 msec delay example services for a flow of datagrams:  in-order datagram delivery  guaranteed minimum bandwidth to flow  restrictions on changes in inter-packet spacing

Network Layer 4-36 Network layer service models: Network Architecture Internet ATM Service Model best effort CBR VBR ABR UBR Bandwidth none constant rate guaranteed rate guaranteed minimum none Loss no yes no Order no yes Timing no yes no Congestion feedback no (inferred via loss) no congestion no congestion yes no Guarantees ?

Next Lecture Introduction 2-37 Midterm 1