Lloyd Brown
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Lloyd Brown has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Arvind Krishnamurthy
University of Washington, Seattle, USA
3 shared publications - Scott Shenker
ICSI and UC Berkeley, Berkeley, USA
3 shared publications - Akshay Narayan
Brown University, Providence, Rhode Island, USA
2 shared publications - Aurojit Panda
NYU, New York, USA
2 shared publications - Ethan Katz-Bassett
Columbia University, New York, USA
2 shared publications - Albert Gran Alcoz
ETH Zurich, Zurich, Switzerland
1 shared publication
Latest Publications
- Open Access
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 166-180
Principles for Internet Congestion Management
Given the technical flaws with---and the increasing non-observance of---the TCP-friendliness paradigm, we must rethink how the Internet should manage bandwidth allocation. We explore this question from first principles, but remain within the constraints of the Internet's current architecture and commercial arrangements. We propose a new framework, Recursive Congestion Shares (RCS), that provides bandwidth allocations independent of which congestion control algorithms flows use but consistent with the Internet's economics. We show that RCS achieves this goal using game-theoretic calculations and simulations as well as network emulation.
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 166-180
Open AccessPrinciples for Internet Congestion Management
Given the technical flaws with---and the increasing non-observance of---the TCP-friendliness paradigm, we must rethink how the Internet should manage bandwidth allocation. We explore this question from first principles, but remain within the constraints of the Internet's current architecture and commercial arrangements. We propose a new framework, Recursive Congestion Shares (RCS), that provides bandwidth allocations independent of which congestion control algorithms flows use but consistent with the Internet's economics. We show that RCS achieves this goal using game-theoretic calculations and simulations as well as network emulation.
- Open Access
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 645-660
An Architecture For Edge Networking Services
The layered Internet architecture, while far from perfect, has provided a global and neutral platform for the development of a wide range of applications. However, this core architecture has been increasingly augmented with additional in-network functionality that improves the performance, security, and privacy of these applications. These additional in-network functions, which are typically implemented at the network edge, are consistent with the layering of the Internet architecture but deviate from two of the core tenets of the Internet: interconnection and end-to-end simplicity. In this paper, we propose an architecture for these edge networking services called the InterEdge that applies these two Internet tenets in a manner appropriate to edge services while not requiring changes to the underlying Internet architecture or infrastructure.
- 4 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 645-660
Open AccessAn Architecture For Edge Networking Services
The layered Internet architecture, while far from perfect, has provided a global and neutral platform for the development of a wide range of applications. However, this core architecture has been increasingly augmented with additional in-network functionality that improves the performance, security, and privacy of these applications. These additional in-network functions, which are typically implemented at the network edge, are consistent with the layering of the Internet architecture but deviate from two of the core tenets of the Internet: interconnection and end-to-end simplicity. In this paper, we propose an architecture for these edge networking services called the InterEdge that applies these two Internet tenets in a manner appropriate to edge services while not requiring changes to the underlying Internet architecture or infrastructure.
- Open Access
- 28 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 229-237
How I Learned to Stop Worrying About CCA Contention
This paper asks whether inter-flow contention between congestion control algorithms (CCAs) is a dominant factor in determining a flow's bandwidth allocation in today's Internet. We hypothesize that CCA contention typically does not determine a flow's bandwidth allocation, present an initial analysis in support of this hypothesis, propose a measurement technique and study to settle this question, and discuss the implications should the hypothesis prove true.
- 28 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 229-237
Open AccessHow I Learned to Stop Worrying About CCA Contention
This paper asks whether inter-flow contention between congestion control algorithms (CCAs) is a dominant factor in determining a flow's bandwidth allocation in today's Internet. We hypothesize that CCA contention typically does not determine a flow's bandwidth allocation, present an initial analysis in support of this hypothesis, propose a measurement technique and study to settle this question, and discuss the implications should the hypothesis prove true.