Four sources of packet delay

Slides:



Advertisements
Similar presentations
Computer Networks Performance Metrics Advanced Computer Networks Fall 2013.
Advertisements

Computer Networks Performance Metrics Computer Networks Term B10.
CS 381 Introduction to computer networks Chapter 1 - Lecture 3 2/5/2015.
1 ITC242 – Introduction to Data Communications Week 8 Topic 13 Wireless WANS Reading 2.
Introduction1-1 Chapter 1: Introduction Our goal:  get context, overview, “feel” of networking  more depth, detail later in course  approach: m descriptive.
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.
Some slides are in courtesy of J. Kurose and K. Ross Review of Previous Lecture Course Administrative Trivia Internet Architecture Network Protocols Network.
Introduction1-1 Chapter 1: Introduction  get context, overview, “feel” of networking  more depth, detail later in course  approach: m descriptive m.
Network core.
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,
Introduction1-1 Data Communication and Networks Lecture 2 Overview (Part 2) September 16, 2004 Joseph Conron Computer Science Department New York University.
Introduction 1 Lecture 3 Networking Concepts slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science & Engineering Department.
Introduction1-1 The Internet  A global network of computers  who runs it?  who pays for it?  who invented the internet?  How do the computer’s communicate?
Ch 1. Computer Networks and the Internet Myungchul Kim
Introduction 1-1 Chapter 1 Introduction Computer Networking: A Top Down Approach, 5 th edition. Jim Kurose, Keith Ross Addison-Wesley, April Reading.
Overview-Part2.
Introduction1-1 Chapter 1 Introduction Computer Networking: A Top Down Approach, 5 th edition. Jim Kurose, Keith Ross Addison-Wesley, April A note.
Last quiz question….
2-1 Last time  Course mechanics  What is the Internet?  hosts, routers, communication links  communications services, protocols  Network Edge  client-server,
Slides originally from Professor Williamson at U Calgary1-1 Introduction Part II  Network Core  Delay & Loss in Packet-switched Networks  Structure.
1 Kommunikatsiooniteenuste arendus IRT0080 Loeng 7 Avo Ots telekommunikatsiooni õppetool, TTÜ raadio- ja sidetehnika inst.
Networking Networking 101 Notes are adapted from chapter-1 in the textbook Multimedia Streaming {week-2} Mohamed Abdel-Maguid Computer Networking:
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.
Introduction1-1 Circuit switching: FDM and TDM FDM (Frequency division multiplexing) frequency time TDM (Time division multiplexing) frequency time 4 users.
How do loss and delay occur?
Introduction 1-1 Chapter 1 Introduction Computer Networking: A Top Down Approach, 5 th edition. Jim Kurose, Keith Ross Addison-Wesley, April 2009.
Introduction 1-1 “Real” Internet delays and routes  What do “real” Internet delay & loss look like?  Traceroute program: provides delay measurement from.
Wireless access networks  shared wireless access network connects end system to router  via base station aka “access point”  wireless LANs:  b/g.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
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.
Lecture 4 Computer Networking: A Top Down Approach 6th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 CS3516: These slides are generated from.
Introduction1-1 Chapter 1 Computer Networks and the Internet Computer Networking: A Top Down Approach Featuring the Internet, 2 nd edition. Jim Kurose,
Computer Networks CS1652 The slides are adapted from the publisher’s material All material copyright J.F Kurose and K.W. Ross, All Rights Reserved.
Computer Networks Performance Metrics
Introduction1-1 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge 1.3 Network core 1.4 Network access and physical media 1.5 Internet structure.
CE3710 Tutorial FAROOQUI NK. What’s the Internet: “nuts and bolts” view  millions of connected computing devices: hosts = end systems  running network.
1 Computer Networks & The Internet Lecture 4 Imran Ahmed University of Management & Technology.
1: Introduction1 Introduction 3. 1: Introduction2 Delay in packet-switched networks packets experience delay on end-to-end path r four sources of delay.
Introduction 1-1 Chapter 1 Part 3 Delay, loss and throughput These slides derived from Computer Networking: A Top Down Approach, 6 th edition. Jim Kurose,
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)
Introduction 1-1 Chapter 1 Introduction (2/2) CSEE 4119 Computer Networks.
DELAYS, LAYERED NETWORK MODEL AND NETWORK SECURITY.
Introduction 1-1 Computer Network Basics Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 Adopted.
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,
EEC-484/584 Computer Networks
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 switching,
PRACTICAL INTRODUCTION TO INTERNET TECHNOLOGY. Practical one PACKET DELAY AND LOSS IN INTERNET In this experiment, you will observe real delays and loss.
What is the Speed of the Internet? Internet Computing KUT Youn-Hee Han.
Network Behaviour & Impairments
Delay in packet switched network. Circuit switching In Circuit switched networks the resources needed along a path (buffers and link transmission rate)
Computer Networks Performance Metrics Computer Networks Spring 2013.
Lecture # 3: WAN Data Communication Network L.Rania Ahmed Tabeidi.
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.
What’s the Internet: “nuts and bolts” view
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.
Prof. Younghee Lee 1 1 Computer Networks u Lecture 2: Protocols and Layering Prof. Younghee Lee * Some part of this teaching materials are prepared referencing.
Introduction to Networks
Administrative Things
CS4470 Computer Networking Protocols
RSC Part II: Network Layer 1. Basic Concepts
Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge
Session 2 INST 346 Technologies, Infrastructure and Architecture
Computer Networks Performance Metrics
How do loss and delay occur?
EEC-484/584 Computer Networks
Presentation transcript:

Four sources of packet delay B propagation transmission nodal processing queueing dnodal = dproc + dqueue + dtrans + dprop dproc: nodal processing check bit errors determine output link typically microseconds dqueue: queueing delay time waiting at output link for transmission depends on congestion level of router Slides by Kurose and Ross Introduction 1-1

Propagation delay Propagation delay = d/s, where d is the length of the link and s is the speed of light in the physical medium of the link hence the dependence on length of the link bit travels at the speed of light in the medium (~2x108 to 3x108 m/sec) Propagation delay is the time needed for a bit dropped in at one end of a link to travel to the far end of the link. The bit travels at the speed of light in the link medium. Therefore it depends upon the length of the link and the speed of light in the medium of the link. c, the speed of light in vacuum, is 300,000km/sec. Speed of light in air can be approximated to equal the speed of light in vacuum. In other media, such as optical fiber, the speed of light is lower (speed of light in vacuum/sqrt(dielectric constant of medium)) propagation delay 1 bit

Emission (transmission) delay Emission (transmission) delay = L/R, where L is the size of the data unit being transmitted in bits, and R is the transmission rate in bits/sec Let’s say the link transmitter can emit out 10 million bits/sec; this is R, the transmission rate of the link. Hence the size of the packet, L, and the transmitter rate, R, determine the emission (transmission) delay 1 packet of L bits Emission delay, as the name implies, is the time taken to emit the data unit on to the link. A transmitter is present at the sending end of a link and a receiver receives data bits at the receiving end. The time to transmit a data unit, which could be a file or a packet, at the sending end is called emission delay or transmission delay. Analogy: Use a flashlight to transmit a signal. Turn on for '1' and off for '0'. The rate at which you can turn the flashlight on and off determines the transmission rate r. emission (transmission) delay: time to emit (transmit) the data unit on to the link

Pipelining bits in a packet Why do we not need to multiply propagation delay by the number of bits in determining the total delay ? Because of pipelining. As the transmitter is emitting bits on to the channel, the bits are immediately propagating across. Hence we only need to add the propagation delay for the last bit to the emission delay of the whole packet.

Caravan analogy: pipelining of packets toll booth ten-car caravan 100 km cars “propagate” at 100 km/hr toll booth takes 12 sec to service car (transmission time) car~bit; caravan ~ packet Q: How long until caravan is lined up before 2nd toll booth? time to “push” entire caravan through toll booth onto highway = 12*10 = 120 sec time for last car to propagate from 1st to 2nd toll both: 100km/(100km/hr)= 1 hr A: 62 minutes Introduction 1-5

Caravan analogy (more) toll booth ten-car caravan 100 km cars now “propagate” at 1000 km/hr toll booth now takes 1 min to service a car Q: Will cars arrive to 2nd booth before all cars serviced at 1st booth? A: Yes! After 7 min, 1st car arrives at second booth; three cars still at 1st booth. 1st bit of packet can arrive at 2nd router before packet is fully transmitted at 1st router! Introduction 1-6

“Real” Internet delays and routes traceroute: gaia.cs.umass.edu to www.eurecom.fr Three delay measurements from gaia.cs.umass.edu to cs-gw.cs.umass.edu 1 cs-gw (128.119.240.254) 1 ms 1 ms 2 ms 2 border1-rt-fa5-1-0.gw.umass.edu (128.119.3.145) 1 ms 1 ms 2 ms 3 cht-vbns.gw.umass.edu (128.119.3.130) 6 ms 5 ms 5 ms 4 jn1-at1-0-0-19.wor.vbns.net (204.147.132.129) 16 ms 11 ms 13 ms 5 jn1-so7-0-0-0.wae.vbns.net (204.147.136.136) 21 ms 18 ms 18 ms 6 abilene-vbns.abilene.ucaid.edu (198.32.11.9) 22 ms 18 ms 22 ms 7 nycm-wash.abilene.ucaid.edu (198.32.8.46) 22 ms 22 ms 22 ms 8 62.40.103.253 (62.40.103.253) 104 ms 109 ms 106 ms 9 de2-1.de1.de.geant.net (62.40.96.129) 109 ms 102 ms 104 ms 10 de.fr1.fr.geant.net (62.40.96.50) 113 ms 121 ms 114 ms 11 renater-gw.fr1.fr.geant.net (62.40.103.54) 112 ms 114 ms 112 ms 12 nio-n2.cssi.renater.fr (193.51.206.13) 111 ms 114 ms 116 ms 13 nice.cssi.renater.fr (195.220.98.102) 123 ms 125 ms 124 ms 14 r3t2-nice.cssi.renater.fr (195.220.98.110) 126 ms 126 ms 124 ms 15 eurecom-valbonne.r3t2.ft.net (193.48.50.54) 135 ms 128 ms 133 ms 16 194.214.211.25 (194.214.211.25) 126 ms 128 ms 126 ms 17 * * * 18 * * * 19 fantasia.eurecom.fr (193.55.113.142) 132 ms 128 ms 136 ms trans-oceanic link * means no response (probe lost, router not replying) Introduction 1-7

End-to-end delay: multiple links, single-packet file   Introduction

End-to-end delay: multiple links, multi-packet file (pipelining) File is divided into P packets Each packet is of size L There are N-1 routers between source and destination (which means there are N links) Each link is of length d Speed of light in medium is s Link transmission rate is R (same for all links) Neglect processing and queueing delays Introduction

Queueing delay (E[T] in our analysis) R: link bandwidth (bps) L: packet length (bits) a: average packet arrival rate La/R: traffic intensity average queueing delay traffic intensity = La/R La/R ~ 0 La/R ~ 0: avg. queueing delay small La/R -> 1: avg. queueing delay large La/R > 1: more “work” arriving than can be serviced, average delay infinite! La/R -> 1 Introduction 1-10

Packet loss queue (aka 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 buffer is lost Introduction 1-11