A wavelet-based approach to detect shared congestion

Min Sik Kim, Taekhyun Kim, Yong June Shin, Simon S. Lam, Edward J. Powers

Research output: Contribution to journalConference article

22 Citations (Scopus)

Abstract

Per-flow congestion control helps endpoints fairly and efficiently share network resources. Better utilization of network resources can be achieved, however, if congestion management algorithms can determine when two different flows share a congested link. Such knowledge can be used to implement cooperative congestion control or improve the overlay topology of a P2P system. Previous techniques to detect shared congestion either assume a common source or destination node, drop-tail queueing, or a single point of congestion. We propose in this paper a novel technique, applicable to any pair of paths on the Internet, without such limitations. Our technique employs a signal processing method, wavelet denoising, to separate queueing delay caused by network congestion from various other delay variations. Our wavelet-based technique is evaluated through both simulations and Internet experiments. We show that, when detecting shared congestion of paths with a common endpoint, our technique provides faster convergence and higher accuracy while using fewer packets than previous techniques, and that it also accurately determines when there is no shared congestion. Furthermore, we show that our technique is robust and accurate for paths without a common endpoint or synchronized clocks; more specifically, it can tolerate a synchronization offset of up to one second between two packet flows.

Original languageEnglish
Pages (from-to)293-305
Number of pages13
JournalComputer Communication Review
Volume34
Issue number4
DOIs
Publication statusPublished - 2004 Dec 1
EventACM SIGCOMM 2004: Conference on Computer Communications - Portland, OR, United States
Duration: 2004 Aug 302004 Sep 3

Fingerprint

Internet
Clocks
Synchronization
Signal processing
Topology
Experiments

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications

Cite this

Kim, Min Sik ; Kim, Taekhyun ; Shin, Yong June ; Lam, Simon S. ; Powers, Edward J. / A wavelet-based approach to detect shared congestion. In: Computer Communication Review. 2004 ; Vol. 34, No. 4. pp. 293-305.
@article{42e3eb48462b4fa9a276dbbf55f6c9f3,
title = "A wavelet-based approach to detect shared congestion",
abstract = "Per-flow congestion control helps endpoints fairly and efficiently share network resources. Better utilization of network resources can be achieved, however, if congestion management algorithms can determine when two different flows share a congested link. Such knowledge can be used to implement cooperative congestion control or improve the overlay topology of a P2P system. Previous techniques to detect shared congestion either assume a common source or destination node, drop-tail queueing, or a single point of congestion. We propose in this paper a novel technique, applicable to any pair of paths on the Internet, without such limitations. Our technique employs a signal processing method, wavelet denoising, to separate queueing delay caused by network congestion from various other delay variations. Our wavelet-based technique is evaluated through both simulations and Internet experiments. We show that, when detecting shared congestion of paths with a common endpoint, our technique provides faster convergence and higher accuracy while using fewer packets than previous techniques, and that it also accurately determines when there is no shared congestion. Furthermore, we show that our technique is robust and accurate for paths without a common endpoint or synchronized clocks; more specifically, it can tolerate a synchronization offset of up to one second between two packet flows.",
author = "Kim, {Min Sik} and Taekhyun Kim and Shin, {Yong June} and Lam, {Simon S.} and Powers, {Edward J.}",
year = "2004",
month = "12",
day = "1",
doi = "10.1145/1030194.1015500",
language = "English",
volume = "34",
pages = "293--305",
journal = "Computer Communication Review",
issn = "0146-4833",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

A wavelet-based approach to detect shared congestion. / Kim, Min Sik; Kim, Taekhyun; Shin, Yong June; Lam, Simon S.; Powers, Edward J.

In: Computer Communication Review, Vol. 34, No. 4, 01.12.2004, p. 293-305.

Research output: Contribution to journalConference article

TY - JOUR

T1 - A wavelet-based approach to detect shared congestion

AU - Kim, Min Sik

AU - Kim, Taekhyun

AU - Shin, Yong June

AU - Lam, Simon S.

AU - Powers, Edward J.

PY - 2004/12/1

Y1 - 2004/12/1

N2 - Per-flow congestion control helps endpoints fairly and efficiently share network resources. Better utilization of network resources can be achieved, however, if congestion management algorithms can determine when two different flows share a congested link. Such knowledge can be used to implement cooperative congestion control or improve the overlay topology of a P2P system. Previous techniques to detect shared congestion either assume a common source or destination node, drop-tail queueing, or a single point of congestion. We propose in this paper a novel technique, applicable to any pair of paths on the Internet, without such limitations. Our technique employs a signal processing method, wavelet denoising, to separate queueing delay caused by network congestion from various other delay variations. Our wavelet-based technique is evaluated through both simulations and Internet experiments. We show that, when detecting shared congestion of paths with a common endpoint, our technique provides faster convergence and higher accuracy while using fewer packets than previous techniques, and that it also accurately determines when there is no shared congestion. Furthermore, we show that our technique is robust and accurate for paths without a common endpoint or synchronized clocks; more specifically, it can tolerate a synchronization offset of up to one second between two packet flows.

AB - Per-flow congestion control helps endpoints fairly and efficiently share network resources. Better utilization of network resources can be achieved, however, if congestion management algorithms can determine when two different flows share a congested link. Such knowledge can be used to implement cooperative congestion control or improve the overlay topology of a P2P system. Previous techniques to detect shared congestion either assume a common source or destination node, drop-tail queueing, or a single point of congestion. We propose in this paper a novel technique, applicable to any pair of paths on the Internet, without such limitations. Our technique employs a signal processing method, wavelet denoising, to separate queueing delay caused by network congestion from various other delay variations. Our wavelet-based technique is evaluated through both simulations and Internet experiments. We show that, when detecting shared congestion of paths with a common endpoint, our technique provides faster convergence and higher accuracy while using fewer packets than previous techniques, and that it also accurately determines when there is no shared congestion. Furthermore, we show that our technique is robust and accurate for paths without a common endpoint or synchronized clocks; more specifically, it can tolerate a synchronization offset of up to one second between two packet flows.

UR - http://www.scopus.com/inward/record.url?scp=21844443617&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=21844443617&partnerID=8YFLogxK

U2 - 10.1145/1030194.1015500

DO - 10.1145/1030194.1015500

M3 - Conference article

VL - 34

SP - 293

EP - 305

JO - Computer Communication Review

JF - Computer Communication Review

SN - 0146-4833

IS - 4

ER -