Learn More
CUBIC is a congestion control protocol for TCP (transmission control protocol) and the current default TCP algorithm in Linux. The protocol modifies the linear window growth function of existing TCP standards to be a cubic function in order to improve the scalability of TCP over fast and long distance networks. It also achieves more equitable bandwidth(More)
High-speed networks with large delays present a unique environment where TCP may have a problem utilizing the full bandwidth. Several congestion control proposals have been suggested to remedy this problem. The existing protocols consider mainly two properties: TCP friendliness and bandwidth scalability. That is, a protocol should not take away too much(More)
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in <i>O</i>(&#948;) time and message complexity where &#948; is the maximum size of a two-hop neighborhood in a wire-less network while message complexity remains <i>O</i>(&#948;), assuming that message delays can be bounded by an(More)
This is a work-in-progress report on our work on designing realistic evaluation suites for testing high-speed TCP variants. In this work, we have created an experimental network model that captures some of the complex characteristics of propagation delays and background traffic [14, 15, 20]. We use our network model to evaluate a large collection of(More)
The Internet has recently been evolving from homogeneous congestion control to heterogeneous congestion control. Several years ago, Internet traffic was mainly controlled by the traditional RENO, whereas it is now controlled by multiple different TCP algorithms, such as RENO, CUBIC, and Compound TCP (CTCP). However, there is very little work on the(More)
A randomized dining philosophers algorithm is presented for a realistic semi-synchronous model where message delays vary within an unknown bound, and clocks may run at a different speed without any synchronization. In order to predict the unknown bounds, the algorithm employs a simple network delay measurement technique. The algorithm has an expected(More)
We study limitations of an equation-based congestion control protocol, called TFRC (TCP Friendly Rate Control). It examines how the three main factors that determine TFRC throughput, namely, the TCP friendly equation, loss event rate estimation and delay estimation, can influence the long-term throughput imbalance between TFRC and TCP. Especially, we show(More)
We consider a wavelength division multiplexing metro ring architecture with optical burst switching. The ring consists of N nodes, and each node owns a home wavelength on which it transmits its bursts. The ring operates under the fixed transmitter tunable receiver scheme. Control information is transmitted on a separate control channel. Five different burst(More)
This paper examines the effect of background traffic on the performance of existing high-speed TCP variant protocols, namely BIC-TCP, CUBIC, FAST, HSTCP, H-TCP and Scalable TCP. We demonstrate that the stability, link utilization, convergence speed and fairness of the protocols are clearly affected by the variability of flow sizes and round-trip times(More)
We consider an edge optical burst switching (OBS) node with or without converters, and with no buffering. The OBS node serves a number of users, each connected to the switch over a fiber link that supports multiple wavelengths. Each wavelength is associated with a 3-state Markovian burst arrival process. The arrival process permits short and long bursts to(More)