| Paper: | ITT-P2.5 | ||
| Session: | Communication Technoloiges | ||
| Time: | Friday, May 21, 09:30 - 11:30 | ||
| Presentation: | Poster | ||
| Topic: | Industry Technology Track: Data Communications and Networking | ||
| Title: | MEDIAN RED ALGORITHM FOR CONGESTION CONTROL | ||
| Authors: | Gonzalo Arce; University of Delaware | ||
| Kenneth E. Barner; University of Delaware | |||
| Liangping Ma; University of Delaware | |||
| Abstract: | This paper focuses on the queue size estimation problem in Random Early Detection(RED) gateways. Queue size estimation plays a critical role in gateways' packet dropping/marking decision. Conventional RED gateways use exponentially weighted moving averages (EWMA) to estimate the queue size. These IIR filters require very small weights in order to avoid nonlinearinstabilities and accommodate transient congestion. Small weights, however, lead to gateways' failure to closely track rapid queue size depletion and thus causeslink under utilization. We use adaptive weighted median filters for queue size estimation and study the corresponding queue dynamics. Simulation results show that the proposed algorithm provides better stability in queue dynamics, greater network power, less global synchronization, and a fairer treatment tobursty traffic than the RED algorithm. | ||
| Back | |||
Home -||-
Organizing Committee -||-
Technical Committee -||-
Technical Program -||-
Plenaries
Paper Submission -||-
Special Sessions -||-
ITT -||-
Paper Review -||-
Exhibits -||-
Tutorials
Information -||-
Registration -||-
Travel Insurance -||-
Housing -||-
Workshops