#### Filter Results:

- Full text PDF available (241)

#### Publication Year

1992

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Steven H. Low, David E. Lapsley
- IEEE/ACM Trans. Netw.
- 1999

In this Comments, an error in Low and Lapsley's article [1] is pointed out. Because of this error, the proof of the Theorem 2 presented in the article is incomplete and some assessments are wrong. In the second part of this Comments, the author proposes a correction to this proof.

- David X. Wei, Cheng Jin, Steven H. Low, Sanjay Hegde
- IEEE/ACM Transactions on Networking
- 2006

We describe FAST TCP, a new TCP congestion control algorithm for high-speed long-latency networks, from design to implementation.We highlight the approach taken by FAST TCP to address the four difficulties which the current TCP implementation has at large windows. We describe the architecture and summarize some of the algorithms implemented in our… (More)

- Sanjeewa Athuraliya, Victor H. Li, Steven H. Low, Qinghe Yin
- 2000

n this article we describe a new active queue management scheme, Random Exponential Marking (REM), that has the following key features: • Match rate clear buffer: It attempts to match user rates to network capacity while clearing buffers (or stabilize queues around a small target), regardless of the number of users. • Sum prices: The end-to-end marking (or… (More)

—The optimal power flow (OPF) problem is nonconvex and generally hard to solve. In this paper, we propose a semidefinite programming (SDP) optimization, which is the dual of an equivalent form of the OPF problem. A global optimum solution to the OPF problem can be retrieved from a solution of this convex dual problem whenever the duality gap is zero. A… (More)

- Steven H. Low
- IEEE/ACM Trans. Netw.
- 2003

We propose a duality model of end-to-end congestion control and apply it to understand the equilibrium properties of TCP and active queue management schemes. The basic idea is to regard source rates as primal variables and congestion measures as dual variables, and congestion control as a distributed primal-dual algorithm over the Internet to maximize… (More)

T his article reviews the current transmission control protocol (TCP) congestion control protocols and overviews recent advances that have brought analytical tools to this problem. We describe an optimization-based framework that provides an interpretation of various flow control mechanisms, in particular, the utility being optimized by the protocol's… (More)

- Zhenhua Liu, Minghong Lin, Adam Wierman, Steven H. Low, Lachlan L. H. Andrew
- IEEE/ACM Transactions on Networking
- 2011

Energy expenditure has become a significant fraction of data center operating costs. Recently, "geographical load balancing" has been suggested to reduce energy cost by exploiting the electricity price differences across regions. However, this reduction of cost can paradoxically increase total energy use.
This paper explores whether the geographical… (More)

- STEVEN H. LOW, LIMIN WANG
- 2002

We view congestion control as a distributed primal-dual algorithm carried out by sources and links over a network to solve a global optimization problem. We describe a multi-link multi-source model of the TCP Vegas congestion control mechanism. The model provides a fundamental understanding of delay, fairness and loss properties of TCP Vegas. It implies… (More)

- Fernando Paganinil, John Doyle, Steven Low
- 2001

This paper discusses ow control in networks, in which sources control their rates based on feedback signals received from the network links. This feature, present in current protocols such as TCP, has only recently been extensively studied from an analytical perspective. In particular, we are motivated by recent work that shows that TCP and its variants are… (More)

- Lijun Chen, Steven H. Low, John Doyle
- Proceedings IEEE 24th Annual Joint Conference of…
- 2005

We present a model for the joint design of congestion control and media access control (MAC) for ad hoc wireless networks. Using contention graph and contention matrix, we formulate resource allocation in the network as a utility maximization problem with constraints that arise from contention for channel access. We present two algorithms that are not only… (More)