Professional Documents
Culture Documents
Introduction
Ivan Marsic
Rutgers University
Chapter 1 Introduction
Topic:
Introduction to Data
Networking
Goals
Communication Media
Protocols
Reliable Transmission
User Goals and Tunable Knobs
Customer
Network
Engineer
Topology vs. Robustness
Paul Baran, 1964
Node
Link
cover of
The New Yorker
March 29, 1976
Distortion of Signals
Line noise
threshold "0"/"1"
Packet Error Rate Approximation
delay
propagation
Electro
magne
tic wav
e propag
delay
transmission
ation
101101
End of reception
1 0 1 1 0 0 1
Link 1:
1 Mbps
1s
1 0 1 1 00 1
Time
Link 2:
10 Mbps
100ns
Interference
pattern
Radio Signal Propagation
Ray tracing
simulation in a door
closed office
environment.
Signal intensity
map for a room
with a doorway
and a metal desk
desk
Transmission / Interference Range
Interfering
C
source
Interference
range
Transmission
D
range Interfering
source
B
A Receiver
Sender Interfering
E source
Layer i 1
User-to-user interactions
obey social norms
Letter
(Message)
Customer interaction obeys
Person A mail acceptance and delivery Person B
procedures (Postal Services
Mail Manual)
Letter in Postal-vehicle
envelope service-transportation
(Packet) routes obey carrier-
route maps and
delivery timetables
City A
City D
3-Layer Protocol Stack
Protocol at layer i depends only on the protocols at i1 (not at i1!)
Layered architecture Layer function Examples
Application specific connections
Transmission Control
3: End-to-End Protocol (TCP)
Real-time Transport
Protocol (RTP)
Packet exchange
Link Layer:
Protocol modules at layer 1 (bottom layer) exchange packets over the link
Layer 2 / 3-Layer Protocol Stack
Network Layer:
Protocol modules at layer 2 (middle layer) route packets from source
to destination (possibly over many links)
Layer 3 / 3-Layer Protocol Stack
Applications:
Network games
Internet telephony
Email
End-to-End Layer:
Protocol modules at layer 3 (top layer) create illusion of different link types
(tailored to application-specific needs)
Protocol Layers at Hosts/Switches
Physical setup: Intermediate
node (router)
End host A End host B
Communication link
Communication link
Protocol stack:
Application Application
3: End-to-End End-to-End :3
Application
7: Application services (SIP, FTP,
HTTP, Telnet, )
Dialog control
5: Session Synchronization
Reliable (TCP)
4: Transport Real-time (RTP)
Source-to-destination (IP)
3: Network Routing
Address resolution
Radio spectrum
Infrared
1: Physical Fiber
Copper
Packet Nesting Across Layers
Senders Receivers
Application data Application data
protocol stack protocol stack
Layer-3 Layer-3
Layer-3 payload Layer-3 payload
header header
Layer-2 Layer-2
Layer-2
Application
payload
data Layer-2
Application
payload
data
header header
Layer-1 Layer-1
Layer-1
Application
payloaddata Layer-1
Application
payloaddata
header header
Physical
communication
010010110110001011100100101100000101101 010010110110001011100100101100000101101
How Headers Guide Packets
Sender Endpoint Receiver Endpoint
At router, each layer examines only
2 its own header:
1. Routers Link layer protocol checks
Application that this packet is for this node Application
2. Routers Network layer protocol decides
the outgoing link based on destin. addr.
Packet:
Link Network End-end Link Network End-end
Application data Application data
layer hdr layer hdr layer hdr layer hdr layer hdr layer hdr
24 25 26 27 28 29 30 31 32 33 34 35 36
23
20 25
13 17
18 21 27 29
15 24
2 10 16 19 22 32
7 12
28 30 35
4 9 14 26 33
31
0 6
3 11 34
8
5 36
1
60 58 38 40 39
57 55 50 46 37
59 52 48 43 42 41
54
56
45 44
53 51
49 47
Interleaving
All science is either physics or stamp collecting.
Forward
interleaving:
theme illicts scenic graphics since poorest Ally.
A ll s c ie n c e i s e ith e r p h y s ic s o r s ta m p c o ll e c ti n g
detail
t h e m e i l l i c t s s c e ni c g r a p h ic s s i nc e p o o r es t All y
transmission Data
delay propagation
delay
ACK
processing
delay
processing
delay
Data
Transmission and Propagation
Delays
Transmission delay:
Propagation delay:
distance d (m)
tp
velocity v (m/s)
Fluid Flow Analogy
Layer 2 Layer 2
sender receiver
Layer 1
sender
Queued Layer 1
buckets
receiver
What Contributes to RTT
Sender Receiver
Stop-and-Wait
Go-Back-N
Selective Repeat
Automatic Repeat reQuest (ARQ)
Stop-and-wait ARQ
Transmit a frame and wait for acknowledgement (ACK)
If positive ACK from receiver, send next frame
If ACK does not arrive after a certain period of time (Timeout), retransmits the frame
Simple, low efficiency
Go-back-N ARQ
Transmit frames continuously, no waiting
The receiver only ACKs the highest-numbered frames received in sequence
ACK comes back after a round-trip delay
If timeout, the sender retransmits the frames that are not ACKed and N1 succeeding frames that
were transmitted during the round-trip delay (N frames transmitted during a round-trip delay)
Need buffer at sender, does not have to buffer the frames at the receiver,
Moderate efficiency and complexity. Less efficient when the round-trip delay is large and data
transmission rate is high
Selective-repeat ARQ
Transmit continuously, no waiting
The receiver ACKs all successfully received frames
The sender only retransmits (repeats) the unACKed frames when their timers expire
Most efficient, but most complex, buffer needed at both sender & receiver, needs per-frame timer
Stop-and-Wait with Errors
Sender Receiver
Packet i
Time
timeout
time
Timer expires Packet i (retransmission)
Resend data (error)
2nd attempt
Packet i (retransmission)
(error)
k-th attempt
RTT ACK
Receive ACK Received
Reset timer error-free
Stop & Wait Sender Utilization
Stop & Wait sender utilization, under error-free transmission:
tx
S &W
U sender
tx 2 t p
psucc 1 peDATA 1 peACK
Expected sender utilization for Stop & Wait, under errors:
E S &W
U sender
t x E{N}
tx
E{T } psucc tsucc pfail tfail
total
Sliding Window Keeping the Pipe
Full
1 2 3 4 5 6 7 8 9 10 11
Timeout for Pkt-1 discard Pkt-3
Ack-0
0 1 2 3 4 5 6 7 8 9 10
1 2 3 4 5 6 7 8 9 10 11 Pkt-1
s )
Pkt-2
s ion
is
1 2 3 4 5 6 7 8 9 10 11 Pkt-3 nsm 1 2 3 4 5 6 7 8 9 10
tr a Ack-1
(re
Ack-2 2 3 4 5 6 7 8 9 10
(loss) Ack-3 3 4 5 6 7 8 9 10
2 3 4 5 6 7 8 9 10 11
Pkt-4
4 5 6 7 8 9 10 11 Pkt-5
4 5 6 7 8 9 10
Ack-4
4 5 6 7 8 9 10 11 Pkt-6
Selective Repeat ARQ
Sender window N = 3 Sender Receiver window W = 3
0 1 2 3 4 5 6 7 8 9 10 11 Pkt-0 0 1 2 3 4 5 6 7 8 9 10
Pkt-1
0 1 2 3 4 5 6 7 8 9 10 11 Pkt-2 (loss) 0 1 2 3 4 5 6 7 8 9 10
Ack-0
0 1 2 3 4 5 6 7 8 9 10
Ack-2
0 1 2 3 4 5 6 7 8 9 10 11 Pkt-3 buffer Pkt-2
1 2 3 4 5 6 7 8 9 10 11
0 1 2 3 4 5 6 7 8 9 10
Ack-3
Timeout for Pkt-1
buffer Pkt-3
Pkt-1 (re
1 2 3 4 5 6 7 8 9 10 11 trans mission)
Ack-1
0 1 2 3 4 5 6 7 8 9 10
4 5 6 7 8 9 10 11 Pkt-4
4 5 6 7 8 9 10 11 Pkt-5
4 5 6 7 8 9 10 11 Pkt-6
Ack-4 0 1 2 3 4 5 6 7 8 9 10
Ack-5 0 1 2 3 4 5 6 7 8 9 10
Acknowledgements: GBN vs. SR
Sender Receiver Sender Receiver
1234567
Pkt-1
Pkt-6
1234567
01234567
Ack-1
discard
duplicate Pkt-1
(a) Go-back-N (b) Selective Repeat
Topic:
Broadcast and Wireless Links
ALOHA
Hidden and Exposed Stations
Carrier Sensing Multiple Access
CSMA/CD, CSMA/CD
Time Transmission Cone
Sender Receiver Sender
TRANSMISSION
TRANSMISSION
Distance
Omnidirectional Simplified
transmission representation
in 3D in 2D
PROPAGATION
Receiver
RECEPTION
RECEPTION
Distance from sender
(a) Time (b)
Transmission Cone, Collision
& Vulnerable Period
Distance from the Receiver B (b)
Collision occurs if two Receiver
(or more) transmission A B C
cones overlap.
A
C
(a)
Time A A A
Receiver B Receiver B Receiver B
C C C
Distance
Bs
transmission Bs
transmission
sion
colli
As
As As
transmission
transmission transmission
sion
colli
Cs
transmission
Time Cs Time
(c) transmission (d) (e)
Parameter
t p max d max R
tx vL
Parameter
Ratio of propagation delay vs. packet transmission time
propagation
(b) delay =
119.3 ms
START
HERE:
New packet
ready
ALOHA Packet Transmission
Data period
(for receiving data from A)
vulnerable period
for pure ALOHA = 2 packet-time
When transmission cones of
ALOHA stations overlap?
A collides with an earlier transmission from B
tstart(A)
tstart(A)
tstart(B)
Fresh station
System
Receiver
Receiver Backlogged station
Transmission Attempts = G
/m
User
1 /m
User m
/m /m
User
2 System Input = m =
m
Backlogged Stations
/m
Fresh Station
/m
Backlogged Station
Analysis of Slotted ALOHA (1)
G GP0
Channel S
Collided packets
(to be retransmitted)
Analysis of Slotted ALOHA (2)
Throughput =
arrival rate probability of no collision
Slotted ALOHA throughput:
S G P0 G P A(t 1) A(t ) 0 G e G
0.2
Pure ALOHA: S = Ge2G
0.1
i
Hidden Stations
Range of As B B
transmissions A C A C
Range of Cs
transmissions
A is transmitting to B.
C wants to transmit and listens before talk but cannot hear A
because A is too far away
(As radio signal is too weak for C to hear,
so A and C are hidden stations to each other).
C concludes that the medium is idle and transmits,
thus interfering with Bs reception.
Exposed Stations
B D B D
A C A C
B is transmitting to A.
C wants to transmit to D, it listens before talk and hears B
so it refrains from transmitting although its transmission
would not interfere with As reception.
Key idea:
increasing number of choices reduces the probability of repeated collisions
m
(one transmits , others don' t ) m q 1 q
m 1
p succ
1
tx L/ R 1
CSMA/CD
t x w L / R 2 / p succ 1 2 e R / L
CSMA/CD Collision Detection
STA 1 STA 2
Both stations are listening
t1
t2
STA2 begins
transmission
t3
STA2 detects
collision and
transmits
t4 jam signal
STA1 detects
collision before
ending transmission
t5
CSMA/CD Backoff Example
Previous CW STA1 = 2 CW STA1 = 4 CW STA1 = 8
Key:
frame
Collision (abort
transmission)
STA 1
1 0 1 0 3 2 1 0
Jam signal
=2 =4 =0 CW STA2 = 2
2 TA2 TA2
CW ST
A
CW S CW S CW STA2 = 0 Backoff slot
STA2, 1st frame STA2
STA 2 2nd frame
0 0 1 0
STA 3
0 2 1 0 3 2 1 0
Time
CW STA1 = 16
STA1, 1st frame
6 5 4 3 2 1 0
CW STA3 = 16 CW STA3 = 0
1.0
Nonpersistent
S (throughput per packet time)
CSMA/CD
Nonpersistent
0.8 = 0.01
CSMA
0.6
1-persistent CSMA
(b) 0.4
Slotted
0.2 ALOHA
Pure ALOHA
Maximum channel
Average packet delay
transmission rate
TDMA
CSMA/CA
ALOHA
CSMA/CD
Network
ports
Example Internetwork
Network 3:
C
A Ethernet
C Interfaces on
R1 A Network 2
D
B Network 2: D
Wi-Fi Interfaces on R1
Network 3
Network 1:
Interfaces on
Point- to-point
Network 1
B
R2 Interfaces on
Network 4: Network 4
Point-to-point Network 5: Ethernet R2
Interfaces on
Network 5
(a) E F (b) E F
Protocol Stack at
End-points vs. Routers
Layer 1: Layer 1:
Link Link
Routing Problem
Forwarding table
Interface 2
(a) Interface 1
Interface 3
Packets
Interface 4
Forwarding table
(b) Destination
ece.rutgers.edu
Output Interface
Interface 3
cs.rutgers.edu Interface 2
ts
cke Router
Pa
Network-layer Protocol:
Internet Protocol (IP)
Sender Receiver
send() handle()
IP protocol IP protocol
data
Dotted Decimal Notation for IPv4
DNS server
User Web server
DNS client
www.comp.org
(a)
Wi-Fi
Host D
Host A MTU = 1024 bytes
Router B
point-to-point
Router C
Ethernet
JPEG image
1.5 Kbytes Host A
1,536 bytes
JPEG
Image pixels
header
Application
Router B 1,200 bytes
Source 4 Node
node A C
Tentative
25 nodes Unconfirmed
Set of confirmed
nodes N0 (A) Node Node nodes N N0(A)
D 6 F
Step 1 Step 2 1
1 B E
B E
7 1 7 1
4 4
A C A C
A 1 D A 1 D A 1 D A D
1 7 1 7 1 7 1 7
C C 1 C C
(B, 10, B), As LSA says that B and C are reachable at costs
1 (A, 0, ) (C, 1, C) 10 and 1, respectively. Since these are currently
the lowest known costs, put on Tentative(A) list.
Move lowest-cost member (C) of Tentative(A)
2 (A, 0, ), (C, 1, C) (B, 10, B) into Confirmed set. Next, examine LSA of
newly confirmed member C.
B
As LSA
10 re-broadcast from B
As LSA A D
broadcast from node A
Node
Seq.# Neighbor B C
ID As LSA
=1 Cost 10 1 1
=A
re-broadcast from C
C
Example Link State (2)
LSA from node B (sent to A, C, D)
Node
Seq.# Neighbor A C D B
ID
=1 Cost 10 1 1
=B
A 1 D
LSA from node A
Node
Seq.# Neighbor B C
ID
=1 Cost 10 1 7
=A
1
(sent to B, C) LSA from node C
Node
Seq.# Neighbor A B D
ID
=1 Cost 1 1 7
C =C
Network Routing: Distance Vector
29
4 Neighbor Destin
Source
2 ation
25
Neighbor
3
8
DX Y min c( X ,V ) DV (Y )
V ( X )
Example - Distance Vector
B
10 1
A 1 D
1 7
C
Routing table at node A: Initial Routing table at node A: After 1st exchange
Distance to Received Distance Vectors Distance to
A B C A B C D A B C D
From B
A 0 10 1 10 0 1 1 A 0 2 1 8
From
B B 10 0 1 1
From
A B C D
From C
C 1 1 0 7 C 1 1 0 7
Example - Distance Vector
DA (C ) min c( A, B) DB (C ), c( A, C ) DC (C ) min 10 1, 1 0 1
at node A A B C A B C D A B C D A B C D
A 0 10 1 A 0 2 1 8 A 0 2 1 3 A 0 2 1 3
From
From
From
From
B B 10 0 1 1 B 2 0 1 1 B 2 0 1 1
C C 1 1 0 7 C 1 1 0 2 C 1 1 0 2
A B C D A B C D A B C D A B C D
at node B
A A 0 10 1 A 0 2 1 8 A 0 2 1 3
B 10 0 1 1 B 2 0 1 1 B 2 0 1 1 B 2 0 1 1
From
From
From
From
C C 1 1 0 7 C 1 1 0 2 C 1 1 0 2
D D 1 7 0 D 8 1 2 0 D 3 1 2 0
A B C D A B C D A B C D A B C D
at node C
A A 0 10 1 A 0 2 1 8 A 0 2 1 3
B B 10 0 1 1 B 2 0 1 1 B 2 0 1 1
From
From
From
From
C 1 1 0 7 C 1 1 0 2 C 1 1 0 2 C 1 1 0 2
D D 1 7 0 D 8 1 2 0 D 3 1 2 0
B C D A B C D A B C D A B C D
at node D
B B 10 0 1 1 B 2 0 1 1 B 2 0 1 1
From
From
From
From
C C 1 1 0 7 C 1 1 0 2 C 1 1 0 2
D 1 7 0 D 8 1 2 0 D 3 1 2 0 D 3 1 2 0
Example DV Routing Loops
Scenario 2:
Original network Link BD outage
B B
10 1 10
A 1 D A 1 D
1 7 1 7
C C
Routing table at node B before BD outage Routing table at node B after BD outage
Distance to Distance to
1. B detects BD outage
A B C D 2. B sets c(B, D) = A B C D
A 0 2 1 3 3. B recomputes its A 0 2 1 3
distance vector
B 2 0 1 1 4. B obtains 3 as the From
B 2 0 1 3
From
shortest distance
C 1 1 0 2 to D, via C C 1 1 0 2
D 3 1 2 0 D 3 1 2 0
Topic:
IP Addressing and CIDR
BLOOMFIELD 91 mi.
NEWARK 85 mi.
Paterson
KEARNY 89 mi.
Bloomfield
East Orange Fort Lee
Union
ELIZABETH 80 mi. Irvington
City
Newark
Allentown Elizabeth New York
PATERSON 99 mi.
Bayonne
Linden
LINDEN 80 mi.
Princeton
compared to
Philadelphia
OLD IPv4 Address Structure
Class B 16,384 (first two bits fixed to 10" for "Class B")
Class C 2,097,152 (first three bits fixed to 110" for "Class C")
Class B 65,536
Class C 256
Special IPv4 Addresses
0 31
(a)
A Subnet-3
C
Subnet-2
R1
B 1
2
3
D
Subnet-1
R2
1
to other networks
2 4 204.6.94.130
Subnet-4 3
Subnet-5
E F
CIDR Example (2)
Subnet-3: C
204.6.96.168/30
204.6.94.164
Organizations address subspace: A Subnet-2:
65
w.x.y.z/27
.1
204.6.94.168 204.6.96.164/30
94
6.
4.
D
20
204.6.94.169
204.6.94.166
R1 S
20 u b n
4. e
Subnet-1: Subnet-3: Subnet-5: 20 6. t-1
4. 96 :
w.x.y.z/30 w.x.y.z8/31 w.x.y.z16/30 6. .1
204.6.94.170 94 60
.1 /3
61 0
B 204.6.94.160
Subnet-2: Subnet-4:
w.x.y.z4/30 w.x.y.z12/31 204.6.94.172 204.6.94.173
R2
Subnet-4:
204.6.96.172/30 204.6.94.176
204.6.94.177
204.6.94.178
(b) (c) Subnet-5:
204.6.96.176/30 E F
CIDR Example (3)
Subnet Network prefix Binary representation Interface addresses
R2-1: 204.6.94.160
R1-2: 204.6.94.161
1 204.6.94.160/30 11001100 00000110 01011110 101000--
(unused)
b-cast: 204.6.94.163
C: 204.6.94.164
R1-3: 204.6.94.165
2 204.6.94.164/30 11001100 00000110 01011110 101001--
D: 204.6.94.166
b-cast: 204.6.94.167
A: 204.6.94.168
R1-1: 204.6.94.169
3 204.6.94.168/30 11001100 00000110 01011110 101010--
B-1: 204.6.94.170
b-cast: 204.6.94.171
R2-2: 204.6.94.172
B-2: 204.6.94.173
4 204.6.94.172/30 11001100 00000110 01011110 101011--
(unused)
b-cast: 204.6.94.175
R2-3: 204.6.94.176
E: 204.6.94.177
5 204.6.94.176/30 11001100 00000110 01011110 101100--
F: 204.6.94.178
b-cast: 204.6.94.179
CIDR-based Forwarding Tables
1 1
1 2 4
2
3 3
Forwarding table: Forwarding table: Forwarding table:
Destination net prefix Out port Destination net prefix Out port Destination net prefix Out port
204.6.96.164/30 3 204.6.96.160/27 1 204.6.96.160/27 1
204.6.96.168/30 1 204.6.96.172/30 2
0.0.0.0/0 2 204.6.96.176/30 3
default route 0.0.0.0/0 4 0.0.0.0/0
Topic:
Autonomous Systems
Commercial Internet
Peering and Transit Relationships
Path Vector Routing
Autonomous Systems (ASs)
Macrospot.com Noodle.com
Tier-2
Tier-1
ISP Tier-1
ISP
ISP
Tier-3
Tier-2
ISP Tier-2
ISP ISP
Tier-3
Tier-3 Tier-3
ISP
ISP ISP
s customers
s customers
s customers
ISP Business Relationships
(a) Paid Transit (b) Peering
ISP
ISP ISP
peering
$ $ $
s
s customer s customer
customer
ISP has the same relationship with ISPs and as they have to their customers.
In other words, and are s paying customers.
In (b), ISP (not shown) could peer with another same-tier ISP (not shown) and their peering relationship
would work on the same principle as for ISPs and .
ISP Business Relationship Example
Macrospot.com Noodle.com Key:
$
Transit
Peering
$ $
Tier-2
$
Tier-1 $
ISP Tier-1
$ ISP
ISP
$ $
Tier-3
$ Tier-2
ISP Tier-2
ISP ISP
$ $
$
Tier-3
Tier-3 Tier-3
ISP
ISP ISP
$
$ $
s customers
s customers
s customers
Providing Selective Transit (1)
AS AS AS
$ $ $
s s s
customers customers customers
(a)
AS AS
$ $
$
AS AS AS AS AS AS
$ $ $ $ $ $
s s s s s s
customers customers customers customers customers customers
(b) (c)
AS AS AS AS
$ $
$
$ $ $
AS AS AS AS AS AS
$ $ $ $ $ $
s s s s s s
customers customers customers customers customers customers
(d) (e)
Providing Selective Transit (1)
AS AS AS
$ $ $
s s s
customers customers customers
(a)
AS AS
$ $
$
AS AS AS AS AS AS
$ $ $ $ $ $
s s s s s s
customers customers customers customers customers customers
(b) (c)
AS AS AS AS
$ $
$
$ $ $
AS AS AS AS AS AS
$ $ $ $ $ $
s s s s s s
customers customers customers customers customers customers
(d) (e)
Providing Selective Transit (2)
AS and its customers are
AS AS AS customers of AS;
$ $
and AS and its customers
$
are customers of AS
s s s
customers customers customers
(a)
AS AS
$ $
$
AS AS AS AS AS AS
$ $ $ $ $ $
s s s s s s
customers customers customers customers customers customers
AS AS AS AS
$ $
$
$ $ $
AS AS AS AS AS AS
$ $ $ $ $ $
s s s s s s
customers customers customers customers customers customers
(d) (e)
Routing in Global Internet (1)
router in AS sends an Macrospot.com Noodle.com
update message
advertising the destination
prefix 128.34.10.0/24 AS
AS B AS
E J
G
C
A H I
} D F
AS
S
{A S
{AS AS
,A
AS } AS
S
{A
}
L {AS, AS {A
S
S
K O P ,A
N ,A
M S
}
Q
S
}
,A
{AS
S
AS AS AS
{A
, A
S
}
{Cust} R t}
{Cust
s customers s customers
s customers
Routing in Global Internet (2)
Macrospot.com Noodle.com
AS
AS B AS
E J
G
C
A H I
} D F
AS
AS advertises
,
S
{A S
,A
AS } AS
S customers to its
{A
} peers, so AS
L {AS, AS {A
S
S
K O ,A
P never learns that
N ,A
M S AS has links to
}
Q
S
}
AS and AS
,A
{AS
S
AS AS AS
{A
, A
S
}
{Cust} R t}
{Cust
s customers s customers
s customers
Example - Path Vector
Routing table at AS : Initial Received Path Vectors (1st exchange) 10 1
Path to 1
From
0 | 10 | 1 | 10 | 0 | 1 | 1 | 1 7
From
| | |
From
| | | 1 | 1 | 0 | 7 |
Path to
0 | 2 | , 1 | 8 | ,
Routing table at node : After 1st exchange:
From
10 | 0 | 1 | 1 |
1 | 1 | 0 | 7 |
Example - Path Vector
D ( ) min c( , ) D ( ), c( , ) D ( ) min 10 0, 1 1 2
D ( ) min c( , ) D ( ), c( , ) D ( ) min 10 1, 1 0 1
D ( ) min c( , ) D ( ), c( , ) D ( ) min 10 1, 1 7 8
Integrating IGP & EGP Tables
Hot-potato routing:
Choose the speaker at
the minimum distance
from this router.
Routing table at AS : Initial Received Path Vectors (1st exchange) 10 1
Path to 1
From
0 | 10 | 1 | 10 | 0 | 1 | 1 | 1 7
From
| | |
From
| | | 1 | 1 | 0 | 7 |
Path to
0 | 2 | , 1 | 8 | ,
Routing table at node : After 1st exchange:
From
10 | 0 | 1 | 1 |
1 | 1 | 0 | 7 |
Topic:
Link-Layer Technologies
Layer 2:
Network
(a) (b)
bytes: 1 1 1 or 2 variable
PPP over
fiber optic link
Customers home
Router
PPP
over dialup telephone line
Information for
Code ID Length
the control operation
bytes: 1 1 2 variable
Point-to-point (PPP):
State Diagram
Dead
Carrier
detected /
Start
/ Drop carrier
/ Exchange
TERMINATE packets
Failed /
Terminating
Establishing Link Connection
Failed /
Options agreed on / Done /
Establishing
Authenticated /
Drop carrier
Authenticating
Connecting to NCP configured /
Network-Layer
Protocol Send & receive
frames
Open
Topic:
IEEE 802.3 a.k.a. Ethernet
00-01-03-1D-CC-F7 1 10:39
01-23-45-67-89-AB 1 10:52
A3-B0-21-A1-60-35 2 10:17
Thin-Cable Ethernet
Switched/Bridged Ethernet
Legacy Ethernet vs. Eth. Hub
Thin-Cable Ethernet
Ethernet Hub
Hub vs. Switch
OSI Layer-1
switching
Ethernet Hub
OSI Layer-2
switching
Ethernet Switch
Ethernet MAC & Link Duplexity
10 Mbps PHY
100 Mbps PHY 1000 Mbps PHY 10 Gbps PHY
IEEE Std 802.3-1985
IEEE Std 802.3u IEEE Std 802.3z IEEE Std 802.3ae
802.3a, 802.3i,
10Base2*, 10Base5*, 100Base-T, 100Base-T2, 1000Base-T, 1000Base-X, 10GBase-E, 10GBase-L,
10Base-F, 10Base-FB, 100Base-T4*, 100Base-TX, 1000Base-BX10 10GBase-R, 10GBase-S,
10Base-FL, 10Base-FP, 100Base-X, 100Base-BX10, 10GBase-T, 10GBase-W,
10Base-T 100Base-FX, 100Base-LX10 10GBase-X
B
MAC address: Network 1
00-01-03-1D-CC-F7
01-23-45-67-89-AB
Port 1
A Switch D
Port 2
A3-B0-21-A1-60-35
49-BD-2F-54-1A-0F
Network 2
00-01-03-1D-CC-F7 1 10:39
01-23-45-67-89-AB 1 10:52
A3-B0-21-A1-60-35 2 10:17
Loops in Switched LANs (1)
Network 1
Port 1 Port 1
A Switch 1 Switch 2
Port 2 Port 2
Network 2
C D
Loops in Switched LANs (2)
Network 1 Netw-1
C P2 C P2 C P2 C P1
Port 2 P2 P2 P2
(a) C (b) C
Netw-1 Netw-1
C P2
C P1 C P1 C P1
P2 P2 P2 P2
Netw-2 Netw-2
(c) C (d) C
802.1D Configuration BPDU
parameters and format
BPDU format:
Protocol Protocol BPDU Root Root path Switch Port Message Max Hello Forward
Flags
ID version ID type ID cost ID ID age age time delay
2 bytes 1 byte 1 byte 1 byte 8 bytes 4 bytes 8 bytes 2 bytes 2 bytes 2 bytes 2 bytes 2 bytes
Topic:
IEEE 802.11 a.k.a. Wi-Fi
802.11 Architecture
802.11 Medium Access Control
RTS/CTS Protocol for Hidden Stations
Components of 802.11 LANs
Ad hoc network does not have distribution system nor access point
IBSS and Infrastructure BSS
Extended Service Set (ESS)
t=1 t=2
802.11 Link Layer Protocol
Architecture
bytes: 2 2 6 6 6 2 6 2 0 to 2304 4
bits: 2 2 4 1 1 1 1 1 1 1 1
Protocol To From
Type Type MF RT PM MD W O
version DS DS
(b)
802.11 physical-layer frame: Physical protocol data unit (PPDU)
shown above
in part (a)
Physical-layer preamble Physical-layer header MAC-layer frame (payload)
144 bits 48 bits (variable)
A C D
TA
SA RA DA
802.11 MAC
DIFS
PIFS Contention
period
SIFS
Busy Frame transmission
.....
Backoff Time
slots
EIFS definition:
A station ready to transmit enters EIFS after detecting a corrupted frame
EIFS
Busy Backoff Frame transmission
SIFS
Busy Receive data ACK
Receiver
Resume
countdown
after deferral
DIFS Backoff Suspend countdown and defer access DIFS
Busy
Another station 9 8 7 6 5 6 5 4 3
802.11 Protocol State Diagram
Sender
New packet /
attempts
max-attempts /
backoff == 0 / 1
backoff 0 /
Busy /
802.11 Protocol State Diagram
Receiver
Packet in error /
(b)
Wait for
EIFS
Examples of Timing Diagrams
for IEEE 802.11
1. A single station has two frames ready for
transmission on an idle channel.
2. A single station has one frame ready for
transmission on a busy channel. The
acknowledgement for the frame is corrupted
during the first transmission.
3. A single station has one frame ready for
transmission on a busy channel. The data frame is
corrupted during the first transmission.
802.11 Timing Diagrams
(a) Timing of successful frame transmissions under the DCF:
B B
A C A C
CTS(N-bytes)
Defer(N-bytes)
(c)
RTS/CTS Transmission Mode
SIFS
DIFS Backoff Time
Busy RTS Data
Sender 4 3 2 1 0
SIFS
SIFS
Busy CTS ACK
Receiver
NAV (Data)
NAV (CTS)
Network
Network
Network
Network
We dont know when sources will start/end their sessions; also for some types of data (video), datarate is variable