HO CHI MINH CITY UNIVERSITY OF SCIENCE

FACULTY OF ELECTRONICS AND TELECOMMUNICATIONS

DEPARTMENT OF TELECOMMUNICATIONS AND NETWORKS

Course

TELECOMMUNICATION NETWORK

Chapter
Layering Models and
2 Network Planes

Lecturer: Tran Thi Thao Nguyen, Ph.D. Email: tttnguyen@hcmus.edu.vn

1 OSI Model
 Seven layers of the OSI model

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS
 Source to destination delivery

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 4
 Network Layer - Example

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 5
 Summary of layers and protocols

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 6
2 TCP/IP Protocol Model

7
 TCP/IP Protocol vs. OSI Model

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 8
 Relationship of Layers & Addresses in TCP/IP
Application

Transport

Internet

Network Access

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 9
 DATA, CONTROL, AND
3 MANAGEMENT PLANES

10
 DATA, CONTROL, AND MANAGEMENT PLANES
❖Review: Computer Network – Chapter 1
➢Datagram Forwarding / Forwarding table.
➢5 minutes for filling the forwarding table

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 11
 DATA, CONTROL, AND MANAGEMENT PLANES
❖Three factors to let the switch forwards a packet:

1. Packet forwarding
o Data plane

2. Forwarding table
o Control plane

3. Configure forwarding table

o Management plane

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 12
 DATA, CONTROL, AND MANAGEMENT PLANES
❖Data plane:

➢The place handles packets.

➢Consists of:
o The various ports that are used for the reception and
transmission of packets
o A forwarding table with its associated logic.

➢Responsibility for packet buffering, packet scheduling,

header modification, access control, packet inspection,
and forwarding.

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 13
 DATA, CONTROL, AND MANAGEMENT PLANES
❖Control plane:

➢Keep current the information in the forwarding table so

that the data plane can independently handle as high a
percentage of the traffic as possible.

➢Responsible for processing a number of different control

protocols for managing the active topology of the
network.

➢Require the use of general purpose microprocessors and

accompanying software.

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 14
 DATA, CONTROL, AND MANAGEMENT PLANES
❖Management plane:

➢Network administrators configure and monitor the switch

through this plane, which in turn extracts information
from or modifies data in the control and data planes as
appropriate.

➢The network administrators use some form of network

management system to communicate with the
management plane in a switch.

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 15
 DATA, CONTROL, AND MANAGEMENT PLANES

(1) Manually configure

on each device (3a) When the
packet comes,
switch checks the
forwarding table
to decide
properly.
Network
Administrators

(2) Switch
creates the
forwarding
table based (3b) Forward or
on Admin’s Drop based on
configuration the forwarding
[2] http://bradhedlund.com/2011/04/21/data-center-scale-openflow-sdn/
table.

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 16
4 Forwarding vs. Routing
 Forwarding vs. Routing
❖Forwarding: data plane
➢Directing a data packet to an outgoing link
➢Individual router using a forwarding table

❖Routing: control plane

➢Computing paths the packets will follow
➢Routers talking amongst themselves
➢Individual router creating a forwarding table

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 18
 Forwarding vs. Routing
❖Example: Shortest-Path Routing:
➢From a source u to all other nodes
(Forwarding table)
➢Cost of the path through each link
link
➢Next hop along least-cost path to s
v (u,v)
path cost v 2 y w (u,w)
3
1
1 x (u,w)
x 4
u
2
z
y (u,v)
w 1
5 t z (u,v)
4 3 s (u,w)
6
s t (u,w)

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 19
 Forwarding vs. Routing
❖Distributed Control Plane:
➢ Link-state routing: OSPF, IS-IS
o Flood the entire topology to all nodes. (Forwarding table)
o Each node computes shortest paths. link
o Dijkstra’s algorithm.
v (u,v)
path cost v 2 y w (u,w)
3
1
1 x (u,w)
x 4
u
2
z
y (u,v)
w 1
5 t z (u,v)
4 3 s (u,w)
s t (u,w)

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 20
 Forwarding vs. Routing
❖Distributed Control Plane:
➢ Distance-vector routing: RIP, EIGRP
o Each node computes path cost.
o … based on each neighbors’ path cost
path cost
o Bellman-Ford algorithm.

path cost v 2 y du(z) = min{c(u,v) + dv(z),

3 1 c(u,w) + dw(z)}
1
u x 4 z
2
w 1 distance
5 t

4 3
s

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 21
 Forwarding vs. Routing
❖Traffic Engineering Problem
➢ Management plane: setting the weights
o Inversely proportional to link capacity?
o Proportional to propagation delay?
o Network-wide optimization based on traffic?

𝐾2 × 𝐵𝑎𝑛𝑑𝑤𝑖𝑑𝑡ℎ 𝐾5
EIGRP cost = 𝐾1 × 𝐵𝑎𝑛𝑑𝑤𝑖𝑑𝑡ℎ + + 𝐾3 × 𝐷𝑒𝑙𝑎𝑦 ×
256 − 𝐿𝑜𝑎𝑑 𝑅𝑒𝑙𝑖𝑎𝑏𝑖𝑙𝑖𝑡𝑦 + 𝐾4
2 (By default, K1 and K3 have a value of 1, and K2, K4, and K5 are set to 0)
3 1
1
3 OSPF cost =
𝐾
𝐵𝑎𝑛𝑑𝑤𝑖𝑑𝑡ℎ

2 3
1 5 (By default, K=100 Mbps)

4 3

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 22
 Forwarding vs. Routing
❖Traffic Engineering: Optimization
➢ Inputs
o Network topology
o Link capacities
o Traffic matrix 2
3 1
1
➢ Output 3
o Link weights 2 1 5

➢ Objective 4 3
o Minimize max-utilized link
o Or, minimize a sum of link congestion

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 23
 Forwarding vs. Routing
❖Transient Routing Disruptions
➢ Topology changes
o Link weight change
o Node/link failure or recovery

➢ Routing convergence
o Nodes temporarily disagree how to route
o Leading to transient loops and blackholes

1 5 1 10 1 10

4 3 4 3 4 3

Lecturer: Tran Thi Thao Nguyen, Ph.D. - Department of Telecommunications and Networks, FETEL, HCMUS 24
 QA

Lecturer: Tran Thi Thao Nguyen, Ph.D.

Ho Chi Minh City University of Science
Faculty of Electronics and Communications
Department of Telecommunication and Networks
Email: tttnguyen@hcmus.edu.vn