Dynamic Threshold Control of RED for Establishing Fairness among Thousands of TCP Connections. Hasegawa, G. & Murata, M. SPIE ITCom, April, 2001. bibtex @article{ Hasegawa01,
author = {G. Hasegawa and M. Murata},
title = {Dynamic Threshold Control of {RED} for Establishing Fairness among Thousands of {TCP} Connections},
journal = {{SPIE ITCom}},
year = {2001},
month = {April},
annote = {One approach to deal with Internet congestion is to use Active Queue Management. A particularly interesting AQM algorithm is Random Early Detection (RED). With RED packets are dropped with a certain probability at times of incipient network congestion. This, in contrast to Drop-Tail which simply discards all arriving packets when the router buffer starts to fill upp. A problem with RED is the difficulty of setting its parameters. In fact, if the parameters are misconfigured, the throughput of a RED router can be lower than a Drop-Tail router. This paper, proposes an enhancement to RED called dt-RED (dynamic threshold RED), which dynamically regulates the RED parameters according to the observed behavior of the RED queue. The effectiveness of dt-RED is demonstrated with some simulation experiments. Specifically, the simulations show that dt-RED is able to improve throughput as well as fairness among competing flows as compared to RED.},
submitter = {Karl-Johan Grinnemo},
bibdate = {Sunday, November 03, 2002 at 12:04:57 (CET)}
}
Downloads: 0
{"_id":"vrCgRYcdCWmM9ikZy","bibbaseid":"hasegawa-murata-dynamicthresholdcontrolofredforestablishingfairnessamongthousandsoftcpconnections-2001","downloads":0,"creationDate":"2015-12-04T23:32:58.337Z","title":"Dynamic Threshold Control of RED for Establishing Fairness among Thousands of TCP Connections","author_short":["Hasegawa, G.","Murata, M."],"year":2001,"bibtype":"article","biburl":"http://www.cs.kau.se/cs/prtp/prtp.bib","bibdata":{"annote":"One approach to deal with Internet congestion is to use Active Queue Management. A particularly interesting AQM algorithm is Random Early Detection (RED). With RED packets are dropped with a certain probability at times of incipient network congestion. This, in contrast to Drop-Tail which simply discards all arriving packets when the router buffer starts to fill upp. A problem with RED is the difficulty of setting its parameters. In fact, if the parameters are misconfigured, the throughput of a RED router can be lower than a Drop-Tail router. This paper, proposes an enhancement to RED called dt-RED (dynamic threshold RED), which dynamically regulates the RED parameters according to the observed behavior of the RED queue. The effectiveness of dt-RED is demonstrated with some simulation experiments. Specifically, the simulations show that dt-RED is able to improve throughput as well as fairness among competing flows as compared to RED.","author":["Hasegawa, G.","Murata, M."],"author_short":["Hasegawa, G.","Murata, M."],"bibdate":"Sunday, November 03, 2002 at 12:04:57 (CET)","bibtex":"@article{ Hasegawa01,\n author = {G. Hasegawa and M. Murata},\n title = {Dynamic Threshold Control of {RED} for Establishing Fairness among Thousands of {TCP} Connections},\n journal = {{SPIE ITCom}},\n year = {2001},\n month = {April},\n annote = {One approach to deal with Internet congestion is to use Active Queue Management. A particularly interesting AQM algorithm is Random Early Detection (RED). With RED packets are dropped with a certain probability at times of incipient network congestion. This, in contrast to Drop-Tail which simply discards all arriving packets when the router buffer starts to fill upp. A problem with RED is the difficulty of setting its parameters. In fact, if the parameters are misconfigured, the throughput of a RED router can be lower than a Drop-Tail router. This paper, proposes an enhancement to RED called dt-RED (dynamic threshold RED), which dynamically regulates the RED parameters according to the observed behavior of the RED queue. The effectiveness of dt-RED is demonstrated with some simulation experiments. Specifically, the simulations show that dt-RED is able to improve throughput as well as fairness among competing flows as compared to RED.},\n submitter = {Karl-Johan Grinnemo},\n bibdate = {Sunday, November 03, 2002 at 12:04:57 (CET)}\n}","bibtype":"article","id":"Hasegawa01","journal":"SPIE ITCom","key":"Hasegawa01","month":"April","submitter":"Karl-Johan Grinnemo","title":"Dynamic Threshold Control of RED for Establishing Fairness among Thousands of TCP Connections","type":"article","year":"2001","bibbaseid":"hasegawa-murata-dynamicthresholdcontrolofredforestablishingfairnessamongthousandsoftcpconnections-2001","role":"author","urls":{},"downloads":0},"search_terms":["dynamic","threshold","control","red","establishing","fairness","thousands","tcp","connections","hasegawa","murata"],"keywords":[],"authorIDs":[],"dataSources":["6WGcSu2Ku7pZzqCcg"]}