< draft-ietf-tsvwg-aqm-dualq-coupled-25b.txt		draft-ietf-tsvwg-aqm-dualq-coupled-25c.txt >
	skipping to change at page 46, line 32 ¶		skipping to change at page 46, line 32 ¶
	a burst arrives at an empty queue, the sojourn time only fully		a burst arrives at an empty queue, the sojourn time only fully
	measures the burst's delay when its last packet is dequeued, even		measures the burst's delay when its last packet is dequeued, even
	though the queue has known the size of the burst since its last		though the queue has known the size of the burst since its last
	packet was enqueued - so it could have signalled congestion		packet was enqueued - so it could have signalled congestion
	earlier. To remedy this, each head packet can be marked when it		earlier. To remedy this, each head packet can be marked when it
	is dequeued based on the expected delay of the tail packet behind		is dequeued based on the expected delay of the tail packet behind
	it, as explained below, rather than based on the head packet's		it, as explained below, rather than based on the head packet's
	own delay due to the packets in front of it. [Heist21] identifies		own delay due to the packets in front of it. [Heist21] identifies
	a specific scenario where bursty traffic significantly hits		a specific scenario where bursty traffic significantly hits
	utilization of the L queue. If this effect proves to be more		utilization of the L queue. If this effect proves to be more
	widely applicable, it is believed that using the delay behind the		widely applicable, using the delay behind the head could improve
	head would improve performance.		performance.
	The delay behind the head can be implemented by dividing the		The delay behind the head can be implemented by dividing the
	backlog at dequeue by the link rate or equivalently multiplying		backlog at dequeue by the link rate or equivalently multiplying
	the backlog by the delay per unit of backlog. The implementation		the backlog by the delay per unit of backlog. The implementation
	details will depend on whether the link rate is known; if it is		details will depend on whether the link rate is known; if it is
	not, a moving average of the delay per unit backlog can be		not, a moving average of the delay per unit backlog can be
	maintained. This delay consists of serialization as well as		maintained. This delay consists of serialization as well as
	media acquisition for shared media. So the details will depend		media acquisition for shared media. So the details will depend
	strongly on the specific link technology, This approach should be		strongly on the specific link technology, This approach should be
	less sensitive to timing errors and cost less in operations and		less sensitive to timing errors and cost less in operations and
End of changes. 1 change blocks.
	2 lines changed or deleted		2 lines changed or added
This html diff was produced by rfcdiff 1.48. The latest version is available from http://tools.ietf.org/tools/rfcdiff/