Share Email Print

Proceedings Paper

Packet marking function of active queue management mechanism: should it be linear, concave, or convex?
Author(s): Hiroyuki Ohsaki; Masayuki Murata
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Recently, several gateway-based congestion control mechanisms have been proposed to support the end-to-end congestion control mechanism of TCP (Transmission Control Protocol). In this paper, we focus on RED (Random Early Detection), which is a promising gateway-based congestion control mechanism. RED randomly drops an arriving packet with a probability proportional to its average queue length (i.e., the number of packets in the buffer). However, it is still unclear whether the packet marking function of RED is optimal or not. In this paper, we investigate what type of packet marking function, which determines the packet marking probability from the average queue length, is suitable from the viewpoint of both steady state and transient state performances. Presenting several numerical examples, we investigate the advantages and disadvantages of three packet marking functions: linear, concave, and convex. We show that, although the average queue length in the steady state becomes larger, use of a concave function improves the transient behavior of RED and also realizes robustness against network status changes such as variation in the number of active TCP connections.

Paper Details

Date Published: 25 October 2004
PDF: 11 pages
Proc. SPIE 5598, Performance, Quality of Service, and Control of Next-Generation Communication Networks II, (25 October 2004); doi: 10.1117/12.571797
Show Author Affiliations
Hiroyuki Ohsaki, Osaka Univ. (Japan)
Masayuki Murata, Osaka Univ. (Japan)

Published in SPIE Proceedings Vol. 5598:
Performance, Quality of Service, and Control of Next-Generation Communication Networks II
Frank Huebner; Robert D. van der Mei, Editor(s)

© SPIE. Terms of Use
Back to Top