Data Communication &

Computer Networks
Course Instructor:
Mr. Fakhar Ul Islam
Road Map
1 what is the Internet?
2 network edge
 end systems, access networks, links
3 protocol layers, service models
4 network core
 packet switching, circuit switching, network structure
5 delay, loss, throughput in networks
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
Packet-switching: store-and-forward

L bits
per packet

3 2 1
source destination
R bps R bps

 takes L/R seconds to transmit one-hop numerical

(push out) L-bit packet into example:
link at R bps
 L = 7.5 Mbits
 store and forward: entire
packet must arrive at router  R = 1.5 Mbps

before it can be transmitted  one-hop transmission

on next link delay = 5 sec
 end-end delay = 2L/R (assuming
zero propagation delay) more on delay shortly …
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
 Two key network-core functions
routing: determines source- forwarding: move packets
destination route taken by from router’s input to
packets appropriate router output
 routing algorithms

routing algorithm

local forwarding table

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

dest address in arriving

packet’s header
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
Circuit switching: FDM versus TDM
Example:
FDM
4 users

frequency

time
TDM

frequency

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

example:
 1 Mb/s link
N

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

 circuit-switching:
 10 users
 packet switching:
 with 35 users, probability of 10 active at same time is less than .0004 *
Packet switching

 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
Road Map
1 what is the Internet?
2 network edge
 end systems, access networks, links
3 protocol layers, service models
4 network core
 packet switching, circuit switching, network structure
5 delay, loss, throughput in networks
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
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
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
“ 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
“ 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

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 buffer is lost
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,
server withbits
sends linkpipe
capacity
that can carry linkpipe
capacity
that can carry
file of into
(fluid) F bits
pipe fluid at rate
Rs bits/sec fluid at rate
Rc bits/sec
to send to client Rs bits/sec) Rc bits/sec)
Throughput: Internet scenario

 per-connection end-
end throughput: Rs
min(Rc,Rs,R/10) Rs Rs
 in practice: R or R
c s
is often bottleneck R

Rc Rc

Rc

10 connections (fairly) share

backbone bottleneck link R bits/sec