TCP - IP White Papers
Analysis of Scalable TCP in the Presence of Markovian Losses
Overview 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 multiplicative decrease (MIMD) algorithm for the window size evolution. This paper first presents an approximate expression for the throughput of a long lasting Scalable TCP session when the losses are i.i.d. and due to window dependent errors. It then presents an analysis when the losses are due to Markovian window independent errors.
| Publisher | French National Institute for Research in Computer Science and Control | File Format | |
|---|---|---|---|
| Date Published | January 2007 | ||
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful? 2 out of 6 users found this white paper useful
White Paper RSS
Download
Register
