Simple and accurate identification of high-rate flows by packet sampling

Noriaki Kamiyama, Tatsuya Mori

Research output: Chapter in Book/Report/Conference proceedingConference contribution

30 Citations (Scopus)

Abstract

Unfairness among best-effort flows is a serious problem on the Internet. In particular, UDP flows or unresponsive flows that do not obey the TCP flow control mechanism can consume a large share of the available bandwidth. High-rate flows seriously affect other flows, so it is important to identify them and limit their throughput by selectively dropping their packets. As link transmission capacity increases and the number of active flows increases, however, capturing all packet information becomes more difficult. In this paper, we propose a novel method of identifying high-rate flows by using sampled packets. The proposed method simply identifies flows from which Y packets are sampled without timeout. The identification principle is very simple and the implementation is easy. We derive the identification probability for flows with arbitrary flow rates and obtain an identification curve that clearly demonstrates the accuracy of identification. The characteristics of this method are determined by three parameters: the identification threshold Y, the timeout coefficient K, and the sampling interval N. To match the experimental identification probability to the theoretical one and to simplify the identification mechanism, we should set K to the maximum allowable value. Although increasing Y improves the identification accuracy, both the required memory size and the processing power grow as Y increases. Numerical evaluation using an actual packet trace demonstrated that the proposed method achieves very high identification accuracy with a much simpler mechanism than that of previously proposed methods.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
DOIs
Publication statusPublished - 2006
Externally publishedYes
EventINFOCOM 2006: 25th IEEE International Conference on Computer Communications - Barcelona
Duration: 2006 Apr 232006 Apr 29

Other

OtherINFOCOM 2006: 25th IEEE International Conference on Computer Communications
CityBarcelona
Period06/4/2306/4/29

Fingerprint

Flow rate
Sampling
Flow control
Throughput
Internet
Bandwidth
Data storage equipment
Processing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Simple and accurate identification of high-rate flows by packet sampling. / Kamiyama, Noriaki; Mori, Tatsuya.

Proceedings - IEEE INFOCOM. 2006. 4146977.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kamiyama, N & Mori, T 2006, Simple and accurate identification of high-rate flows by packet sampling. in Proceedings - IEEE INFOCOM., 4146977, INFOCOM 2006: 25th IEEE International Conference on Computer Communications, Barcelona, 06/4/23. https://doi.org/10.1109/INFOCOM.2006.324
@inproceedings{4a3f8aff86fe4b739597f10f0822cdf9,
title = "Simple and accurate identification of high-rate flows by packet sampling",
abstract = "Unfairness among best-effort flows is a serious problem on the Internet. In particular, UDP flows or unresponsive flows that do not obey the TCP flow control mechanism can consume a large share of the available bandwidth. High-rate flows seriously affect other flows, so it is important to identify them and limit their throughput by selectively dropping their packets. As link transmission capacity increases and the number of active flows increases, however, capturing all packet information becomes more difficult. In this paper, we propose a novel method of identifying high-rate flows by using sampled packets. The proposed method simply identifies flows from which Y packets are sampled without timeout. The identification principle is very simple and the implementation is easy. We derive the identification probability for flows with arbitrary flow rates and obtain an identification curve that clearly demonstrates the accuracy of identification. The characteristics of this method are determined by three parameters: the identification threshold Y, the timeout coefficient K, and the sampling interval N. To match the experimental identification probability to the theoretical one and to simplify the identification mechanism, we should set K to the maximum allowable value. Although increasing Y improves the identification accuracy, both the required memory size and the processing power grow as Y increases. Numerical evaluation using an actual packet trace demonstrated that the proposed method achieves very high identification accuracy with a much simpler mechanism than that of previously proposed methods.",
author = "Noriaki Kamiyama and Tatsuya Mori",
year = "2006",
doi = "10.1109/INFOCOM.2006.324",
language = "English",
isbn = "1424402212",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Simple and accurate identification of high-rate flows by packet sampling

AU - Kamiyama, Noriaki

AU - Mori, Tatsuya

PY - 2006

Y1 - 2006

N2 - Unfairness among best-effort flows is a serious problem on the Internet. In particular, UDP flows or unresponsive flows that do not obey the TCP flow control mechanism can consume a large share of the available bandwidth. High-rate flows seriously affect other flows, so it is important to identify them and limit their throughput by selectively dropping their packets. As link transmission capacity increases and the number of active flows increases, however, capturing all packet information becomes more difficult. In this paper, we propose a novel method of identifying high-rate flows by using sampled packets. The proposed method simply identifies flows from which Y packets are sampled without timeout. The identification principle is very simple and the implementation is easy. We derive the identification probability for flows with arbitrary flow rates and obtain an identification curve that clearly demonstrates the accuracy of identification. The characteristics of this method are determined by three parameters: the identification threshold Y, the timeout coefficient K, and the sampling interval N. To match the experimental identification probability to the theoretical one and to simplify the identification mechanism, we should set K to the maximum allowable value. Although increasing Y improves the identification accuracy, both the required memory size and the processing power grow as Y increases. Numerical evaluation using an actual packet trace demonstrated that the proposed method achieves very high identification accuracy with a much simpler mechanism than that of previously proposed methods.

AB - Unfairness among best-effort flows is a serious problem on the Internet. In particular, UDP flows or unresponsive flows that do not obey the TCP flow control mechanism can consume a large share of the available bandwidth. High-rate flows seriously affect other flows, so it is important to identify them and limit their throughput by selectively dropping their packets. As link transmission capacity increases and the number of active flows increases, however, capturing all packet information becomes more difficult. In this paper, we propose a novel method of identifying high-rate flows by using sampled packets. The proposed method simply identifies flows from which Y packets are sampled without timeout. The identification principle is very simple and the implementation is easy. We derive the identification probability for flows with arbitrary flow rates and obtain an identification curve that clearly demonstrates the accuracy of identification. The characteristics of this method are determined by three parameters: the identification threshold Y, the timeout coefficient K, and the sampling interval N. To match the experimental identification probability to the theoretical one and to simplify the identification mechanism, we should set K to the maximum allowable value. Although increasing Y improves the identification accuracy, both the required memory size and the processing power grow as Y increases. Numerical evaluation using an actual packet trace demonstrated that the proposed method achieves very high identification accuracy with a much simpler mechanism than that of previously proposed methods.

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

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

U2 - 10.1109/INFOCOM.2006.324

DO - 10.1109/INFOCOM.2006.324

M3 - Conference contribution

AN - SCOPUS:39049141733

SN - 1424402212

SN - 9781424402212

BT - Proceedings - IEEE INFOCOM

ER -