GSOC2014Bufferbloat - Revision history

Annguyen: /* Final review */

2014-08-12T06:30:47Z

Final review

← Older revision		Revision as of 06:30, 12 August 2014
Line 250:		Line 250:
	** CoDelQueue::ShouldDrop() routine is a helper routine determining whether a packet p should be dropped based on its calculated sojourn time. When sojourn time has gone above m_target for at least m_interval, ShouldDrop() returns TRUE indicating that packet p can be dropped. Otherwise, it returns FALSE.		** CoDelQueue::ShouldDrop() routine is a helper routine determining whether a packet p should be dropped based on its calculated sojourn time. When sojourn time has gone above m_target for at least m_interval, ShouldDrop() returns TRUE indicating that packet p can be dropped. Otherwise, it returns FALSE.
	[[File:codel-shoulddrop.png\|CoDel ShouldDrop flow chart]]		[[File:codel-shoulddrop.png\|CoDel ShouldDrop flow chart]]
			** CoDelQueue::DoDequeue() routine is the heart of the CoDel algorithm. It consists of 2 branches: if we are not in dropping state, we need to decide if we have to enter the dropping state and drop the first packet; if we are currently in dropping state, we need to check if we can leave the state or have to perform the next packet drop. Note that we need to check for an empty queue before dequeuing a packet to avoid dereferencing a NULL pointer. Furthermore, an empty queue always takes us out of the dropping state. This part is not shown in the flow chart.
			[[File:codel-dequeue.png\|CoDel dequeue flow chart]]
	* CoDel vs. DropTail test		* CoDel vs. DropTail test
	** Typical cable modem topology and delay		** Typical cable modem topology and delay
	[[File:typicaltopologyandlinkage.png\|Typical topology and linkage]]		[[File:typicaltopologyandlinkage.png\|Typical topology and linkage]]

Annguyen: /* Final review */

2014-08-11T20:41:15Z

Final review

← Older revision		Revision as of 20:41, 11 August 2014
Line 246:		Line 246:
	= Final review =		= Final review =
	* CoDel algorithm:		* CoDel algorithm:
	** ~~The~~ CoDelQueue::DoEnqueue() routine is similar to other (DropTail and RED) DoEnqueue() routines except the addition of tagging the packet p with the current time. This time tag is used to calculate the packet's sojourn when it's dequeued.		** CoDelQueue::DoEnqueue() routine is similar to other (DropTail and RED) DoEnqueue() routines except the addition of tagging the packet p with the current time. This time tag is used to calculate the packet's sojourn when it's dequeued.
	[[File:codel-enqueue.png\|CoDel enqueue flow chart]]		[[File:codel-enqueue.png\|CoDel enqueue flow chart]]
			** CoDelQueue::ShouldDrop() routine is a helper routine determining whether a packet p should be dropped based on its calculated sojourn time. When sojourn time has gone above m_target for at least m_interval, ShouldDrop() returns TRUE indicating that packet p can be dropped. Otherwise, it returns FALSE.
			[[File:codel-shoulddrop.png\|CoDel ShouldDrop flow chart]]
	* CoDel vs. DropTail test		* CoDel vs. DropTail test
	** Typical cable modem topology and delay		** Typical cable modem topology and delay
	[[File:typicaltopologyandlinkage.png\|Typical topology and linkage]]		[[File:typicaltopologyandlinkage.png\|Typical topology and linkage]]

Annguyen: /* Final review */

2014-08-11T17:47:16Z

Final review

← Older revision		Revision as of 17:47, 11 August 2014
Line 247:		Line 247:
	* CoDel algorithm:		* CoDel algorithm:
	** The CoDelQueue::DoEnqueue() routine is similar to other (DropTail and RED) DoEnqueue() routines except the addition of tagging the packet p with the current time. This time tag is used to calculate the packet's sojourn when it's dequeued.		** The CoDelQueue::DoEnqueue() routine is similar to other (DropTail and RED) DoEnqueue() routines except the addition of tagging the packet p with the current time. This time tag is used to calculate the packet's sojourn when it's dequeued.
	[[File:codel-enqueue.~~pdf~~\|CoDel enqueue flow chart]]		[[File:codel-enqueue.png\|CoDel enqueue flow chart]]
	* CoDel vs. DropTail test		* CoDel vs. DropTail test
	** Typical cable modem topology and delay		** Typical cable modem topology and delay
	[[File:typicaltopologyandlinkage.png\|Typical topology and linkage]]		[[File:typicaltopologyandlinkage.png\|Typical topology and linkage]]

Annguyen: /* Final review */

2014-08-11T17:43:49Z

Final review

← Older revision		Revision as of 17:43, 11 August 2014
Line 245:		Line 245:

	= Final review =		= Final review =
			* CoDel algorithm:
			** The CoDelQueue::DoEnqueue() routine is similar to other (DropTail and RED) DoEnqueue() routines except the addition of tagging the packet p with the current time. This time tag is used to calculate the packet's sojourn when it's dequeued.
			[[File:codel-enqueue.pdf\|CoDel enqueue flow chart]]
	* CoDel vs. DropTail test		* CoDel vs. DropTail test
	** Typical cable modem topology and delay		** Typical cable modem topology and delay
	[[File:typicaltopologyandlinkage.png\|Typical topology and linkage]]		[[File:typicaltopologyandlinkage.png\|Typical topology and linkage]]

Tomh: /* FqCodel */

2014-07-26T20:15:18Z

FqCodel

← Older revision		Revision as of 20:15, 26 July 2014
Line 132:		Line 132:

	* patch to ns-3 Queue and derived classes to enable peeking at and modifying the IP header (Tom)		* patch to ns-3 Queue and derived classes to enable peeking at and modifying the IP header (Tom)
			** Initial direction for this is provided here: http://code.nsnam.org/tomh/ns-3-dev-queue/rev/fda94633fe03
			** Some more support in class Packet is likely needed to complete this approach
	* support for hashing IP 5-tuples for FQ/SFQ; avoid boost (Tom)		* support for hashing IP 5-tuples for FQ/SFQ; avoid boost (Tom)
			** Skeleton for Jenkins hash can be found here: http://code.nsnam.org/tomh/ns-3-dev-queue/rev/9b76389f6705
	* alternative to Linux list macro? std::list?		* alternative to Linux list macro? std::list?

Annguyen: /* Weekly progress */

2014-07-22T14:07:33Z

Weekly progress

← Older revision		Revision as of 14:07, 22 July 2014
Line 105:		Line 105:
	** Added trace sources queue length and 'time in queue' for CoDel		** Added trace sources queue length and 'time in queue' for CoDel
	** Started on extending the test script to have asymmetric links		** Started on extending the test script to have asymmetric links
			** Week 8 (July 7, 2014 -- July 11, 2014):
			** Completed codel vs droptail asymmetric test script, which supports multiple up/down streams, asymmetric links, and isochronous with multiple on/off flows
			** Modified CoDel to use Queue::QueueMode
			* Week 9 (July 14, 2014 -- July 18, 2014):
			** Worked on extending CoDel queue tracing to trace drop events

	= Issues and action items =		= Issues and action items =

Annguyen: /* Plan */

2014-07-22T14:01:37Z

Plan

← Older revision		Revision as of 14:01, 22 July 2014
Line 82:		Line 82:
	** Prepare for mid-term review		** Prepare for mid-term review
	* Friday, July 11, 2014:		* Friday, July 11, 2014:
	** Discuss the rough order of priority (details in Section 7: Issues and		** Discuss the rough order of priority (details in Section 7: Issues and action items

	= Weekly progress =		= Weekly progress =

Annguyen: /* Plan */

2014-07-22T14:01:18Z

Plan

← Older revision		Revision as of 14:01, 22 July 2014
Line 82:		Line 82:
	** Prepare for mid-term review		** Prepare for mid-term review
	* Friday, July 11, 2014:		* Friday, July 11, 2014:
	** Discuss the rough order of priority (details in Section 7		** Discuss the rough order of priority (details in Section 7: Issues and

	= Weekly progress =		= Weekly progress =

Annguyen: /* Plan */

2014-07-22T14:00:53Z

Plan

← Older revision		Revision as of 14:00, 22 July 2014
Line 82:		Line 82:
	** Prepare for mid-term review		** Prepare for mid-term review
	* Friday, July 11, 2014:		* Friday, July 11, 2014:
	** Discuss the ~~list~~ of		** Discuss the rough order of priority (details in Section 7

	= Weekly progress =		= Weekly progress =

Annguyen: /* Plan */

2014-07-22T13:59:55Z

Plan

← Older revision		Revision as of 13:59, 22 July 2014
Line 81:		Line 81:
	* Friday, June 20, 2014:		* Friday, June 20, 2014:
	** Prepare for mid-term review		** Prepare for mid-term review
			* Friday, July 11, 2014:
			** Discuss the list of

	= Weekly progress =		= Weekly progress =