300 likes | 461 Views
Adaptive Control for TCP Flow Control. Thesis Presentation Amir Maor. Presentation Structure. Introduction AdaVegas intuition AdaVegas simulation results Adaptive mechanism for TCP new Reno Conclusion. Flow Control Existing Solutions TCP NewReno.
E N D
Adaptive Control for TCP Flow Control Thesis Presentation Amir Maor
Presentation Structure • Introduction • AdaVegas intuition • AdaVegas simulation results • Adaptive mechanism for TCP new Reno • Conclusion
Flow Control Existing Solutions TCP NewReno • The sending rate increases continuously until a packet is dropped. • Two Phases • Slow Start – increase exponentially • Congestion Avoidance – increase linearly
Congestion Avoidance Slow Start < Increase Rate Linearly < Double Rate << - > Exit > Decrease Rate Linearly Flow Control Existing Solutions TCP Vegas • Stop increasing rate before swamping the network • Delay (propagation delay) + (queuing) • Estimates number of queued packets
Related Work – Chiu & JainAIMD converges to stable and fair operating point
Progress • Introduction • AdaVegas intuition • AdaVegas simulation results • Adaptive mechanism for TCP new Reno • Conclusion
How Adaptive Is Vegas? • Vegas changes the sending rate • Vegas does not change the way it changes the sending rate +1 seg/RTT ; -1 seg/RTT ; -0.5*(rate) • Is this way optimal?
Linear Increase Constant Optimal Value or Painful Compromise ?
Making Vegas Adaptive • The larger the available bandwidth the larger the increase constant • How do we know how large the available bandwidth is? • We don’t ! BUT we can take a pretty good guess by using recent history
Progress • Introduction • AdaVegas intuition • AdaVegas simulation results • Adaptive mechanism for TCP new Reno • Conclusion
SOURCE 1 SOURCE 1 SINK 1 SINK 1 Evaluation criteria 1 msec 100Mb/sec 1 msec 100Mb/sec 1 msec 100Mb/sec 1 msec 100Mb/sec SOURCE 2 SOURCE 2 SINK 2 SINK 2 ON mean time SOURCE 3 SOURCE 3 ROUTER 1 ROUTER 1 300 msec 20Mb/sec 300 msec 20Mb/sec ROUTER 2 ROUTER 2 SINK 3 SINK 3 # users SOURCE N SOURCE N SINK N SINK N Simulation Model • ON/OFF users using heavy tailed distribution • Evaluation criteria: • Line utilization, queue size,loss rate,fairness
Evaluation criteria Results - Utilization ON mean time # users
Evaluation criteria Results – Queue Size ON mean time # users
Evaluation criteria Results – Fairness Index ON mean time # users
Evaluation criteria Results – Loss Rate ON mean time # users
Progress • Introduction • AdaVegas intuition • AdaVegas simulation results • Adaptive mechanism for TCP new Reno • Conclusion
Import AdaVegas to NewReno? • Relation between increase constant and available bandwidth does not hold in NewReno
Progress • Introduction • AdaVegas intuition • AdaVegas simulation results • Adaptive mechanism for TCP new Reno • Conclusion
Conclusion & Future Work • AdaVegas is able to adapt better to changing environments • Research on adaptive mechanisms for NewReno should focus on “Slow Start” as well • Develop adaptive mechanism for NewReno • Make AdaVegas’ increase parameter unbound