Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Analysis of Scalable TCP in the presence of Markovian Losses E. Altman K. E. Avrachenkov A. A. Kherani
 

Summary: Analysis of Scalable TCP in the presence of Markovian Losses
E. Altman K. E. Avrachenkov A. A. Kherani
B.J. Prabhu
INRIA Sophia Antipolis
06902 Sophia Antipolis, France.
Email:{altman,k.avratchenkov,alam,bprabhu}@sophia.inria.fr
Abstract
In high speed networks, the standard TCP's AIMD
algorithm was observed to be inefficient in utilizing the
link capacity. As a result of which several proposals
such as High-Speed TCP, FAST and Scalable TCP,
were put forward. In contrast to the additive increase
multiplicative decrease algorithm used in the standard
TCP, Scalable TCP uses a multiplicative increase mul-
tiplicative decrease (MIMD) algorithm for the window
size evolution. In this paper, we first present an ap-
proximate expression for the throughput of a long last-
ing Scalable TCP session when the losses are i.i.d. and
due to window dependent errors. We then present an
analysis when the losses are due to Markovian window

  

Source: Avrachenkov, Konstantin - INRIA Sophia Antipolis

 

Collections: Computer Technologies and Information Sciences