Computer Networks

Chan Yeob Yeun

Lecture 2

OSI vs. TCP/IP

OSI
TCP/IP
MODEL

APPLICATION
7 APPLICATION

Worldwide Web: http

PRESENTATION Remote Login: telnet, rlogin
6 Remote Commands: rexec, rsh
File Transfers: ftp, rcp, tftp, UUCP
E-mail: SMTP, POP3, IMAP
SESSION Remote File Systems: NIS/NFS, RPC
5

TRANSPORT
TRANSPORT
4 Tranmission Control Protocol (TCP)
User Datagram Protocol (UDP)
INTERNETWORKING
NETWORK
3 Internet Protocol (IP)
Internet Control Message Protocol (ICMP)
NETWORK INTERFACE
DATA LINK
&
2
HARDWARE
CONNECTIONS
PHYSICAL
LAN: Ethernet, Token Ring, FDDI, ATM...
1
WAN: SLIP/PPP, X.25, Frame Relay...

P2

1
Chapter 1
Introduction
A note on the use of these ppt slides:
We’re making these slides freely available to all (faculty, students, readers).
They’re in PowerPoint form so you see the animations; and can add, modify,
and delete slides (including this one) and slide content to suit your needs.
They obviously represent a lot of work on our part. In return for use, we only
Computer
ask the following:
Networking: A Top
 If you use these slides (e.g., in a class) that you mention their source
Down Approach
(after all, we’d like people to use our book!) Global edition
 If you post any slides on a www site, that you note that they are adapted
from (or perhaps identical to) our slides, and note our copyright of this
James Kurose, Keith Ross
material. Pearson
Thanks and enjoy! JFK/KWR
November 2016
All material copyright 1996-2016
J.F Kurose and K.W. Ross, All Rights Reserved

Introduction 1-3

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, network structure
1.4 delay, loss, throughput in networks
1.5 protocol layers, service models
1.6 networks under attack: security
1.7 history

Introduction 1-4

2
 The network core
 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

Introduction 1-5

Packet-switching: store-and-forward

L bits
per packet

3 2 1
source destination
R bps R bps

 takes L/R seconds to one-hop numerical example:

transmit (push out) L-bit
packet into link at R bps  L = 7.5 Mbits
 store and forward: entire  R = 1.5 Mbps
packet must arrive at router  one-hop transmission
before it can be transmitted delay = 5 sec
on next link
 end-end delay = 2L/R (assuming
zero propagation delay) more on delay shortly …
Introduction 1-6

3
Packet Switching: queueing delay, loss

R = 100 Mb/s C
A
D
R = 1.5 Mb/s
B
queue of packets E
waiting for output link

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

Introduction 1-7

Two key network-core functions

routing: determines source- forwarding: move packets from
destination route taken by router’s input to appropriate
packets router output
 routing algorithms

routing algorithm

local forwarding table

header value output link
0100 3 1
0101 2
0111 2 3 2
1001 1

dest address in arriving

packet’s header
Network Layer 4-8

4
Alternative core: circuit switching
end-end resources allocated
to, reserved for “call”
between source & dest:
 In diagram, each link has four
circuits.
 call gets 2nd circuit in top
link and 1st 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
Introduction 1-9

Circuit switching: FDM versus TDM

Example:
FDM
4 users

frequency

time
TDM

frequency

time
Introduction 1-10

5
Packet switching versus circuit switching
packet switching allows more users to use network!

example:
 1 Mb/s link
 each user: N
users
• 100 kb/s when “active”
• active 10% of time 1 Mbps link

 circuit-switching:
 10 users
 packet switching: Q: how did we get value 0.0004?
 with 35 users, probability >
10 active at same time is less Q: what happens if > 35 users ?
than .0004 *

* Check out the online interactive exercises for more examples Introduction 1-11

Packet switching versus circuit switching

is packet switching a “slam dunk winner?”
 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)

Q: human analogies of reserved resources (circuit switching)

versus on-demand allocation (packet-switching)?
Introduction 1-12

6
Internet structure: network of networks
 End systems connect to Internet via access ISPs (Internet
Service Providers)
 Residential, company and university ISPs
 Access ISPs in turn must be interconnected.
 So that any two hosts can send packets to each other
 Resulting network of networks is very complex
 Evolution was driven by economics and national policies
 Let’s take a stepwise approach to describe current Internet
structure

Internet structure: network of networks

Question: given millions of access ISPs, how to connect them
together?
access access
net net
access
net
access
access net
net
access
access net
net

access access
net net

access
net
access
net

access
net
access
net
access access
net access net
net

7
Internet structure: network of networks
Option: connect each access ISP to every other access ISP?

access access
net net
access
net
access
access net
net
access
access net
net

connecting each access ISP

access
to each other directly doesn’t access
net
scale: O(N2) connections. net

access
net
access
net

access
net
access
net
access access
net access net
net

Internet structure: network of networks

Option: connect each access ISP to a global transit ISP? Customer
and provider ISPs have economic agreement.
access access
net net
access
net
access
access net
net
access
access net
net

global
access
net
ISP access
net

access
net
access
net

access
net
access
net
access access
net access net
net

8
Internet structure: network of networks
But if one global ISP is viable business, there will be competitors
….
access access
net net
access
net
access
access net
net
access
access net
net
ISP A

access access
net ISP B net

access
ISP C
net
access
net

access
net
access
net
access access
net access net
net

Internet structure: network of networks

But if one global ISP is viable business, there will be competitors
…. which must be interconnected
access access
Internet exchange point
net net
access
net
access
access net
net

access
IXP access
net
net
ISP A

access IXP access

net ISP B net

access
ISP C
net
access
net

access peering link

net
access
net
access access
net access net
net

9
Internet structure: network of networks
… and regional networks may arise to connect access nets to
ISPS
access access
net net
access
net
access
access net
net

access
IXP access
net
net
ISP A

access IXP access

net ISP B net

access
ISP C
net
access
net

access
net regional net
access
net
access access
net access net
net

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, network structure
1.4 delay, loss, throughput in networks
1.5 protocol layers, service models
1.6 networks under attack: security
1.7 history

Introduction 1-20

10
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
packet being transmitted (delay)

B
packets queueing (delay)
free (available) buffers: arriving packets
dropped (loss) if no free buffers

Introduction 1-21

Four sources of packet delay

transmission
A propagation

B
nodal
processing queueing

dnodal = dproc + dqueue + dtrans + dprop

dproc: nodal processing dqueue: queueing delay

 check bit errors  time waiting at output link
 determine output link for transmission
 typically < msec  depends on congestion
level of router
Introduction 1-22

11
Four sources of packet delay
transmission
A propagation

B
nodal
processing queueing

dnodal = dproc + dqueue + dtrans + dprop

dtrans: transmission delay: dprop: propagation delay:

 L: packet length (bits)  d: length of physical link
 R: link bandwidth (bps)  s: propagation speed in medium
 dtrans = L/R (~2x108 m/sec)
dtrans and dprop  dprop = d/s
very different
* Check out the Java applet for an interactive animation on trans vs. prop delay Introduction 1-23

Caravan analogy
100 km 100 km
ten-car toll toll
caravan booth booth

 cars “propagate” at  time to “push” entire

100 km/hr caravan through toll
 toll booth takes 12 sec to booth onto highway =
service car (bit transmission 12*10 = 120 sec
time)  time for last car to
 car~bit; caravan ~ packet propagate from 1st to
 Q: How long until caravan is 2nd toll both:
lined up before 2nd toll 100km/(100km/hr)= 1
booth? hr
 A: 62 minutes
Introduction 1-24

12
Caravan analogy (more)
100 km 100 km
ten-car toll toll
caravan booth booth

 suppose cars now “propagate” at 1000 km/hr

 and suppose toll booth now takes one min to service a car
 Q: Will cars arrive to 2nd booth before all cars serviced at first
booth?
 A: Yes! after 7 min, 1st car arrives at second booth; three
cars still at 1st booth.

Introduction 1-25

Queueing delay (revisited)

average queueing

 R: link bandwidth (bps)

delay

 L: packet length (bits)

 a: average packet arrival
rate
traffic intensity
= La/R
 La/R ~ 0: avg. queueing delay small La/R ~ 0

 La/R -> 1: avg. queueing delay large

 La/R > 1: more “work” arriving
than can be serviced, average delay infinite!

* Check out the Java applet for an interactive animation on queuing and loss La/R -> 1
Introduction 1-26

13
“Real” Internet delays and routes
 what do “real” Internet delay & loss look like?
 traceroute program: provides delay
measurement from source to router along end-
end Internet path towards destination. For all i:
 sends three packets that will reach router i on path
towards destination
 router i will return packets to sender
 sender times interval between transmission and reply.

3 probes 3 probes

3 probes

Introduction 1-27

“Real” Internet delays, routes

traceroute: gaia.cs.umass.edu to www.eurecom.fr
3 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 trans-oceanic
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 link
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 * * * * means no response (probe lost, router not replying)
19 fantasia.eurecom.fr (193.55.113.142) 132 ms 128 ms 136 ms

* Do some traceroutes from exotic countries at www.traceroute.org

Introduction 1-28

14