By Topic

On the flow fairness of aggregate queues

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Eshete, A. ; Center for Quantifiable Quality of Service in Commun. Syst. (Q2S), Norwegian Univ. of Sci. & Technol., Trondheim, Norway ; Yuming Jiang

This paper presents S-SFQ which is a single queue design and implementation of the well-known Start-time Fair Queueing (SFQ). This aggregate queue orders packets based on their timestamps rather than order of arrivals. Through simulation, we show the performance gains of S-SFQ over other default single-queue schemes such as RED and FIFO in terms of link utilization and flow fairness. When sources implement end-to-end (e2e) congestion control, S-SFQ can fairly approximate the fairness, both simple and weighted, of per flow queues. In addition, we discuss in detail the adverse effect of packet loss synchronization problem common in such aggregate queues. The qualities of aggregate queue based router scheme may easily and single-handedly be taken away by this problem. Loss synchronization may surface during overloaded (rather than early) drops when the buffer becomes full (e.g., FIFO) or certain (upper) buffer thresholds are exceeded (e.g., RED).

Published in:

Internet Communications (BCFIC Riga), 2011 Baltic Congress on Future

Date of Conference:

16-18 Feb. 2011