CSCE 5580.

001 – Computer Networks

 Department of Computer Science and Engineering

 University of North Texas

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
 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-2
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-3
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-4
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-5
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-6
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?

Introduction 1-7
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-8
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
* Check out the Java applet for an interactive animation on queuing and loss Introduction 1-9
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
R bits/sec fluid at rate
s R bits/sec
to send to client c
Rs bits/sec) Rc bits/sec)

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

Rs bits/sec Rc bits/sec

L/Rs
L/Rs+L/Rc

2L/Rs 2L/Rs+L/Rc

mL/Rs mL/Rs+L/Rc
Introduction 1-11
Throughput (more)
 Rs > Rc What is average end-end throughput?

Rs bits/sec Rc bits/sec
L/Rs

2L/Rs L/Rs+L/Rc

mL/Rs L/Rs+2L/Rc

L/Rs+mL/Rc
Introduction 1-12
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

bottleneck
link
link on end-end path that constrains end-end throughput
Introduction 1-13
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
Introduction 1-14
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-15
Protocol “ layers”
Networks are complex,
with 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-16
Organization of air travel
ticket (purchase) ticket (complain)

baggage (check) baggage (claim)

gates (load) gates (unload)

runway takeoff runway landing

airplane routing airplane routing

airplane routing

 a series of steps

Introduction 1-17
Layering of airline functionality

ticket (purchase) ticket (complain) ticket

baggage (check) baggage (claim baggage

gates (load) gates (unload) gate

runway (takeoff) runway (land) takeoff/landing

airplane routing airplane routing airplane routing airplane routing airplane routing

departure intermediate air-traffic arrival

airport control centers airport

layers: each layer implements a service

 via its own internal-layer actions
 relying on services provided by layer below

Introduction 1-18
Why layering?
dealing with complex systems:
 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 gate procedure doesn’t affect rest of
system
 layering considered harmful?

Introduction 1-19
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 physical
 Ethernet, 802.111 (WiFi), PPP
 physical: bits “ on the wire”
Introduction 1-20
ISO/OSI reference model
 presentation: allow applications
to interpret meaning of data, application
e.g., encryption, compression,
machine-specific conventions presentation
 session: synchronization, session
checkpointing, recovery of data transport
exchange
network
 Internet stack “ missing” these
layers! link
 these services, if needed, must be physical
implemented in application
 needed?

Introduction 1-21
 message M
source
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 Hn Ht M
Ht M transport physical
Hn Ht M network
Hl Hn Ht M link router
physical

Introduction 1-22
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-23
Network security
 field of network security:
 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-24
Bad guys: put malware into hosts via Internet
 malware can get in host from:
 virus: self-replicating infection by receiving/executing
object (e.g., e-mail attachment)
 worm: self-replicating infection by passively receiving
object that gets itself executed
 spyware malware can record keystrokes, web sites
visited, upload info to collection site
 infected host can be enrolled in botnet, used for
spam. DDoS attacks

Introduction 1-25
Bad guys: attack server, 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 to target from
compromised hosts
target

Introduction 1-26
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 software used for end-of-chapter labs is a

(free) packet-sniffer
Introduction 1-27
Bad guys can use fake addresses
IP spoofing: send packet with false source address
A C

src:B dest:A payload

… lots more on security (throughout, Chapter 8)

Introduction 1-28