Time slot-based RED algorithm on self-similar flows: SFRED

Hui Wang; Zhen Zhou Ji; Yan Dong Sun; Yuan Zheng Wang

Time slot-based RED algorithm on self-similar flows: SFRED

Hui Wang^*
, Zhen Zhou Ji
, Yan Dong Sun
, Yuan Zheng Wang

^*Corresponding author for this work

School of Computer Science and Technology, Harbin Institute of Technology

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

Based on fractional Brownian motion (FBM), one calculation of the packet drop probability in the RED algorithm was derived under self-similar flows. Based on the self-similarity and the long-range dependence characteristics of Internet network traffics, a time slot-based RED algorithm on self-similar flows (SFRED) was proposed to the router queue management. The packet drop probability is calculated in every time-slot so that the burden is greatly reduced. It is simulated by NS2 and the experimental results show that the algorithm SFRED outperforms RED. SFRED can control the queue length under adaptive flows with a good throughput.

Original language	English
Pages (from-to)	115-120
Number of pages	6
Journal	Tongxin Xuebao/Journal on Communications
Volume	31
Issue number	10
State	Published - Oct 2010
Externally published	Yes

Keywords

Active queue management
Congestion control
Network traffic
Radom early detection
Self-similarity

Cite this

@article{15f7212392694707833252c9c3b85f23,

title = "Time slot-based RED algorithm on self-similar flows: SFRED",

abstract = "Based on fractional Brownian motion (FBM), one calculation of the packet drop probability in the RED algorithm was derived under self-similar flows. Based on the self-similarity and the long-range dependence characteristics of Internet network traffics, a time slot-based RED algorithm on self-similar flows (SFRED) was proposed to the router queue management. The packet drop probability is calculated in every time-slot so that the burden is greatly reduced. It is simulated by NS2 and the experimental results show that the algorithm SFRED outperforms RED. SFRED can control the queue length under adaptive flows with a good throughput.",

keywords = "Active queue management, Congestion control, Network traffic, Radom early detection, Self-similarity",

author = "Hui Wang and Ji, \{Zhen Zhou\} and Sun, \{Yan Dong\} and Wang, \{Yuan Zheng\}",

year = "2010",

month = oct,

language = "英语",

volume = "31",

pages = "115--120",

journal = "Tongxin Xuebao/Journal on Communications",

issn = "1000-436X",

publisher = "Editorial Board of Journal on Communications",

number = "10",

}

TY - JOUR

T1 - Time slot-based RED algorithm on self-similar flows

T2 - SFRED

AU - Wang, Hui

AU - Ji, Zhen Zhou

AU - Sun, Yan Dong

AU - Wang, Yuan Zheng

PY - 2010/10

Y1 - 2010/10

N2 - Based on fractional Brownian motion (FBM), one calculation of the packet drop probability in the RED algorithm was derived under self-similar flows. Based on the self-similarity and the long-range dependence characteristics of Internet network traffics, a time slot-based RED algorithm on self-similar flows (SFRED) was proposed to the router queue management. The packet drop probability is calculated in every time-slot so that the burden is greatly reduced. It is simulated by NS2 and the experimental results show that the algorithm SFRED outperforms RED. SFRED can control the queue length under adaptive flows with a good throughput.

AB - Based on fractional Brownian motion (FBM), one calculation of the packet drop probability in the RED algorithm was derived under self-similar flows. Based on the self-similarity and the long-range dependence characteristics of Internet network traffics, a time slot-based RED algorithm on self-similar flows (SFRED) was proposed to the router queue management. The packet drop probability is calculated in every time-slot so that the burden is greatly reduced. It is simulated by NS2 and the experimental results show that the algorithm SFRED outperforms RED. SFRED can control the queue length under adaptive flows with a good throughput.

KW - Active queue management

KW - Congestion control

KW - Network traffic

KW - Radom early detection

KW - Self-similarity

UR - https://www.scopus.com/pages/publications/78649464888

M3 - 文章

AN - SCOPUS:78649464888

SN - 1000-436X

VL - 31

SP - 115

EP - 120

JO - Tongxin Xuebao/Journal on Communications

JF - Tongxin Xuebao/Journal on Communications

IS - 10

ER -

Time slot-based RED algorithm on self-similar flows: SFRED

Abstract

Keywords

Other files and links

Fingerprint

Cite this