Professional Documents
Culture Documents
Dina Katabi
High Performance
Switching and Routing
Telecom Center Workshop: Sept 4, 1997.
MIT - CSAIL
dk@mit.edu
nms.csail.mit.edu/~dina
TeXCP is TE with an XCP-Like
Protocol
Gigabit Links
Need to increase faster Need Explicit Feedback
Scalability Constraint:
Routers should not maintain per-connection state
XCP
How does XCP Work?
Round Trip
RoundTime
Trip Time
Throughput
Throughput
Feedback
Feedback
Feedback =
+ 1 packet/sec
Congestion Header
How does XCP Work?
Throughput
Feedback
Feedback =
- 31 packet/sec
+ packet/sec
How does XCP Work?
Explicit Feedback
Make senders react according to the
amount of spare capacity
How Does an XCP Router Compute the
Feedback?
1. Efficiency Controller
2. Fairness Controller
MIMD AIMD
Algorithm: Algorithm:
Aggregate traffic changes by If > 0 Divide equally
~ Spare Capacity between connections
~ - Queue Size If < 0 Divide between
So, = Spare - Queue/D connections proportionally to
their current rates
(shown to achieve Fairness [Jain])
Getting the devil out of the details
Efficiency Controller Fairness Controller
Algorithm:
= davg Spare - Queue
If > 0 Divide equally between
connections
Theorem: System converges If < 0 Divide between connections
to optimal utilization (i.e., proportionally to their current rates
No Parameter
(Proof Tuning
based on Nyquist No Per-Flow State
D: Control/Counting Interval
Criterion)
XCP Remains Efficient as Bandwidth or
Delay Increases
Utilization vs. Capacity Utilization vs. Delay
Provider Network
(AT&T, Sprint, BBN, .)
What is the problem?
Boston
L.A.
Egress
Ingress
Boston
L.A.
Two issues:
- How much traffic to put on each path?
- How does TCP interact with multipath
multi-pathrouting?
routing?
How to divide traffic between available
paths to minimize max U?
Feedback Delays
Challenge 1:
Feedback Delays
Utilization
? Boston
L.A.
Boston
L.A.
NYC
SF
Challenge 2:
Boston
L.A.
NYC
SF
Boston
L.A.
TeXCP
Agent
U1 = 0.4
U2 = 0.7
Egress 1
Ingress 1
x
x p ~
rp (t )
u (t ) u (t )
r (t )
p
i
Ingress 1 Egress 1
L1
L2 Egress 2
Ingress 2
L3
Ingress 3 Egress 3
Decrease in
Uncontrollable Traffic
Time (sec)
TeXCP is More Accurate than Previous
Approaches
TeXCP MATE
Utilization
Max Utilization
Max Utilization
Ingress1 Ingress2
Problem:
Can you take traffic at any backbone
router and accurately split it between
multiple paths without reordering TCP
packets?
Simplistic Solution
9920.2659 3
OC12 traffic
Split it between 2 paths, with desirable
splitting changing with time as a sinusoidal
wave
Path1 Fraction
Path2 Fraction
OC12 traffic
Split it between 2 paths, with desirable
splitting changing with time as a sinusoidal
wave
Path1 Fraction
Path2 Fraction
Path1 UDP
Path2 UDP
Very, Very Cheap. Edge routers maintain a
hash table of 210 entries (10KB).
Conclusion
TeXCP
Adaptive multipath routing protocol
Makes the network more robust against
link failures and traffic spikes
Note TeXCP does not assume XCP
Spike
begins No TeXCP
Optimal
TeXCP
Time (sec)
Comparison with MATE
Ingress 1 Egress 1
Ingress 2 Egress 2
Ingress 3 Egress 3
Mate
Minimize delay
Conservative
increase
Comparison with MATE
TeXCP MATE
Link load / capacity Link load / capacity
decrease
in cross
traffic
0
4 2
and 2 2 N
pkts in D
1
D Throughputpkt
Stability
(Proof based Properties
on Nyquist No Per-Connection
D: Counting Interval
Criterion) State