1 / 20

Internet Overview: roadmap

Internet Overview: roadmap. 1.1 What is the Internet? 1.2 Network edge end systems, access networks, links 1.3 Network core circuit switching, packet switching 1.4 Delay, loss and throughput in Internet 1.5 Protocol layers, service models 1.6 Networks under attack: security.

senona
Download Presentation

Internet Overview: roadmap

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Internet Overview: roadmap 1.1 What is the Internet? 1.2 Network edge • end systems, access networks, links 1.3 Network core • circuit switching, packet switching 1.4 Delay, loss and throughput in Internet 1.5 Protocol layers, service models 1.6 Networks under attack: security Lecture 2

  2. Quick Recap… • Hardware view of Internet • Components of Internet • Structural view • Client-server model • Peer-to-peer model Lecture 2

  3. Internet: mesh of interconnected routers How is data transferred through net? circuit switching: dedicated circuit per call: telephone net packet-switching: data sent thru net in discrete “chunks” The Network Core Lecture 2

  4. End-end resources reserved for “call” dedicated bandwidth resources: no sharing circuit-like (guaranteed) performance call setup required Network Core: Circuit Switching Lecture 2

  5. Total network resources (e.g., bandwidth) divided into “pieces” pieces allocated to each call resource piece idle if not used by owning call (no sharing) dividing link bandwidth into “pieces”…HOW? frequency division multiplexing (FDM) Users use different frequency channels time division multiplexing (TDM) Users use different time slots Network Core: Circuit Switching Lecture 2

  6. Example: 4 users FDM frequency time TDM frequency time Circuit Switching: FDM and TDM Lecture 2

  7. Numerical example 1 • You need to send a file of size 640,000 bits to your friend. You are using a circuit-switched network with TDM. Suppose, the circuit-switch network link has a bit rate of 1.536 Mbps (1Mb = 106 bits) and uses TDM with 24 slots. How long does it take you to send the file to your friend? Let’s work it out! Lecture 2

  8. D E Packet Switching 100 Mb/s Ethernet C A 1.5 Mb/s B queue of packets waiting for output link Lecture 2

  9. each end-end data stream divided into packets user A, B packets share network resources each packet uses full link bandwidth resources used as needed Network Core: Packet Switching resource contention: • aggregate resource demand can exceed amount available • store and forward: packets move one hop at a time • Node receives complete packet before forwarding • congestion: packets queue, wait for link use Circuit switching Bandwidth division into “pieces” Dedicated allocation Resource reservation Lecture 2

  10. Packet switching allows users to use the network dynamically! resource sharing simpler, no call setup With excessive users: Excessive congestion packet delay and loss Packet switching versus circuit switching How do delay and loss occur in Internet/network? Lecture 2

  11. packets queue in router buffers store and forward: packets move one hop at a time Router receives complete packet before forwarding packets queue, wait for turn…DELAY How do delay and loss occur? A B Lecture 2

  12. 1. nodal processing: check bit errors determine output link transmission A propagation B nodal processing queueing Four sources of packet delay • 2. queueing • time waiting at output link for transmission • depends on congestion level of router Lecture 2

  13. 3. Transmission delay: R=link bandwidth (bps) L=packet length (bits) time to send bits into link = L/R 4. Propagation delay: d = length of physical link s = propagation speed in medium (~2x108 m/sec) propagation delay = d/s transmission A propagation B nodal processing queueing Delay in packet-switched networks Note: s and R are very different quantities! Lecture 2

  14. Total delay • dproc = processing delay • typically a few microsecs or less • dqueue = queuing delay • depends on congestion • dtrans = transmission delay • = L/R, significant for low-speed links • dprop = propagation delay • a few microsecs to hundreds of msecs Lecture 2

  15. Example: A wants to send a packet to B. The packet size is, L = 7.5 Mb (1 Mb = 106 bits). The link speed is, R = 1.5 Mbps. How long does it take to send the packet from A to B? Assume zero propagation delay. Let’s work it out! Numerical example 2 L B A R Lecture 2

  16. Example: A wants to send a packet to B. The packet size is, L = 7.5 Mb (1 Mb = 106 bits). The link speed is, R = 1.5 Mbps. How long does it take to send the packet from A to B? Assume zero propagation delay. Let’s work it out! Numerical example 3 L B A R R Lecture 2

  17. Example: A wants to send a packet to B. The packet size is, L = 7.5 Mb (1 Mb = 106 bits). The link speed is, R = 1.5 Mbps. How long does it take to send the packet from A to B? Assume zero propagation delay. What if there are three packets from A? Let’s work it out! Numerical example 4 L B A R R R Lecture 2

  18. Packet loss • queue (aka buffer) preceding link in buffer has finite capacity • packet arriving to full queue dropped (aka lost) • lost packet may be retransmitted by previous node, by source end system, or not at all buffer (waiting area) packet being transmitted A B packet arriving to full bufferis lost Lecture 2

  19. Throughput • Throughput: rate at which information bits transferred between sender/receiver Rs Rs Rs R Rc Rc Rc Lecture 2

  20. Numerical example 5: Throughput • Example: A has requested for a packet (size 640,000 bits) from server B. The packet will come through an intermediate router C. It takes 0.1 second for the packet from B to C and 0.4 seconds from C to A. (Note: 1Mb=106 bits). Assume zero propagation delay. • What is the throughput from B to C? • What is the throughput from C to A? • What is the average throughout from B to A? Let’s work it out! B Rs Rs Rs C Rc Rc Rc A Lecture 2

More Related