CSIT 561: Computer Networks:

An Internet Perspective
Fall 2010
HKUST

CSIT 561 (Fall 2010) Introduction 1-1

Course Info
• Instructors:
– Dr. Jogesh K. Muppala: http://www.cs.ust.hk/~muppala/
– Dr. Brahim Bensaou: http://www.cs.ust.hk/~csbb/
• Course web site on LMES 2: http://lmes2.ust.hk contains all
notes, announcements, etc. Check it regularly!
• Alternate site: http://www.cse.ust.hk/~muppala/csit561/
contains some details
• Lecture schedule
– Track 16: (Mon 3:00 pm - 5:50 pm): Section L2
– Track 17: (Tue 7:30 pm - 10:20 pm): Section L1

CSIT 561 (Fall 2010) Introduction 1-2

Course Info
• Textbook: James Kurose and Keith Ross
– Computer Networking: A Top Down Approach, 5th ed. Pearson, 2009
– http://www.aw-bc.com/kurose_ross/ with useful resource material

• The useful links and also the lab materials online

CSIT 561 (Fall 2010) Introduction 1-3

Course Info
• Grading scheme
– Option 1
• Homeworks (3) 45 points (15 points for each)
• Mid-Term Exam 25 points
• Final Exam 30 points
– Option 2
• Homeworks (2) 30 points
• Survey report (replace the last homework) 15 points
• Mid-Term Exam 20 points
• Final Exam 30 points
• Examinations arrangements
– Mid-term (Oct. 08, 8:00-10:00 pm)
– Final exam (Dec. 14, 7:30-10:00 pm)

CSIT 561 (Fall 2010) Introduction 1-4

Course Schedule

• Introduction of computer networking (2 lectures)

• Application layer (4 lectures)
• Transport layer (5 lectures)
• Networking layer (5 lectures)
• Link Layer and Local Area Networks (3 lectures)
• Mobile and wireless computing (4 lectures)
• Multimedia networking (3 lectures)

CSIT 561 (Fall 2010) Introduction 1-5

Chapter 1
Introduction

A note on the use of these ppt slides:

The notes used in this course are substantially
based on powerpoint slides developed and Computer Networking:
copyrighted by J.F. Kurose and K.W. Ross, 2007 A Top Down Approach ,
4th edition.
Jim Kurose, Keith Ross
Addison-Wesley, July
2007.

CSIT 561 (Fall 2010) Introduction 1-6

Chapter 1: Introduction
Our goal: Overview:
• Get “feel” and terminology • What’s the Internet?
• More depth, detail later in • What’s a protocol?
course • Network edge; hosts, access
• Approach: net, physical media
– use Internet as example • Network core: packet/circuit
switching, Internet structure
• Performance: loss, delay,
throughput
• Security
• Protocol layers, service models
• History

CSIT 561 (Fall 2010) Introduction 1-7

Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
End systems, access networks, links
1.3 Network core
Circuit switching, packet switching, network structure
1.4 Delay, loss and throughput in packet-switched networks
1.5 Protocol layers, service models
1.6 Networks under attack: security
1.7 History

CSIT 561 (Fall 2010) Introduction 1-8

What’s the Internet: “nuts and bolts” view
PC • Millions of connected Mobile network
server computing devices: Global ISP
wireless hosts = end systems
laptop
– Running network apps
cellular
handheld Home network
Regional ISP
 Communication links
access  Fiber, copper,
points radio, satellite Institutional network
wired
links  Transmission rate
= bandwidth
 Routers: forward
router packets (chunks of data)

CSIT 561 (Fall 2010) Introduction 1-9

What’s the Internet: “nuts and bolts” view
Mobile network
• Protocols control sending,
receiving of msgs Global ISP
– E.g., TCP, IP, HTTP, Skype,
Ethernet
Home network
• Internet: “network of networks”
Regional ISP
– Loosely hierarchical
– Public Internet versus private
intranet Institutional network
• Internet standards
– RFC: Request for comments
– IETF: Internet Engineering Task
Force

CSIT 561 (Fall 2010) Introduction 1-10

What’s the Internet: A Service View
• Communication
infrastructure enables
distributed applications:
– Web, VoIP, email, games, e-
commerce, file sharing

• Communication services
provided to apps:
– Reliable data delivery from
source to destination
– “Best effort” (unreliable) data
delivery

CSIT 561 (Fall 2010) Introduction 1-11

What’s a Protocol?
Human protocols:
• “What’s the time?”
• “I have a question”
• Introductions
… specific msgs sent
… specific actions taken
when msgs received, or
other events
CSIT 561 (Fall 2010) Introduction
Network protocols:
• Machines rather than
humans
• All communication activity
in Internet governed by
protocols
Protocols define format,
order of msgs sent and
received among network
entities, and actions
taken on msg
transmission, receipt
1-12
What’s a Protocol?
A human protocol and a computer network protocol:

Hi
TCP connection
request
Hi
TCP connection
Got the response
time?
Get http://www.awl.com/kurose-ross
2:00
time <file>

Q: Other human protocols?

CSIT 561 (Fall 2010) Introduction 1-13
Chapter 1: Roadmap
1.1 What is the Internet?
1.2 Network edge
 End systems, access networks, links
1.3 Network core
 Circuit switching, packet switching, network structure
1.4 Delay, loss and throughput in packet-switched networks
1.5 Protocol layers, service models
1.6 Networks under attack: security
1.7 History

CSIT 561 (Fall 2010) Introduction 1-14

 A Closer Look at Network Structure:
• Network edge:
applications and hosts

 Access networks,
physical media: wired,
wireless communication
links

 Network core:
 Interconnected routers
 Network of networks

CSIT 561 (Fall 2010) Introduction 1-15

 The Network Edge:
• End systems (hosts):
– Run application programs
– E.g. Web, email
– At “edge of network” peer-peer

 Client/server model
 Client host requests, receives
service from always-on server
 E.g. Web browser/server; email
client/server
client/server
 Peer-peer model:
 Minimal (or no) use of dedicated
servers
 E.g. Skype, BitTorrent

CSIT 561 (Fall 2010) Introduction 1-16

Network Edge: Reliable Data Transfer Service
Goal: data transfer between
end systems
• Handshaking: setup
(prepare for) data transfer
ahead of time
– Hello, hello back human
protocol
– Set up “state” in two
communicating hosts
• TCP - Transmission Control
Protocol
– Internet’s reliable data
transfer service
CSIT 561 (Fall 2010)
TCP service [RFC 793]
• Reliable, in-order byte-
stream data transfer
– Loss: acknowledgements and
retransmissions
• Flow control:
– Sender won’t overwhelm
receiver
• Congestion control:
– Senders “slow down sending
rate” when network congested
Introduction 1-17
Network Edge: Best Effort (Unreliable) Data
Transfer Service
Goal: data transfer between App’s using TCP:
end systems • HTTP (Web), FTP (file
– same as before! transfer), Telnet (remote
• UDP - User Datagram login), SMTP (email)
Protocol [RFC 768]:
– Connectionless App’s using UDP:
– Unreliable data transfer • streaming media,
– No flow control teleconferencing, DNS,
– No congestion control Internet telephony

CSIT 561 (Fall 2010) Introduction 1-18

Access Networks and Physical Media
Q: How to connect end
systems to edge router?
• Residential access nets
• Institutional access
networks (school, company)
• Mobile access networks
Keep in mind:
• Bandwidth (bits per second)
of access network?
• Shared or dedicated?

CSIT 561 (Fall 2010) Introduction 1-19

Residential Access: Point to Point Access

• Dialup via modem

– Up to 56Kbps direct access to router
(often less)
– Can’t surf and phone at same time:
can’t be “always on”

 DSL: digital subscriber line

 deployment: telephone company (typically)
 up to 1 Mbps upstream (today typically < 256 kbps)
 up to 8 Mbps downstream (today typically < 1 Mbps)
 dedicated physical line to telephone central office

CSIT 561 (Fall 2010) Introduction 1-20

Residential Access: Cable Modems

• HFC: hybrid fiber coax

– Asymmetric: up to 30Mbps downstream, 2 Mbps
upstream
– Is shared broadcast medium
• Network of cable and fiber attaches homes to ISP
router
– Homes share access to router
• Deployment: available via cable TV companies

CSIT 561 (Fall 2010) Introduction 1-21

Company Access: Local Area Networks
• Company/univ local area
network (LAN) connects end
system to edge router
• Ethernet:
– 10 Mbs, 100Mbps, 1Gbps,
10Gbps Ethernet
– Modern configuration: end
systems connect into
Ethernet switch
• LANs: chapter 5

CSIT 561 (Fall 2010) Introduction 1-22

Wireless Access Networks
• Shared wireless access network
connects end system to router
– Via base station aka “access point” router
• Wireless LANs:
– 802.11b/g (WiFi): 11 or 54 Mbps base
• Wider-area wireless access station
– Provided by telco operator
– ~1Mbps over cellular system (EVDO,
HSDPA)
– Next up (?): WiMAX (10’s Mbps) over
mobile
wide area
hosts

CSIT 561 (Fall 2010) Introduction 1-23

Wireless Technologies

coverage Bluetooth
WWAN (3G,4G?) UWB
RFID
WMAN (Wi-Max)

WLAN (Wi-Fi)

WPAN

CSIT 561 (Fall 2010) Introduction 1-24

Home Networks
Typical home network components:
• ADSL or cable modem
• Router/firewall/NAT
• Ethernet
• Wireless access point

wireless
laptops
to/from
cable router/
cable
modem firewall
headend
wireless
access
Ethernet point
CSIT 561 (Fall 2010) Introduction 1-25
Physical Media
Twisted Pair (TP)
• Bit: propagates between • Two insulated copper
transmitter/rcvr pairs wires
• Physical link: what lies – Category 3: traditional
between transmitter & phone wires, 10 Mbps
receiver Ethernet
– Category 5:
• Guided media:
100Mbps Ethernet
– Signals propagate in solid media:
copper, fiber, coax
• Unguided media:
– Signals propagate freely, e.g.,
radio

CSIT 561 (Fall 2010) Introduction 1-26

Physical Media: Coax, Fiber
Coaxial cable: Fiber optic cable:
• Two concentric copper  Glass fiber carrying light
conductors pulses, each pulse a bit
• Bidirectional  High-speed operation:
• Baseband:  High-speed point-to-point
– Single channel on cable transmission (e.g., 10’s-
– Legacy Ethernet 100’s Gps)
• Broadband:  Low error rate: repeaters
– Multiple channels on cable spaced far apart ; immune
– HFC to electromagnetic noise

CSIT 561 (Fall 2010) Introduction 1-27

Physical Media: Radio
• Signal carried in electromagnetic spectrum
• No physical “wire”
• Bidirectional
• Propagation environment effects:
– Reflection
– Obstruction by objects
– Interference
• Multipath propagation

Signal at Receiver

Signal at Sender

CSIT 561 (Fall 2010) Introduction 1-28

Physical Media: Radio

Radio link types:

• Terrestrial microwave
– e.g. up to 45 Mbps channels
• LAN (e.g., Wifi)
– 11Mbps, 54 Mbps
• Wide-area (e.g., cellular)
– e.g. 3G: hundreds of kbps
• Satellite
– Kbps to 45Mbps channel (or multiple smaller channels)
– 270 msec end-end delay
– Geosynchronous versus low altitude

CSIT 561 (Fall 2010) Introduction 1-29

Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
 End systems, access networks, links
1.3 Network core
 Circuit switching, packet switching, network structure
1.4 Delay, loss and throughput in packet-switched networks
1.5 Protocol layers, service models
1.6 Networks under attack: security
1.7 History

CSIT 561 (Fall 2010) Introduction 1-30

The Network Core
• Mesh of interconnected
routers
• The fundamental question:
how is data transferred
through net?
– Circuit-switching:
dedicated circuit per call:
telephone net
– Packet-switching: data
sent thru net in discrete
“chunks”
CSIT 561 (Fall 2010) Introduction 1-31
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

CSIT 561 (Fall 2010) Introduction 1-32

Network Core: Circuit Switching
Network resources (e.g.,  Dividing link bandwidth
bandwidth) divided into into “pieces”
“pieces”  Frequency division
• Pieces allocated to calls  Time division
• Resource piece idle if not
used by owning call (no
sharing)

CSIT 561 (Fall 2010) Introduction 1-33

Circuit Switching: FDM and TDM
Example:
FDM
4 users

frequency

time
TDM

frequency

CSIT 561 (Fall 2010)

time
Introduction 1-34
Network Core: Packet Switching
Each end-end data stream Resource contention:
divided 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
Dedicated allocation packet before forwarding
Resource reservation

CSIT 561 (Fall 2010) Introduction 1-35

 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, shared on

demand  statistical multiplexing
TDM: each host gets same slot in revolving TDM frame
CSIT 561 (Fall 2010) Introduction 1-36
 Packet-Switching: Store-and-Forward
L
R R R

• Takes L/R seconds to transmit Example:

(push out) packet of L bits on • L = 7.5 Mbits
to link or R bps • R = 1.5 Mbps
• Entire packet must arrive at • delay = 15 sec
router before it can be
transmitted on next link: store
and forward
• Delay = 3L/R (assuming zero
propagation delay)
more on delay shortly …

CSIT 561 (Fall 2010) Introduction 1-37

 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)

CSIT 561 (Fall 2010) Introduction 1-38

 Internet Structure: Network of Networks

• Roughly hierarchical
• At center: “tier-1” ISPs (e.g., Verizon, Sprint, AT&T, Cable and
Wireless), national/international coverage
– Treat each other as equals

Tier-1
providers
Tier 1 ISP
interconnect
(peer)
privately
Tier 1 ISP Tier 1 ISP

CSIT 561 (Fall 2010) Introduction 1-39

Tier-1 ISP: e.g., Sprint
POP: point-of-presence

to/from backbone

peering
… …
.
…
…

to/from customers

CSIT 561 (Fall 2010) Introduction 1-40

 Internet Structure: Network of Networks

• “Tier-2” ISPs: smaller (often regional) ISPs

– Connect to one or more tier-1 ISPs, possibly other tier-2 ISPs

Tier-2 ISPs
Tier-2 ISP pays Tier-2 ISP also peer
Tier-2 ISP privately with
tier-1 ISP for
connectivity to Tier 1 ISP each other.
rest of Internet
 Tier-2 ISP is
customer of
tier-1 provider Tier 1 ISP Tier 1 ISP Tier-2 ISP

Tier-2 ISP Tier-2 ISP

CSIT 561 (Fall 2010) Introduction 1-41

 Internet Structure: Network of Networks

• “Tier-3” ISPs and local ISPs

– Last hop (“access”) network (closest to end systems)

local
ISP Tier 3 local
local local
ISP ISP
ISP ISP
Local and tier- Tier-2 ISP Tier-2 ISP
3 ISPs are
customers of Tier 1 ISP
higher tier
ISPs
connecting
them to rest
Tier 1 ISP Tier 1 ISP Tier-2 ISP
of Internet
local
Tier-2 ISP Tier-2 ISP
ISP
local local local
ISP ISP ISP
CSIT 561 (Fall 2010) Introduction 1-42
 Internet Structure: Network of Networks

• A packet passes through many networks!

local
ISP Tier 3 local
local local
ISP ISP
ISP ISP
Tier-2 ISP Tier-2 ISP

Tier 1 ISP

Tier 1 ISP Tier 1 ISP Tier-2 ISP

local
Tier-2 ISP Tier-2 ISP
ISP
local local local
ISP ISP ISP
CSIT 561 (Fall 2010) Introduction 1-43
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
 End systems, access networks, links
1.3 Network core
 Circuit switching, packet switching, network structure
1.4 Delay, loss and throughput in packet-switched networks
1.5 Protocol layers, service models
1.6 Networks under attack: security
1.7 History

CSIT 561 (Fall 2010) Introduction 1-44

 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
CSIT 561 (Fall 2010) Introduction 1-45
Four Sources of Packet Delay
• 1. Nodal processing:  2. Queueing
– Check bit errors  Time waiting at output
– Determine output link link for transmission
 Depends on congestion
level of router

B
nodal
processing queueing

CSIT 561 (Fall 2010) Introduction 1-46

Delay in Packet-Switched Networks
3. Transmission delay:
• R=link bandwidth (bps)
• L=packet length (bits)
• Time to send bits into link
= L/R
4. Propagation delay:
• d = length of physical link
• s = propagation speed in
medium (~2x108 m/sec)
• propagation delay = d/s

Note: s and R are very

different quantities!
transmission
A
propagation

B
nodal
CSIT 561 (Fall 2010) processing queueing
Introduction 1-47
 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
• Toll booth takes 12 sec to onto highway = 12*10 = 120
service a car (transmission sec
time) • Time for last car to
• car~bit; caravan ~ packet propagate from 1st to 2nd
toll both:
• Q: How long until caravan is
100km/(100km/hr)= 1 hr
lined up before 2nd toll
booth? • A: 62 minutes
CSIT 561 (Fall 2010) Introduction 1-48
 Caravan Analogy (more)
100 km
ten-car toll
caravan booth
• 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?
100 km
toll
booth
• Yes! After 7 min, 1st car at 2nd
booth and 3 cars still at 1st
booth.
• 1st bit of packet can arrive at
2nd router before packet is
fully transmitted at 1st router!
– See Ethernet applet at AWL Web
site

CSIT 561 (Fall 2010) Introduction 1-49

Nodal Delay
d nodal  d proc  dqueue  d trans  d prop

• dproc = processing delay

– Typically a few microsecs or less
• dqueue = queuing delay
– Depends on congestion level in the router
• dtrans = transmission delay
– = L/R, significant for low-speed links
• dprop = propagation delay
– A few microsecs to hundreds of msecs

CSIT 561 (Fall 2010) Introduction 1-50

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!
CSIT 561 (Fall 2010) Introduction 1-51
“Real” Internet Delays and Routes

• What do “real” Internet delay & loss look like?

• T r a c e r o u t e 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

CSIT 561 (Fall 2010) Introduction 1-52

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
CSIT 561 (Fall 2010) Introduction 1-53
 Throughput
• Throughput: rate (bits/time unit) at which bits transferred
between sender/receiver
– Instantaneous: rate at given point in time
– Average: rate over long(er) period of time

server,
server sendswith link
bits pipe capacity
that can carry link that
pipe capacity
can carry
file of
(fluid) F bits
into pipe Rs bits/sec
fluid at rate Rfluid
c bits/sec
at rate
to send to client Rs bits/sec) Rc bits/sec)

CSIT 561 (Fall 2010) Introduction 1-54

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
CSIT 561 (Fall 2010) Introduction 1-55
 Throughput: Internet Scenario

Rs
• Per-connection end-end
Rs Rs
throughput:
min(Rc,Rs,R/10)
• In practice: Rc or Rs is R
often bottleneck
Rc Rc

Rc

10 connections (fairly) share

backbone bottleneck link R bits/sec
CSIT 561 (Fall 2010) Introduction 1-56
Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
 End systems, access networks, links
1.3 Network core
 Circuit switching, packet switching, network structure
1.4 Delay, loss and throughput in packet-switched networks
1.5 Protocol layers, service models
1.6 Networks under attack: security
1.7 History

CSIT 561 (Fall 2010) Introduction 1-57

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
– Hardware and networks?
software

CSIT 561 (Fall 2010) Introduction 1-58

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?

CSIT 561 (Fall 2010) Introduction 1-59

Internet Protocol Stack
• Application: supporting network
applications application
– FTP, SMTP, HTTP
• 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
– PPP, Ethernet
• Physical: bits “on the wire”

CSIT 561 (Fall 2010) Introduction 1-60

Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
 End systems, access networks, links
1.3 Network core
 Circuit switching, packet switching, network structure
1.4 Delay, loss and throughput in packet-switched networks
1.5 Protocol layers, service models
1.6 Networks under attack: security
1.7 History

CSIT 561 (Fall 2010) Introduction 1-61

Network Security
• Attacks on Internet infrastructure:
– Infecting/attacking hosts: malware, spyware, worms,
unauthorized access (data stealing, user accounts)
– Denial of service: deny access to resources (servers, link
bandwidth)

• 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!

CSIT 561 (Fall 2010) Introduction 1-62

What Can Bad Guys Do: Malware?
• Spyware:  Worm:
– Infection by downloading  Infection by passively
web page with spyware receiving object that gets
– Records keystrokes, web sites itself executed
visited, upload info to  Self-replicating: propagates
collection site to other hosts, users
• Virus Sapphire Worm: aggregate scans/sec
in first 5 minutes of outbreak (CAIDA, UWisc data)
– Infection by receiving object
(e.g., e-mail attachment),
actively executing
– Self-replicating: propagate
itself to other hosts, users

CSIT 561 (Fall 2010) Introduction 1-63

 Denial of Service Attacks
• 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 malware)
target
3. Send packets toward
target from
compromised hosts

CSIT 561 (Fall 2010) Introduction 1-64

Sniff, Modify, Delete Your 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
 Ethereal software used for end-of-chapter labs
is a (free) packet-sniffer
 More on modification,
CSIT 561 (Fall 2010)
deletion later
Introduction 1-65
Masquerade as you
• IP spoofing: send packet with false source address

A C

src:B dest:A payload

CSIT 561 (Fall 2010) Introduction 1-66

Masquerade as you
• IP spoofing: send packet with false source address
• 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

CSIT 561 (Fall 2010) Introduction 1-67

Masquerade as you
• IP spoofing: send packet with false source address
• Record-and-playback: sniff sensitive info (e.g., password),
and use later
– Password holder is that user from system point of view

later …..
C
A

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

CSIT 561 (Fall 2010) Introduction 1-68

Chapter 1: roadmap
1.1 What is the Internet?
1.2 Network edge
 end systems, access networks, links
1.3 Network core
 circuit switching, packet switching, network structure
1.4 Delay, loss and throughput in packet-switched networks
1.5 Protocol layers, service models
1.6 Networks under attack: security
1.7 History

CSIT 561 (Fall 2010) Introduction 1-69

Internet History
1961-1972: Early packet-switching principles
• 1961: Kleinrock - queueing The first link in the
theory shows effectiveness
SRI Internet backbone
of packet-switching crash
• 1964: Baran - packet- UCLA
switching in military nets
• 1967: ARPAnet conceived
by Advanced Research
The first message: LO!
Projects Agency
• 1969: first ARPAnet node What was the first message ever
operational sent on the Internet? (LOGIN)

 We sent an “L” - did you get the “L”? YEP!

 We sent an “O” - did you get the “O”? YEP!
 We sent a “G” - did you get the “G”?

CSIT 561 (Fall 2010) Introduction 1-70

Internet History
1961-1972: Early packet-switching principles
• The Internet is Born! at • 1972:
UCLA on October 29, 1969 – ARPAnet public demonstration
• What it looked like at the – NCP (Network Control Protocol)
end of 1969 first host-host protocol
– First e-mail program
– ARPAnet has 15 nodes

CSIT 561 (Fall 2010) Introduction 1-71

 Internet History
1972-1980: Internetworking, new and proprietary nets
• 1970: ALOHAnet satellite network
in Hawaii
• 1974: Cerf and Kahn - architecture
for interconnecting networks
• 1976: Ethernet at Xerox PARC
• ate70’s: proprietary architectures:
DECnet, SNA, XNA
• late 70’s: switching fixed length
packets (ATM precursor)
• 1979: ARPAnet has 200 nodes
Cerf and Kahn’s internetworking
principles:
– minimalism, autonomy - no
internal changes required
to interconnect networks
– best effort service model
– stateless routers
– decentralized control
define today’s Internet
architecture

CSIT 561 (Fall 2010) Introduction 1-72

Internet History
1980-1990: new protocols, a proliferation of networks

• 1983: deployment of • New national networks:

TCP/IP Csnet, BITnet, NSFnet,
• 1982: SMTP e-mail Minitel
protocol defined • 100,000 hosts connected
• 1983: DNS defined for to confederation of
name-to-IP-address networks
translation
• 1985: FTP protocol
defined
• 1988: TCP congestion
control
CSIT 561 (Fall 2010) Introduction 1-73
Internet History
1990, 2000’s: commercialization, the Web, new apps
• Early 1990’s: ARPAnet Late 1990’s – 2000’s:
decommissioned
• More killer apps: instant
• 1991: NSF lifts restrictions on messaging, P2P file sharing
commercial use of NSFnet
• Network security to forefront
(decommissioned, 1995)
• Est. 50 million host, 100 million+
• Early 1990s: Web
users
– Hypertext [Bush 1945, Nelson
• Backbone links running at Gbps
1960’s]
– HTML, HTTP: Berners-Lee
– 1994: Mosaic, later Netscape
– Late 1990’s: commercialization of
the Web

CSIT 561 (Fall 2010) Introduction 1-74

Internet History

2007:
• ~500 million hosts
• Voice, Video over IP
• P2P applications: BitTorrent (file
sharing), Skype (VoIP), PPLive
(video)
• More applications: YouTube,
gaming
• Wireless, mobility

CSIT 561 (Fall 2010) Introduction 1-75

Introduction: Summary
Covered a “ton” of material!
You now have:
• Internet overview
• Context, overview, “feel”
• What’s a protocol? of networking
• Network edge, core, access • More depth, detail to
network follow!
– Packet-switching versus
circuit-switching
– Internet structure
• Performance: loss, delay,
throughput
• Layering, service models
• Security
• History
CSIT 561 (Fall 2010) Introduction 1-76