Computer Network and Data

Communication 2nd Meeting

Mohammad Hafiz Hersyah

Budi Rahmadya
Dodon Yendri
Today’s topic
 Network core
 How is data transferred in the core?
 Basic characteristics of computer networks
 Delay, loss and throughput
 Protocol layers and service model
 Layered architecture: pros and cons
 Brief overview of network security
 More later in the course

Introduction 1-2
The Network Core
 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”

1-3
Network Core: Circuit Switching
End-end resources reserved
for “call”
 link bandwidth, switch
capacity
 dedicated resources: no
sharing
 circuit-like (guaranteed)
performance
 call setup required

1-4
Network Core: Circuit Switching
network resources (e.g.,  dividing link bandwidth into
bandwidth) divided into “pieces”
“pieces”  frequency division
 pieces allocated to calls  time division
 resource piece idle if not
used by owning call (no
sharing)

1-5
Circuit Switching: FDM and TDM
Example:
FDM
4 users

frequency

time
TDM

frequency

time
1-6
Numerical example
 How long does it take to send a file of 640,000 bits from host A to
host B over a circuit-switched network?
 All links are 1.536 Mbps
 Each link uses TDM with 24 slots/sec
 500 msec to establish end-to-end circuit

 Get a calculator!
 (1.536 * 1,000,000) / 24 = 64,000

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

1-8
Packet-switching: store-and-forward
L
R R R

 takes L/R seconds to Example:

transmit (push out)  L = 7.5 Mbits
packet of L bits on to  R = 1.5 Mbps
link at R bps
 transmission delay = 15
 store and forward: sec
entire packet must
arrive at router before
it can be transmitted
on next link
 delay = 3L/R (assuming more on delay shortly …
zero propagation delay)
1-10
 Packet Switching: Statistical Multiplexing
100 Mb/s
A Ethernet statistical multiplexing C

1.5 Mb/s
B
queue of packets
waiting for output
link

D E

Sequence of A & B packets does not have fixed pattern,

bandwidth shared on demand: statistical multiplexing.
TDM: each host gets same slot in revolving TDM frame.
1-9
 Packet switching versus circuit switching
Packet switching allows more users to use network!
 1 Mb/s link
 each user:
 100 kb/s when “active”
 active 10% of time N users
1 Mbps link
 circuit-switching:
 10 users Q: how did we get value 0.0004?
A: Binomial distribution
 packet switching:
 with 35 users, probability
> 10 active at same time is
less than .0004
n = 35, k = 0…10, p = .1 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: 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)
1-12
How do loss and delay occur?
packets queue in router buffers
 packet arrival rate to link 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-18
Four sources of packet delay
 1. nodal processing:  2. queueing
 time waiting at output link
 check bit errors
for transmission
 determine output link
 depends on congestion level
of router

transmission
A propagation

B
nodal
processing queueing

Introduction 1-19
Delay in packet-switched networks
3. Transmission delay: 4. Propagation delay:
 R=link bandwidth (bps)  d = length of physical link

 L=packet length (bits)  s = propagation speed in

medium (~2x108 m/sec)
 time to send bits into
 propagation delay = d/s
link = L/R
Note: s and R are very
different quantities!
transmission
A propagation

B
nodal
processing queueing
Introduction 1-20
Nodal 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
Introduction 1-23
Queueing delay (revisited)

 R=link bandwidth (bps)

 L=packet length (bits)
 a=average packet
arrival rate
traffic intensity = La/R

 La/R ~ 0: average queueing delay small

 La/R -> 1: delays become large
 La/R > 1: more “work” arriving than can be
serviced, average delay infinite!
Introduction 1-24
“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-25
 Packet loss
 queues (aka buffers) have finite capacity
 packets 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-27
 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 link capacity link capacity

file of F bits Rs bits/sec Rc bits/sec
to send to client

bottleneck link
link on end-end path that constrains end-end throughput
Introduction 1-28
Throughput: Internet scenario

 per-connection end- Rs
end throughput: Rs Rs
 min(Rc,Rs,R/10)
 in practice: Rc or Rs R

is often bottleneck
Rc Rc

Rc

10 connections (fairly) share

backbone bottleneck link R bits/sec
Introduction 1-30
Where we are?
 Network core
 Circuit switching, packet switching, network
structure
 Delay, loss and throughput
 Protocol layers, service models
 Networks under attack: security

Introduction 1-31
Protocol “Layers”
Networks are complex!
 many “pieces”:
 hosts Question:
 routers Is there any hope of
 links of various organizing structure of
media network?
 applications
 protocols Or at least our discussion
of networks?
 hardware,
software

Introduction 1-32
Internet protocol stack
 application: supporting network
applications
 FTP, SMTP, HTTP
Application
 transport: process-process data
transfer Transport
 TCP, UDP
 network: routing of datagrams from Network
source to destination
 IP, routing protocols
Link
 link: data transfer between neighboring
network elements
 PPP, Ethernet Physical
 physical: bits “on the wire”

Introduction 1-33
ISO/OSI reference model
 presentation: allow applications to
interpret meaning of data, e.g., Application
encryption, compression, machine-
specific conventions Presentation
 session: synchronization, Session
checkpointing, recovery of data
exchange Transport
 Internet stack “missing” these Network
layers!
 these services, if needed, must Link
be implemented in application Physical
 needed?
Introduction 1-35
 source
message M application
Encapsulation
segment Ht M Transport
datagram Hn Ht M Network
frame Hl Hn Ht M Link
Physical

link
physical

switch

destination Hn Ht M network
M Application Hl Hn Ht M Link
Ht M Transport Physical
Hn Ht M Network
Hl Hn Ht M Link
router
Physical

Introduction 1-36
Chapter1 Summary
Covered a “ton” of material! You now have:
 Internet overview  context, overview,
 what’s a protocol? “feel” of networking
 network edge, core,  more depth, detail to
access network follow!
 packet-switching versus
circuit-switching
 Internet structure
 performance: loss, delay,
throughput
 layering, service models
 history
Introduction 1-45
Network Security
 The field of network security is about:
 how bad guys can attack computer networks
 how we can defend networks against attacks
 how to design architectures that are immune to
attacks
 Internet not originally designed with (much)
security in mind
 original vision: “a group of mutually trusting users
attached to a transparent network” 
 Internet protocol designers playing “catch-up”
 Security considerations in all layers!

Introduction 1-37
Bad guys can put malware into
hosts via Internet
 Malware can get in host from a virus, worm, or
trojan horse.

 Spyware malware can record keystrokes, web

sites visited, upload info to collection site.

 Infected host can be enrolled in a botnet, used

for spam and DDoS attacks.

 Malware is often self-replicating: from an

infected host, seeks entry into other hosts

Introduction 1-38
Bad guys can put malware into
hosts via Internet
 Trojan horse  Worm:
 Hidden part of some  infection by passively receiving
otherwise useful software object that gets itself executed
 Today often on a Web  self- replicating: propagates to
page (Active-X, plugin) other hosts, users
 Virus
 infection by receiving Sapphire Worm: aggregate scans/sec
object (e.g., e-mail in first 5 minutes of outbreak (CAIDA, UWisc data)
attachment), actively
executing
 self-replicating: propagate
itself to other hosts,
users

Introduction 1-39
 Bad guys can attack servers and
network infrastructure
 Denial of service (DoS): attackers make resources
(server, bandwidth) unavailable to legitimate traffic
by overwhelming resource with bogus traffic
1. select target
2. break into hosts
around the network
(see botnet)
3. send packets toward
target from target
compromised hosts

Introduction 1-40
The bad guys can sniff packets
Packet sniffing:
 broadcast media (shared Ethernet, wireless)
 promiscuous network interface reads/records all
packets (e.g., including passwords!) passing by

A C

src:B dest:A payload

B
 Wireshark, tcpdump, ethereal, etc

Introduction 1-41
The bad guys can use false source
addresses
 IP spoofing: send packet with false source
address
A C

src:B dest:A payload

Introduction 1-42
The bad guys can record and playback

 record-and-playback: sniff sensitive info (e.g.,

password), and use later
 password holder is that user from system point
of view
C
A

src:B dest:A user: B; password: foo

Introduction 1-43
Network Security
 more throughout this course
 chapter 8: focus on security
 crypographic techniques: obvious uses and
not so obvious uses
 History(1.7) is for self-study

Introduction 1-44
 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
booth onto highway =
 toll booth takes 12 sec to
12*10 = 120 sec
service car (transmission
 Time for last car to
time)
propagate from 1st to 2nd
 car~bit; caravan ~ packet
toll both:
 Q: How long until caravan 100km/(100km/hr)= 1 hr
is lined up before 2nd  A: 62 minutes
toll booth?
Introduction 1-21
Caravan analogy (more)
100 km 100 km
ten-car toll toll
caravan booth booth
 Yes! After 7 min, 1st car at
 Cars now “propagate” at 2nd booth and 3 cars still
at 1st booth.
1000 km/hr  1st bit of packet can arrive
 Toll booth now takes 1 at 2nd router before
min to service a car packet is fully transmitted
 Q: Will cars arrive to at 1st router!
2nd booth before all
cars serviced at 1st
booth?
Introduction 1-22
“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 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

Introduction 1-26
Throughput (more)
 Rs < Rc What is average end-end throughput?

Rs bits/sec Rc bits/sec

 Rs > Rc What is average end-end throughput?

Rs bits/sec Rc bits/sec

Introduction 1-29
Layered architecture
Dealing with complex systems:
 Each layer implements a service
 Via its own internal-layer actions
 Relying on services provided by layer below

 Explicit structure allows identification, relationship of complex

system’s pieces
 layered reference model for discussion
 Modularization eases maintenance, updating of system
 change of implementation of layer’s service transparent to rest
of system
 e.g., change in application layer doesn’t affect the transport
layer
 Layering considered harmful?

Introduction 1-34