Loading presentation...

Present Remotely

Send the link below via email or IM

Copy

Present to your audience

Start remote presentation

  • Invited audience members will follow you as you navigate and present
  • People invited to a presentation do not need a Prezi account
  • This link expires 10 minutes after you close the presentation
  • A maximum of 30 users can follow your presentation
  • Learn more about this feature in our knowledge base article

Do you really want to delete this prezi?

Neither you, nor the coeditors you shared it with will be able to recover it again.

DeleteCancel

Make your likes visible on Facebook?

Connect your Facebook account to Prezi and let your likes appear on your timeline.
You can change this under Settings & Account at any time.

No, thanks

Congestion Control.... ???

No description
by

Gautam Moktan

on 30 October 2013

Comments (0)

Please log in to add your comment.

Report abuse

Transcript of Congestion Control.... ???

Controlling Congestion...
Survey's Done
Techniques in Internet Congestion Control
Bartek Peter Wydrowski
A Theoretical Study of Internet Congestion Control: Equilibrium and Dynamics
Jiantao Wang
Books
IETF and ICCRG
Fairness:
Maxmin
Proportional
Efficiency vs Justice vs Social Welfare vs...
Bricoe and Matthis ... against flow rate fairness
Queue management
Droptail
AQM
RED
WRED/ARED/RED-PD/...
BLUE
REM
Dark Buffers and Buffer Bloat
CoDel
It's
like
an
Ice berg!

Variants:
TCP
RENO
Cubic
Compound
Vegas(loss based)
Relentless
Burst tcp
........
Congestion exposure:
ECN
Re-ECN
IETF ConEX WG
TCP State variables
CWND
Initial Window
SSthresh
CA algorithm
RTT
Traffic Types:
Bulk
Media
Real Time
Transactions
P2P
DataCenter and Synchronization
Link Types:
Wireless
3G
WLAN
Ethernet
WAN
Long Fat Pipes (trans-atlantic links)
Satellite
Dialup
DTN
PROXY stories
Split TCPs:
More disadvantages

End-to-End principles

Private Networks
Transport Layer Proxy vs Application Layer proxy
Tweaks and Improvements
Fast Recovery
Fast Retransmit
SACK
DelACK
HyStart
QuickStart
Eiffel’s Algorithm F-RTO
IW
ECN
FEC

TCP Pacing
Traffic Shaping
Tuning the initial parameters based on history
Machine learning approaches
Zeta TCP
Players:
Van Jacobson
S. Floyd
M. Matthis
B. Briscoe
M. Welzl
W. Eddy
J. Gettys
F.P. Kelly
Mark Allman
Lars Eggert
Frank kelly
J. Nagle
J Padhye
J Kurose
S. Shenker
L. Zhang
P. Sarolahti
...
..
.
Living Without Congestion Control (p.51)
Do we need congestion control in the future Internet?

R. Kempter, B. Xin and S. K. Kasera, "Towards a Composable Transport Protocol: TCP without
Congestion Control", ACM SIGCOMM 2004, Poster Session, August 30-September 3, Portland/Oregon

B. Raghavan and A. Snoeren, "Decongestion Control", ACM SIGCOMM Workshop on Hot Topics in Networks, 2006.

• T. Bonald, M. Feuillet and A. Proutiere, "Is the "Law of the Jungle" Sustainable for the Internet?", INFOCOM 2009, Rio de Janeiro, Brazil, 2009.
No Congestion Control
Diffserv
IntServ
RSVP
Traffic classes/Traffic Shaping
ISP/Operator induced
PhD thesis
Network Congestion Control: Managing Internet Traffic
Michael Welzl
The Mathematics of Internet Congestion Control (Systems & Control: Foundations & Applications)
Rayadurgam Srikant
"Congestion Control in the RFC Series", RFC5783,
"Open Research Issues in Internet Congestion Control", RFC6077
....
Algorithm Design Guidelines (IETF):
Specifying New Congestion Control Algorithms RFC 5033

Metrics for the Evaluation of Congestion Control Mechanisms RFC 5166
Evolution of TCP
1975
1980
1985
1990
1982
TCP & IP
RFC 793 & 791
1974
TCP described by
Vint Cerf and Bob Kahn
In IEEE Trans Comm
1983
BSD Unix 4.2
supports TCP/IP
1984
Nagel’s algorithm
to reduce overhead
of small packets;
predicts congestion collapse
1987
Karn’s algorithm
to better estimate round-trip time
1986
Congestion collapse
observed
1988
Van Jacobson’s algorithms
congestion avoidance and congestion control
(most implemented in 4.3BSD Tahoe)
1990
4.3BSD Reno
fast retransmit
delayed ACK’s
1975
Three-way handshake
Raymond Tomlinson
In SIGCOMM 75
TCP Through the 1990s
1993
1994
1996
1994
ECN
(Floyd)
Explicit
Congestion
Notification
1993
TCP Vegas
(Brakmo et al)
real congestion avoidance
1994
T/TCP
(Braden)
Transaction
TCP
1996
SACK TCP
(Floyd et al)
Selective Acknowledgement
1996
Hoe
Improving TCP startup
1996
FACK TCP
(Mathis et al)
extension to SACK
Gautam Raj Moktan
Things on the Surface
TCP Congestion Control
Non-TCP Congestion Control
Delay
Losses
Techno-Economics
Energy Issues
Net Neutrality
Adjust your sending rate according to the available capacity in your path

Stop overwhelming the Network

Use your Fair Share of the Network
Fairness is an ambiguous Term
TCP Retransmission Time Out

Congestion Avoidance Algorithm
Slowstart
Initial Window
Aggressiveness

Loss based
Delay Based
Packet Pair probing
UDP based applications
TFRC
DCCP
SCTP
NOW...
Src: slides of Aditya Akella
pages.cs.wisc.edu/~akella/CS740/S07/notes/lect9.ppt
Src: slides of Aditya Akella
pages.cs.wisc.edu/~akella/CS740/S07/notes/lect9.ppt
User Experience
UDP
LEDBAT
BitTorrent
uTP
RTCWEB: RMCAT- RTP Media Congestion
Avoidance Techniques
Variants:
BW Estimations
Packet pair
Packet Train
Passive/Active
TCP
Non-TCP
Mathematics
Tools
CAVT
NS2
...

Control Theory
Convex Optimization
Queuing Theory
Game Theory
Estimation/ Statistics
Machine Learning
Src: Controlling Queue Delay
K. Nichols, Pollere Inc.
V. Jacobson, PARC
Propagation Delay
Buffer Induced Delay
Measure of Congestion??
Implications
Application Needs
Congestion Information and reaction time
Link characteristics Estimation
Design of CC algorithms
Congestion Signals
Spurious Losses
Timeouts
Retransmissions
Reliability manifestations
Speed
Reliability
Applications needs
Differs from quality of service
QoE gaining momentum
Relative measure
Quality of Service
ISP resource allocation
Proxy and blocking
P2P
Buffer and network scaling issues
ICT going Green

Wireless devices battery life a major concern

Energy = $$
Game theory
HD game and equilibrium
Utility
Tragedy of the Commons
Scheduling
round-robin
fair queuing (a max-min fair scheduling algorithm) proportionally fair scheduling
maximum throughput
weighted fair queuing
First in first out
Shortest remaining time
Multilevel queue scheduling
The Stromquist/The Levmore-Cook/The Dubins-Spanier/The Webb moving-knife procedure , Proportional Division, Envy Free Division, Brams-Taylor procedure, I cut-you choose procedure, Exact Division, Pareto-Optimal Division, Equitable Division, Entitlement, Valuations
Fair Division
Queue management
Scheduling
Applications
CC Engines
Congestion Marking
CC Engines
Applications
Load balancing
User Experience
Energy Issues
Fairness
Stability
Algorithms
Net Neutrality
$$
Services
Full transcript