Detecting shared congestion of flows via end-to-end measurement

  • Authors:
  • Dan Rubenstein;Jim Kurose;Don Towsley

  • Affiliations:
  • Department of Computer Science, University of Massachusetts at Amherst;Department of Computer Science, University of Massachusetts at Amherst;Department of Computer Science, University of Massachusetts at Amherst

  • Venue:
  • Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
  • Year:
  • 2000

Quantified Score

Hi-index 0.01

Visualization

Abstract

Current Internet congestion control protocols operate independently on a per-flow basis. Recent work has demonstrated that cooperative congestion control strategies between flows can improve performance for a variety of applications, ranging from aggregated TCP transmissions to multiple-sender multicast applications. However, in order for this cooperation to be effective, one must first identify the flows that are congested at the same set of resources. In this paper, we present techniques based on loss or delay observations at end-hosts to infer whether or not two flows experiencing congestion are congested at the same network resources. We validate these techniques via queueing analysis, simulation, and experimentation within the Internet.