Promoting effective service differentiation with Size-oriented Queue Management

As the heterogeneity of Internet traffic increases, the need to provide the necessary quality guarantees for a broad range of applications becomes more and more important. We propose an Active Queue Management scheme, namely Size-oriented Queue Management, which realizes service differentiation based on the Less Impact-Better Service principle. SQM manages to satisfy broadly the quality constraints of real-time applications, without compromising the performance of bulk data applications. Using packet size as criterion, we are able to distinguish time-sensitive flows and apply different dropping and scheduling policies to favor time-sensitive traffic. Our simulation results indicate that SQM manages to increase application satisfaction and augment the user-perceived quality.

[1]  Vassilis Tsaoussidis,et al.  Differentiating Services with Noncongestive Queuing (NCQ) , 2009, IEEE Transactions on Computers.

[2]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[3]  Vassilis Tsaoussidis,et al.  A new service differentiation scheme: Size based treatment , 2008, 2008 International Conference on Telecommunications.

[4]  Vassilis Tsaoussidis,et al.  Adaptive Head-to-Tail: Active Queue Management based on implicit congestion signals , 2009, Comput. Commun..

[5]  Robert G. Cole,et al.  Voice over IP performance monitoring , 2001, CCRV.

[6]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[7]  Ulf Bodin,et al.  Load-tolerant differentiation with active queue management , 2000, CCRV.

[8]  Vassilis Tsaoussidis,et al.  Introducing size-oriented dropping policies as QoS-supportive functions , 2010, IEEE Transactions on Network and Service Management.

[9]  David D. Clark,et al.  Explicit allocation of best-effort packet delivery service , 1998, TNET.

[10]  Robert Tappan Morris,et al.  Dynamics of random early detection , 1997, SIGCOMM '97.

[11]  Scott Shenker,et al.  Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks , 2003, TNET.

[12]  Paul T. Brady,et al.  A statistical analysis of on-off patterns in 16 conversations , 1968 .

[13]  Trang Dinh Dang,et al.  Fractal analysis and modeling of VoIP traffic , 2004, 11th International Telecommunications Network Strategy and Planning Symposium. NETWORKS 2004,.

[14]  Ratul Mahajan,et al.  Controlling high-bandwidth flows at the congested router , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[15]  Donald F. Towsley,et al.  On designing improved controllers for AQM routers supporting TCP flows , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[16]  Parameswaran Ramanathan,et al.  Proportional differentiated services: delay differentiation and packet scheduling , 2002, TNET.

[17]  Cheng-Zhong Xu,et al.  A robust packet scheduling algorithm for proportional delay differentiation services , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[18]  Kevin Jeffay,et al.  A Loss and Queuing-Delay Controller for Router Buffer Management , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).