Adrian Farrel
Old Dog Consulting
adrian@olddog.co.uk
www.mpls2007.com
But:
MPLS-TE will not scale indefinitely
The problem is the well-known “full mesh” or
“n-squared” problem
The number of LSPs scales as the square of the number
of PEs
Management
NMS
How many LSPs can the NMS process
Management protocols
Reporting on large numbers of LSPs may overload the
management network
LSR issues
Memory capacity
Per LSP data requirements
Define
Pn a node at the nth level (level 1 is core)
Sn the number of nodes at the nth level
Mn the multiplier at the nth level (how many Pn+1 nodes are connected to
a Pn node)
Ln number of LSPs seen by a Pn node
Discover
LPE = 2*(SPE - 1)
L2 = M2*(2*SPE - M2 - 1)
L1 = M1*M2*(2*SPE – M2*(M1 + 1))
Practical numbers
S1 = 10, M1 = 10, and M2 = 20
SPE = 2000
LPE = 3998
L2 = 79580
L1 = 756000
Management burden
Plan and operate a secondary mesh
Effectively the same burden as managing PEs or a layered
network
Possible to consider auto-mesh techniques
XPE = 2*(SPE - 1)
X2 = SPE*(M2 + 1)
X1 = M1*M2*(S1 - 2) + SPE*(M1 + 1)
Numbers (S1 = 10, M1 = 10, and M2 = 20)
Flat 2-Level Hierarchy P2MP
SPE 2000 2000 2000
XPE 3998 3998 3998
X2 159160 159358 42000
X1 1512000 3780 23600
XPE = 2*(SPE - 1)
X2 = (M2 + 1)*S1*E
X1 ≤ (4 + M1)*S1*E - M1*E
Numbers (S1 = 10, M1 = 10, and M2 = 20)
draft-ietf-mpls-te-scaling-analysis-01.txt
Seisho Yaukawa (NTT)
Adrian Farrel (Old Dog Consulting)
Olufemi Komolafe (Cisco Systems)
adrian@olddog.co.uk