EECE 450 Computer Networks: J.F Kurose and K.W. Ross, All Rights Reserved

EECE 450
Computer Networks
Chapter 1
Introduction
All material copyright 1996-2007

J.F Kurose and K.W. Ross, All Rights Reserved 1-1
Course Topics
1. Chapter 1: Computer Networks and
the Internet
application
2. Chapter 2: Application Layer
transport
3. Chapter 3: Transport Layer
network
4. Chapter 4: The Network Layer
link
5. Chapter 5: The Link Layer and Local
Area Networks physical
Textbook: Computer Networking: A Top-Down Approach

Featuring the Internet, 4th edition, James Kurose and Keith
Ross 1-2
Chapter 1: Introduction
Our goal: Overview:
Get “feel” and What’s the Internet?
terminology
Network edge: hosts, access
More depth, detail net, physical media
later in course
Network core: packet/circuit
switching, Internet structure
Approach: Performance: loss, delay,
useInternet as throughput
example Internet protocol stack
1-3
What is the Internet?
PC Millions of connected Mobile network
server computing devices: Global ISP
hosts = end systems
wireless
laptop running network apps
cellular
handheld Home network
Regional ISP
Communication links
access
fiber, copper, radio,
points satellite Institutional network
wired transmission rate =
links
bandwidth
Routers
router
forward packets (chunks
of data)
1-4
What is the Internet?
Protocols Mobile network
control sending, receiving of msgs Global ISP
e.g., TCP, IP, HTTP, Skype,
Ethernet
Home network
Internet:
Regional ISP
“network of networks”
loosely hierarchical
public Internet versus private Institutional network
intranets
Internet standards
RFC: Request for comments
IETF: Internet Engineering Task Force
(http://www.ietf.org)
1-5
What is the Internet: A Service View
Communication infrastructure:
enables distributed applications
e.g. web, VoIP, email, games, file

sharing, e-commerce
Communication services
provided to apps:
reliable data delivery from source
to destination
“best effort” (unreliable) data

delivery
1-6
A Closer Look at Network Structure
Network edge:
applications and hosts
Access networks and

physical media:
wired and wireless
communication links
Network core:
interconnected routers
network of networks
1-7
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; client/server
email client/server
Peer-to-peer model:
minimal (or no) use of
dedicated servers
e.g. Skype, BitTorrent
1-8
Network Edge: Reliable Data Transfer
Service
Goal: data transfer TCP service [RFC 793]
between end systems Reliable, in-order byte-stream
Handshaking: setup (prepare data transfer
for) data transfer ahead of loss: acknowledgements
time and retransmissions
hello, hello back human
Flow control:
protocol
sender won’t overwhelm
set up “state” in two
receiver
communicating hosts
Congestion control:
TCP: Transmission
Control Protocol senders “slow down sending
rate” when network
Internet’s reliable data congested
transfer service
Chapter 3 1-9
Network Edge: Unreliable Best Effort Data
Transfer Service
Goal: data transfer App’s using TCP:
between end systems HTTP (Web)
same as before FTP (file transfer)

Telnet (remote login)
SMTP (email)
UDP: User Datagram
Protocol [RFC 768]
App’s using UDP:
connectionless
streaming media
unreliable data transfer
teleconferencing
no flow control
Internet telephony (VoIP)
no congestion control
DNS
Chapter 3 Chapter 2
1-10
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?
wired or wireless?
shared or dedicated?
1-11
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
1-12
Residential Access: Cable Modems
HFC: hybrid fiber coax
asymmetric: up to 30Mbps downstream, 2 Mbps
upstream
Network of cable and fiber attaches homes to ISP
router
homes share access to router
Deployment: available via cable TV companies
1-13
Company Access: Local Area Networks
Company/university local area
network (LAN) connects end
system to edge router
Ethernet protocol:
10 Mbs, 100Mbps, 1Gbps, and
10Gbps Ethernet
modern configuration: end
systems connect into Ethernet
switch
Chapter 5 1-14
Wireless Access Networks
Shared wireless access network
router
connects end system to router
via base station aka “access point” base
Wireless LANs: station
802.11b/g (WiFi): 11 or 54 Mbps

802.11n: 100’s Mbps
Wider-area wireless access: mobile
provided by telco operator hosts
Cellular (GSM/EGPRS, UMTS/HSPA): up to 10 Mbps

WiMAX: 10’s Mbps
EECE640 Wireless Communications 1-15

Home Networks
Typical home network components:
DSL or cable modem
Router/firewall/NAT
Ethernet
Wireless access point
wireless
to/from laptops
cable router/
cable
modem firewall
headend
wireless
access
Ethernet point
Chapter 4 1-16
Physical Media
Bit: Twisted Pair (TP)
propagates between Two insulated copper
transmitter/rcvr pairs wires
Physical link: Category 3 (CAT 3):
what lies between • traditional phone wires
transmitter and receiver • 10 Mbps Ethernet
Guided media: Category 5 (CAT 5):
signals propagate in solid • 100Mbps Ethernet
media: copper, fiber, coax
Unguided media:
signals propagate freely,
e.g., radio
1-17
Physical Media
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-
100’s Gbps)
broadband:
low error rate: repeaters
multiple channels on
spaced far apart
cable
long distances (10’s Km)
HFC
1-18
Physical Media: Unguided
No “physical” wire, i.e. wireless
Bidirectional
Signal carried in electromagnetic spectrum
2.4 GHz, 5 GHz (Bluetooth, WiFi)
2 GHz to 40 GHz (Microwave, satellite)
900 MHz to 2 GHz (Cellular)
30 MHz to 1 GHz (Broadcast radio)
Propagation environment effects:
Reflection
Obstruction by objects
Interference
1-19
Our goal: Overview:
terminology
later in course
1-20
The Network Core
Mesh of interconnected
routers
The fundamental question:
How is data transferred
through net?
Circuit switching:
dedicated circuit per
call
Packet-switching:
data sent thru net in
discrete “chunks”
Chapter 4 1-21
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-22
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
1-23
Circuit Switching: FDM and TDM
Example:
FDM
4 users
frequency
time
TDM
frequency
time
1-24
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 Mbps
Each link uses TDM with 20 slots/sec
500 msec to establish end-to-end circuit
Let’s work it out!

Allocated rate: 1Mbps/20slots=50Kbps
Delay = 0.5+640000/50000 = 13.3sec
1-25
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
1-26
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 and B packets does not have fixed pattern,

bandwidth shared on demand · statistical multiplexing
TDM: each host gets same slot in revolving TDM frame
1-27
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 = ?
Store and forward:
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-28
Packet Switching versus Circuit Switching:
The winner is…
Given:
1 Mbps link
Each user:
100 kbps when “active”
active 10% of time
N users
Circuit switching:
? users
1 Mbps link
Packet switching:
? users
1-29
Packet Switching versus Circuit Switching:
The winner is…
Given:
1 Mbps link
Each user:
100 kbps when “active”
active 10% of time
N users
Circuit switching:
10 users
1 Mbps link
Packet switching:
with 35 users, probability
> 10 active at the same
time is less than .0004 Q: how did we get value 0.0004?
1-Prob(active≤10)=1-(Prob(0)+Prob(1)+…+Prob(10)),
1-30
Prob(i)=(0.1^i)*(0.9^(35-i))*Combination(i out of 35)
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
protocolsneeded for reliable data transfer,
congestion control
Q: How to provide circuit-like behavior?
Bandwidth guarantees needed for audio/video apps
Still a topic under research
1-31
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
1-32
Tier-1 ISP: E.g. Sprint
POP: point-of-presence
to/from backbone
peering
… …
.
…
…
to/from customers
1-33
“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 ISP Tier 1 ISP Tier-2 ISP
tier-1 provider
Tier-2 ISP Tier-2 ISP
1-34
“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
of Internet
Tier 1 ISP Tier-2 ISP
local
ISP
local local local
ISP ISP ISP 1-35
A packet passes through many many networks!
local
ISP Tier 3 local
local local
ISP ISP
ISP ISP
Tier 1 ISP
Tier 1 ISP Tier 1 ISP Tier-2 ISP

local
ISP
local local local
ISP ISP ISP 1-36
Our goal: Overview:
terminology
later in course
1-37
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) buffer: arriving packets
dropped (loss) if no free buffers
1-38
Four Sources of Packet Delay
1. Processing delay: 2. Queuing delay:
Check bit errors Time waiting at output
Determine output link link for transmission
Depends on congestion
level of router
transmission
A propagation
B
nodal
processing queueing
1-39
Queueing Delay
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!
1-40
Four Sources of Packet Delay
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
link = L/R Propagation delay = d/s
transmission
A propagation
B
nodal Note: s and R are very
processing queueing different quantities!
1-41
Total Delay
d total = dproc + d queue + d trans + dprop
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
1-42
Caravan Analogy
100 km 100 km
ten-car toll toll
caravan booth booth
Cars “propagate” at 100 km/hr Time to “push” entire caravan

Toll booth takes 12 sec to
through toll booth onto
service car (transmission time) highway = 12*10 = 120 sec
Analogy: Time for last car to propagate

from 1st to 2nd toll both:
car ~ bit
100km/(100km/hr)= 1 hr
caravan ~ packet
A: 62 minutes
Q: How long until caravan is
lined up before 2nd toll booth?
1-43
Caravan Analogy
100 km 100 km
ten-car toll toll
caravan booth booth
Cars now “propagate” at Yes! After 7 min (1min

1000 km/hr service+6min propagation),
Toll booth now takes 1 min 1st car at 2nd booth and 3
to service a car cars still at 1st booth.
Q: Will cars arrive to 2nd
booth before all cars 1st bit of packet can
serviced at 1st booth? arrive at 2nd router
before packet is fully
transmitted at 1st router!
1-44
Jitter
Variation in latency between packets is called jitter
also called interpacket gap
sometimes more important than the latency
relevant in multihop packet switched networks
How to deal with jitter?
case 1: packet arrives earlier than expected
case 2: packet arrives later than expected
Interpacket gap
4 3 2 1 4 3 2 1
Packet Packet
source
Network sink
1-45
Packet loss
Queue (aka buffer) preceding link 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
1-46
“Real” Internet Delays and Routes
What do “real” Internet delay and loss look like?
Traceroute program: provides delay measurement
from source to router along end-to-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 (round
trip time – RTT)
3 probes 3 probes
3 probes
1-47
“Real” Internet Delays and Routes
Run traceroute from 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
http://www.traceroute.org 1-48
Throughput
Throughput: rate (bits/time unit) at which bits
transferred between sender/receiver
instantaneous: rate at given point in time
average: rate over a given 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 c bits/sec
Rfluid at rate
to send to client Rs bits/sec Rc bits/sec
1-49
Throughput
Rs < Rc What is average end-to-end throughput?
Rs bits/sec Rc bits/sec
Rs > Rc What is average end-to-end throughput?
Rs bits/sec Rc bits/sec
bottleneck link
link on end-end path that constrains end-end throughput
1-50
Throughput: Internet Scenario
Per-connection end-
to-end throughput:
min(Rc,Rs,R/10) Rs
Rs Rs
In practice: Rc or Rs is
often bottleneck
R
Rc Rc
Rc
10 connections (fairly) share

backbone bottleneck link R bits/sec
1-51
Our goal: Overview:
terminology
later in course
1-52
Protocol “Layers”
Networks are complex!
Many many “pieces”:
hosts
routers Question:
links of various media Is there any hope of
applications organizing the structure
protocols of networks?
hardware, software
Many requirements:
Or at least our discussion
connectivity
of networks?
reliability
scalability
performance
1-53
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
1-54
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
1-55
Why Layering?
Dealing with complex systems:
Explicit structure: allows identification, relationship of
complex system’s pieces
Modularity: eases maintenance, updating of system
change of implementation of layer’s service
transparent to rest of system
e.g.,change in gate procedure does not affect rest
of system
Layering considered harmful?
1-56
ISO/OSI 7 Layer Reference Model
International Standards Organization (ISO)
Open Systems Interconnection (OSI)
End host End host
Application Application
Presentation Presentation
Session Session
Transport Transport
Network Network Network Network
Data link Data link Data link Data link
Physical Physical Physical Physical
One or more nodes 1-57

within the network
Internet Protocol Stack
Application: supporting network apps
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
PPP, Ethernet
Physical: bits “on the wire” or “in the
air” 1-58
Internet vs. OSI: Missing Layers
Presentation: allow applications to
interpret meaning of data, e.g.,
encryption, compression, machine- application
specific conventions presentation
Session: synchronization, check- session
pointing, recovery of data exchange transport
Internet stack “missing” these network
layers!
link
these services, if needed, must
physical
be implemented in application
1-59
Internet Layering with Protocols
POP HTTP DNS TFTP
TCP UDP
IP
Ethernet WiFi … PPP
1-60
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
1-61
Our goal: Overview:
terminology
later in course
What’s next?
1-62

EECE 450 Computer Networks: J.F Kurose and K.W. Ross, All Rights Reserved

Transféré par

Informations du document

Description originale:

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

EECE 450 Computer Networks: J.F Kurose and K.W. Ross, All Rights Reserved

Transféré par

Droits d'auteur :

Formats disponibles

EECE 450

All material copyright 1996-2007

 Textbook: Computer Networking: A Top-Down Approach

 e.g. web, VoIP, email, games, file

 “best effort” (unreliable) data

 Access networks and

 same as before  FTP (file transfer)

 DSL: Digital Subscriber Line

 802.11b/g (WiFi): 11 or 54 Mbps

 Cellular (GSM/EGPRS, UMTS/HSPA): up to 10 Mbps

EECE640 Wireless Communications 1-15

 Resource piece idle if

Let’s work it out!

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

Tier 1 ISP Tier 1 ISP Tier-2 ISP

packet being transmitted (delay)

Traffic intensity = La/R

 La/R ~ 0: average queueing delay small

 Cars “propagate” at 100 km/hr  Time to “push” entire caravan

 Analogy:  Time for last car to propagate

 Cars now “propagate” at  Yes! After 7 min (1min

 Rs > Rc What is average end-to-end throughput?

10 connections (fairly) share

ticket (purchase) ticket (complain)

baggage (check) baggage (claim)

gates (load) gates (unload)

runway takeoff runway landing

airplane routing airplane routing

ticket (purchase) ticket (complain) ticket

baggage (check) baggage (claim baggage

gates (load) gates (unload) gate

runway (takeoff) runway (land) takeoff/landing

departure intermediate air-traffic arrival

Layers: each layer implements a service

End host End host

Network Network Network Network

Data link Data link Data link Data link

Physical Physical Physical Physical

One or more nodes 1-57

POP HTTP DNS TFTP

Ethernet WiFi … PPP

Vous aimerez peut-être aussi

Textbook: Computer Networking: A Top-Down Approach

e.g. web, VoIP, email, games, file

“best effort” (unreliable) data

Access networks and

same as before FTP (file transfer)

DSL: Digital Subscriber Line

802.11b/g (WiFi): 11 or 54 Mbps

Cellular (GSM/EGPRS, UMTS/HSPA): up to 10 Mbps

Resource piece idle if

La/R ~ 0: average queueing delay small

Cars “propagate” at 100 km/hr Time to “push” entire caravan

Analogy: Time for last car to propagate

Cars now “propagate” at Yes! After 7 min (1min

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