1 sonia fahmypurdue university active queue (buffer) management sonia fahmy department of computer...

8
1 Sonia Fahmy Purdue University Active Queue (Buffer) Active Queue (Buffer) Management Management Sonia Fahmy Department of Computer Sciences Purdue University [email protected] http://www.cs.purdue.edu/homes/fahmy/

Upload: sarah-jenkins

Post on 17-Dec-2015

219 views

Category:

Documents


1 download

TRANSCRIPT

Page 1: 1 Sonia FahmyPurdue University Active Queue (Buffer) Management Sonia Fahmy Department of Computer Sciences Purdue University fahmy@cs.purdue.edu

1Sonia FahmyPurdue University

Active Queue (Buffer)Active Queue (Buffer)ManagementManagement

Sonia Fahmy

Department of Computer Sciences

Purdue University

[email protected]

http://www.cs.purdue.edu/homes/fahmy/

Page 2: 1 Sonia FahmyPurdue University Active Queue (Buffer) Management Sonia Fahmy Department of Computer Sciences Purdue University fahmy@cs.purdue.edu

2Sonia FahmyPurdue University

Drop Tail PPD/EPD RED RED Variants ECN

OverviewOverview

Page 3: 1 Sonia FahmyPurdue University Active Queue (Buffer) Management Sonia Fahmy Department of Computer Sciences Purdue University fahmy@cs.purdue.edu

3Sonia FahmyPurdue University

RoutersRouters Drop tail: drop when buffer is full Problem: Partial packets

Partial packet discard (PPD) Early packet discard (EPD): do not admit new packets

beyond threshold to leave space for partial packets Random Early Detection (RED): between maxth and

minth, drop with p = f(avg Q) Potential advantages: early detection (TCP), avoid

synchronization, punish misbehaving flows, avoid unfairness against bursty sources

Output port

Page 4: 1 Sonia FahmyPurdue University Active Queue (Buffer) Management Sonia Fahmy Department of Computer Sciences Purdue University fahmy@cs.purdue.edu

4Sonia FahmyPurdue University

Random Early Detection (RED)Random Early Detection (RED)

Mark/drop with PLinearly increasingFrom 0 to Pmax

No droppingor marking

Drop with p=1

Thmin ThmaxQavg

Pmax

0

Pdrop/mark

1

gentleQlen0

Page 5: 1 Sonia FahmyPurdue University Active Queue (Buffer) Management Sonia Fahmy Department of Computer Sciences Purdue University fahmy@cs.purdue.edu

5Sonia FahmyPurdue University

RED VariantsRED Variants

Gentle RED (Rosolen, Bonaventure 1998) Flow RED (Lin,Kung) compare Qi to Qave/N

Per flow state required. Also BRED SRED: estimate number of active flows ARED: variable pmax, BLUE: variable pdrop WRED, RIO (parameters): diffserv ECN (RFC 2481 (sec7), CCR 10/94):

4 bits: ECN capable and CE bit to signal congestion, ECN-echo, CWR

In addition to timeout and 3 dupacks

Page 6: 1 Sonia FahmyPurdue University Active Queue (Buffer) Management Sonia Fahmy Department of Computer Sciences Purdue University fahmy@cs.purdue.edu

6Sonia FahmyPurdue University

Explicit Congestion Notification Explicit Congestion Notification (ECN)(ECN)

RouterSource Dest

ACKsWith ECN

ECN marked

React to ECN only once per RTT (like loss event in TFRC) Advantage: Packet drops avoided, no need to wait for a Timeout React to ECN similar to packet drop to preserve TCP-friendliness, but not drastically

Page 7: 1 Sonia FahmyPurdue University Active Queue (Buffer) Management Sonia Fahmy Department of Computer Sciences Purdue University fahmy@cs.purdue.edu

7Sonia FahmyPurdue University

Key PointsKey Points RFC 2309 See www.aciri.org/floyd/red.html for links to papers

discussing RED, RED vairants, RED modeling, simulations and measurements

Page 8: 1 Sonia FahmyPurdue University Active Queue (Buffer) Management Sonia Fahmy Department of Computer Sciences Purdue University fahmy@cs.purdue.edu

8Sonia FahmyPurdue University

Thank You!Thank You!

Questions?Questions?