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)
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 bandwidth from standard TCP flows while utilizing the full bandwidth of high-speed networks. This paper presents another important constraint, namely, RTT (round trip time)(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)
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)
We investigate the application of network coding to all-optical networks from both the algorithmic and infrastructural perspectives. We study the effectiveness of using network coding for optical-layer dedicated protection of multicast traffic that provides robustness against link failures in the network. We present a heuristic for solving this problem and(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)
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)
Wavelength-division multiplexing (WDM) appears to be the solution of choice for providing a faster networking infrastructure that can meet the explosive growth of the Internet. Several different technologies have been developed so far for the transfer of data over WDM, with wavelength routing being the most prominent one. In this paper, we survey two new(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)
Window growth function for congestion control is a strong determinant of protocol behaviors, especially its second and higher-order behaviors associated with the distribution of transmission rates, its variances, and protocol stability. This paper presents a new stochastic tool, called convex ordering, that provides an ordering of any convex function of(More)