Agenda

1.
2.
3.
4.
5.
6.
7.

IP principle
IP Protocols
Interconnecting Networks
Routing problems and MPLS solution
Miscellaneous: AAA, NAT, ATM

IP TRANSMISSION PRINCIPLES

Basic principles

Every Host => 1 IP adress

Every packet includes 1 sending adress + 1 destination

adress
IP transmission is connectionless (e.g. UDP) or
connection oriented
(e.g. TCP)
2G
IP transmission
is Best Effort (nevertheless QoS,
security and real time to be implemented)

Example of Host to Host communication

Internet

Host

IP SA

Network
Network

Host

Host

IP ROUTING

2G

Network

Network

Network

IP DA

Host
Host

IP = Internet Protocol
SA = Source Address
DA = Destination Address

TCP/IP 4 layers
stack

OSI 7 layers stack

TCP/IP Protocol layers

2G

MW Interfaces are 10/100BT or 1GBT

UDP and TCP Protocols

Packets are not reordered

is connectionless

Packets are reordered

is connection
oriented

(transmission is
sequenced, with
acknowledgeme
nt and error
check)

TCP/IP Transmission

IP PROTOCOLS

Main Internet Transmission Protocols 1/2

IP (Internet Protocol)
Connectionless (every packet contains SA/DA)
Routing based on IP address
Not guaranteed (Best effort)

UDP (User Datagram Protocol)

Connectionless (no guarantee)
Error Check (optional)
Delivery to the application using the PORT NUMBER
2G

TCP (Transmission Control Protocol)

Connection oriented
Sequenced delivery
E2E acknowledgement
Retransmit after time-out
Window mechanism (credit)
Error Check
Delivery to the application using the PORT NUMBER

Main Internet Transmission Protocols 2/2

PPP (Point to Point Protocol)

Protocol encapsulation (framing)
Error check
Multiple protocols (simultaneously)
Authentication (PAP/CHAP)
Dynamic IP address negotiation
2G

Interconnecting Networks

Interfacing Networks

2G

Networks
Interconnecti
ons

Interconnection Nodes types

Router
A Router acts at the Internet layer (L3)
Routing based upon IP address
Not aware of higher layers (TCP segments, applications)
Self learning based upon routing protocols
Traffic reduction
Bridge
A Bridge acts at the MAC layer (L2)
Forwarding or not based upon MAC address
2G
Not aware of higher layers (IP packets)
Self learning
Traffic reduction

Repeater
A repeater acts at the physical level (amplify and reshape)
Allows to increase the distance between nodes
Not aware of packets or frames
NO traffic reduction

End node

End node

L7

L7

L6

L6

L5

L5

L4

Router

L4

L3

L3 L3

L3

IP address

L2

L2 L2

L2

MAC address

L1

L1 L1

L1

Addressing: Physical = MAC@ (L2)

TCP/IP addressing:
1.

2 addresses are used: one at L2 level (MAC), one at L3 level (IP).

2.

MAC@ is sufficient to interconnect physical nodes. It allows to filter the data forwarded on a node port and
thus reduce traffic by carrying only the relevant data to a direction.

3.

Nodes have to be aware of neighbouring nodes. Tables are used for this purpose. They can be filled
manually or automatically

ARP (Address resolution Protocol):

1.

When a host wants to reach another he has to find the MAC@ of the destination host in its ARP cache

2.

If targeted address is not in ARP cache, then, station send a request (broadcast mode) on the
network:
Request Frame = [MAC broadcast][MAC SA1][ARP Request][DATA: IP SA1, MAC SA1,
IP DA2,.....]

3.

2G update their "ARP cache" with IP SA1, MAC SA1. Only one recognize IP DA2 and will answer
All stations
(unicast mode) Answer Frame = [MAC DA1][MAC SA2][ARP Request][DATA: IP SA2, MAC SA2, IP DA1, MAC
DA1]

4.

"ARP cache" of the requesting station only is updated with MAC SA2 (unicast frame for the answer)

1.

Station S1" send frame towards station S2" with SA1 and DA2 IP&MAC@.

2.

1st node met will analyze S1"MAC@ and store with ingress port N. Then it will
broadcast frame on egress ports towards other network nodes.

3.

Each of them will store S1" MAC@ with relevant ingress port, then will broadcast it
again forward.

Legend:

Finally the station S2" will be reached from one of the routes. The station S2" will
answer to S1" with a frame including SA2 and DA1 IP& MAC@.

SA: Source Address

Self learning (Mac address) process:

4.
5.

All switches met on the way back will learn on their relevant ingress port, the S2"

@: Address
DA: Destination
Address

Addressing: Logical = IP @ (L3)

Knowing the IP address, how do I get there?

Routing is based on the IP destination address

The ROUTING TABLE indicates the outgoing links for all possible
hosts/nets/subnets

The ROUTING PROCESS uses the routing table

The ROUTING PROTOCOLS create the routing table

2G

Also manual routing entries are possible

Routing Process

ROUTER

ROUTING
PROTOCOLS
Create
ROUTING TABLE

ROUTING
PROCESS
2G

IP Net 1
IP Subnet 2
IP Host
Default

=
=
=
=

ITF 1
ITF 2
ITF 3
ITF 3

IP
IP

EN/DECAP

EN/DECAP

EN/DECAP

ETHERNET

ETHERNET

ATM

IP
ETHERNET

ATM
IP

IP

IP

RIP (Routing Information Protocol)

RIP is a routing protocol used within an Autonomous System

(Intra-domain)
RIP is based upon Distance Vector (DV)
Tell your neighbour about the world
No one knows the full topology
Runs on top of UDP (port 520)
RIP routers send regularly updates to each other
2G
Advantage
Simple
Disadvantages
Good news travels fast <> Bad news travels slow
Based upon broadcast messages
Plain text messages (security?)
Cost function limited to hop count

Routing protocols (distance vector)

A=1

To A via B = 2

AUTONOMOUS SYSTEM: area under

single administrative control.
(Alcanet, Eunet, Uunet,)

A=2

D
A=1
To A via C = 3
To A via E = 2

OSPF (Open Shortest Path First)

OSPF is a routing protocol used within an Autonomous System

(Intra-domain)
Based upon Link State Algoritm (LSA)
Tell the world about your neighbour
Full topology known by everybody
Runs on top of IP
OSPF routers send regularly updates to each other
Advantage
2G
Bad news travels fast (fast convergence)
Based upon multicast messages
Password authenticated
Cost function dimentionless (hop, delay, distance,)
QoS ready
Disadvantages
More complex to implement

Link State algoritm (Hello messages)

2G

AUTONOMOUS SYSTEM
D

Topology
E

Link State algoritm (Link State

Advertisements)

30

30
10
20

2G

10

20

10

AUTONOMOUS SYSTEM
10
10

20
10
20

Smallest Cost
E

Routers types and protocoles

Interior routers

are used within an AS (Autonomous System)

They run intra-domain routing protocols like RIP or OSPF
Usually they have a default gateway (Border router)

Border routers

are the interface between the backbone and the AS

They run intra- as well as inter-domain routing protocols (RIP, OSPF, BGP)

Backbone routers

run inter-domain routing protocols (BGP)

AS 2

AS 1
2G

AS 3

Routing problems and MPLS solution

Routing Problems

and Solution

Routing problems:
ATM overlay networks (drastic PVCs growth in large networks)
Backbone routing tables are increasing continuously
Level 3 prefix (interdomain routing) analysis request high processing capacity

The solution is MPLS:

Peer to peer model (MPLS) uses a single layer (=> flat network)
Replace routing tables by simple index searching
Perform this process at level 2
Allows traffic engineering
Allows to implement VPN without specific client application SW or ciphering
Simplify network management by avoiding multiple layers e.g.:
SDH(L1)/ATM(L2)/IP(L3)managements (main controls at L3 only).

MPLS does not replace classical routing but optimize it

MPLS Principle

LSP: Label Switched

el
Lab

Path

56

La
b

el
2

1
el
Lab

FEC (Forward Equivalence Class) and

Flow aggregation

FEC is a subset of packets that are all treated the same way
by a router
It is assigned once at the ingress port
It is defined for one or more, among numerous parameters (e.g.:
source or destination IP@ or port numbers, IP protocol ID,
differentiated services code point,)

MISCELLANEOUS: AAA, NAT, ATM

Miscellaneous: AAA

Service Management Centre

2G

Authentication
Who are you ? Username and password
Authorisation
What service ?
Are you allowed to the service now ?
Are there enough resources ?
Accounting
How much will you pay ?

NAT/PAT (Network/Port adress translation)

NAT Translation table
Destination
Source
Dest IP Dest port Client IP Client port New port
IPd
Pd
IPx
Px
P1
IPd
Pd
IPy
IPx
P2
IPx Port x
2G
WWW

IPd Port d

IPP

NAT

Communication using
private IP addresses

Single public
IP address
IPx Port y

Allows multiple hosts to go to the Internet with only one global unique IP address
Solves the shortage of IP addresses
Allows more hosts on the web at the same time (This is not the case for Dynamic
IP addresses)
Limited added security
Transparent

ATM 1/3 (virtual channels description)

(5 bytes
overhead)

(48 bytes
payload)

ATM 2/3 (virtual channels switching)

ATM 3/3 (class of traffic)