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