Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Differentiation Between Short and Long TCP Flows: Predictability of the Response Time
 

Summary: Differentiation Between Short and Long TCP Flows:
Predictability of the Response Time
Konstantin Avrachenkov , Urtzi Ayesta,, Patrick Brown, Eeva Nyberg
INRIA Sophia Antipolis, {k.avrachenkov, uayesta}@sophia.inria.fr
France Telecom R&D, {Patrick.Brown,Urtzi.Ayesta}@francetelecom.com
Helsinki University of Technology, Eeva.Nyberg@netlab.hut.fi.
Abstract-- Internet measurements show that a small number
of large TCP flows are responsible for the largest amount of
data transferred, whereas most of the TCP sessions are made
up of few packets. Several authors have invoked this property to
suggest the use of scheduling algorithms which favor short jobs,
such as LAS (Least Attained Service), to differentiate between
short and long TCP flows.
We propose a packet level stateless, threshold based scheduling
mechanism for TCP flows, RuN2C. We describe an implemen-
tation of this mechanism which has the advantage of being
TCP compatible and progressively deployable. We compare
the behavior of RuN2C with LAS based mechanisms through
analytical models and simulations. As an analytical model, we
use a two level priority Processor Sharing PS + PS. In the

  

Source: Avrachenkov, Konstantin - INRIA Sophia Antipolis
Ayesta, Urtzi - Laboratoire d'Analyse et d'Architecture des Systèmes du CNRS

 

Collections: Computer Technologies and Information Sciences; Engineering