Handling HTTP flows over a DiffServ framework

DiffServ architecture has been widely used to achieve QoS over the Internet. Taking into account that web traffic is the most extended protocol over the Internet community, many solutions have been proposed to supply certain QoS to this type of service. Traditionally, DiffServ architectures have considered two-color markings in order to distinguish between high and low priorities. We study the special treatment for web flows. The web traffic pattern is very close to mouse and elephant distribution flows in Internet. We differentiate flows into short and long classes in order to ensure QoS for short flows, but we try to achieve certain QoS for some long flows. We classify the incoming flows into mice, hybrids and elephants, using three-color markings for each kind of flow, and a three-queue system at the DiffServ system. First of all, we need to detect the gaps in the bandwidth. With these gaps we look for candidate flows to be promoted (hybrids). These hybrid flows will be sent to high priority queue. Next we look for extremely long flows (elephants) which reduce drastically the web traffic performance. Elephant flows will be sent over the low priority queue in order to avoid the promotion of these flows and permit other aspirants to be promoted. Some stochastic functions are computed for the classification at the DiffServ system. Finally, the PLF algorithm is proposed which improves the global performance of the web traffic related with mean of transmission latency and packet loss. We have used ns2 network simulator tool for the simulation with the PackMime-HTTP object for the realistic synthetic web traffic generation.

[1]  Liang Guo,et al.  The war between mice and elephants , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[2]  Konstantin Avrachenkov,et al.  Differentiation between short and long TCP flows: predictability of the response time , 2004, IEEE INFOCOM 2004.

[3]  Donald F. Towsley,et al.  Throughput differentiation using coloring at the network edge and preferential marking at the core , 2005, IEEE/ACM Transactions on Networking.

[4]  Dan Grossman,et al.  New Terminology and Clarifications for Diffserv , 2002, RFC.

[5]  N. U. Ahmed,et al.  Systems approach to modeling the Token Bucket algorithm incomputer networks , 2002 .

[6]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[7]  Anja Feldmann,et al.  Efficient policies for carrying Web traffic over flow-switched networks , 1998, TNET.

[8]  Cheng-Zhong Xu,et al.  Quality-of-service differentiation on the Internet: A taxonomy , 2007, J. Netw. Comput. Appl..

[9]  Olivier Gandouet,et al.  LOGLOG counting for the estimation of IP traffic , 2006 .

[10]  Jin Cao,et al.  Stochastic models for generating synthetic HTTP source traffic , 2004, IEEE INFOCOM 2004.

[11]  Mark Claypool,et al.  Active queue management for Web traffic , 2004, IEEE International Conference on Performance, Computing, and Communications, 2004.

[12]  Kevin Jeffay,et al.  The effects of active queue management on web performance , 2003, SIGCOMM '03.

[13]  Bin Wang,et al.  Subsidized RED: an active queue management mechanism for short-lived flows , 2005, Comput. Commun..

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

[15]  Xipeng Xiao,et al.  Internet QoS: a big picture , 1999, IEEE Netw..

[16]  Marco Mellia,et al.  Packet marking for Web traffic in networks with RIO routers , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[17]  Eitan Altman,et al.  Simulation analysis of RED with short lived TCP connections , 2004, Comput. Networks.

[18]  John S. Heidemann,et al.  Preferential treatment for short flows to reduce web latency , 2003, Comput. Networks.

[19]  Nasser-Eddine Rikli Mathematical framework towards the analysis of a generic traffic marker: Research Articles , 2007 .

[20]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[21]  John Wroclawski,et al.  Specification of the Controlled-Load Network Element Service , 1997, RFC.

[22]  Mor Harchol-Balter,et al.  Size-based scheduling to improve web performance , 2003, TOCS.