Sciweavers

40 search results - page 7 / 8
» An argument for increasing TCP's initial congestion window
Sort
View
SEUS
2008
IEEE
14 years 2 months ago
Resolving Performance Anomaly Using ARF-Aware TCP
In this study, we propose ARF-aware TCP that resolves the performance anomaly in 802.11 WLAN networks. Performance anomaly is a network symptom that fairness among the nodes is bro...
See-hwan Yoo, Tae-Kyung Kim, Chuck Yoo
SIGMETRICS
2000
ACM
13 years 12 months ago
TCP in presence of bursty losses
In this paper we analyze the performance of a TCP-like flow control in a lossy environment. The transmission rate in the control scheme that we consider has a linear growth rate;...
Eitan Altman, Konstantin Avrachenkov, Chadi Baraka...
SIGMETRICS
2004
ACM
14 years 1 months ago
A mean-field analysis of short lived interacting TCP flows
In this paper, we consider a set of HTTP flows using TCP over a common drop-tail link to download files. After each download, a flow waits for a random think time before reques...
François Baccelli, Augustin Chaintreau, Dan...
INFOCOM
2006
IEEE
14 years 1 months ago
TCP as an Implementation of Age-Based Scheduling: Fairness and Performance
— We show that different flavors of TCP may be viewed as implementations of age-based scheduling disciplines. By parameterizing the scheduling disciplines of interest we are abl...
Arzad Alam Kherani, Rudesindo Núñez-...
INFOCOM
2005
IEEE
14 years 1 months ago
Fairness in MIMD congestion control algorithms
The Mulitplicative Increase Multiplicative Decrease (MIMD) congestion control algorithm in the form of Scalable TCP has been proposed for high speed networks. We study fairness amo...
Eitan Altman, Konstantin Avrachenkov, B. J. Prabhu