By Topic

Identifying high-rate flows with less memory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
N. Kamiyama ; Service Integration Lab., NTT Corp., Tokyo, Japan

Unfairness among best-effort flows is a serious problem in the Internet. In particular, UDP flows or unresponsive flows that do not obey the TCP flow control mechanism or normal TCP flows with small RTT can consume a large share of the available bandwidth. Since they will seriously affect other flows, it is important to identify these high-rate flows and limit their throughput by selectively dropping their packets. In this paper, we propose a novel method that identifies high-rate flows using sampled packets. By reducing the timeout length for holding the flow state, the proposed method accurately identifies high-rate flows while using only a small amount of memory. We derive the identification probability for flows with arbitrary rates and obtain an identification curve that clearly reveals the identification accuracy.

Published in:

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.  (Volume:4 )

Date of Conference:

13-17 March 2005