Per-Flow Queueing by Dynamic Queue Sharing

Per-flow queuing is believed to be able to guarantee advanced Quality of Service (QoS) for each flow. With the dramatic increase of link speed and number of traffic flows, per-flow queuing faces a great challenge since millions of queues need to be maintained for implementation in a traditional sense. In this paper, by setting only a small number of physical queues, we propose a Dynamic Queue Sharing (DQS) mechanism to achieve an equal performance to the pure per-flow queuing with a lower cost. The proposed mechanism is based on an interesting fact that the number of simultaneous active flows in the router buffer is far less than that of in-progress flows. In DQS, a physical queue is dynamically created on-demand when a new flow comes and then dynamically released when the flow temporarily pauses. Hashing and binary sorting tree (or linked list) are combined to manage the mapping between flows and queues, so as to isolate flows in different queues. Theoretical analysis and traces experiments are conducted to evaluate DQS. The results demonstrate that when the parameters are well set, the operation delay is less than two time cycles in average with an extra memory of 16k bits.

[1]  Larry Peterson,et al.  Inter-AS traffic patterns and their implications , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[2]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[3]  Chase Cotton,et al.  Packet-level traffic measurements from the Sprint IP backbone , 2003, IEEE Netw..

[4]  T. V. Lakshman,et al.  Beyond best effort: router architectures for the differentiated services of tomorrow's Internet , 1998, IEEE Commun. Mag..

[5]  George Varghese,et al.  Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.

[6]  Abdesselem Kortebi,et al.  Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharing , 2005, SIGMETRICS '05.

[7]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[8]  Tim Roughgarden,et al.  Routers with Very Small Buffers , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

[10]  Guido Appenzeller,et al.  Sizing router buffers , 2004, SIGCOMM '04.

[11]  T. V. Lakshman,et al.  Buffer management schemes for supporting TCP in gigabit routers with per-flow queueing , 1999, IEEE J. Sel. Areas Commun..