Name
Abstract | ||
|---|---|---|
In this paper, we propose a new algorithm for active queue management, called ERB, which is based not only on the queue size, but also on the estimation of the rate and burstiness of the aggregate enqueueing traffic. By adjusting the packet marking probability according to these measured and estimated information in the queue management, ERB can make the router absorb the burstiness and adapt to various network conditions and traffic patterns intelligently. As a result, ERB derives the adaptability and robustness in the complex network environment. Simulation results confirm the validity of this algorithm and compare the performance of ERB, DropTail, RED and REM algorithms. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1109/ICC.2002.997278 | ICC |
Keywords | Field | DocType |
packet switching,red algorithm,queue size,robustness,network conditions,aggregate enqueueing traffic,burstiness estimation,traffic patterns,active queue management algorithm,parameter estimation,erb,rate estimation,queueing theory,packet marking probability,telecommunication network management,telecommunication traffic,droptail algorithm,adaptability,rem algorithm,intelligent networks,queue management,engineering management,complex networks,robust control,complex network,active queue management | Computer science,Active queue management,Network packet,Queue,Computer network,Real-time computing,Burstiness,Queueing theory,Queue management system,Router,Packet switching | Conference |
Volume | Issue | ISBN |
4 | null | 0-7803-7400-2 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Youquan Zheng | 1 | 0 | 0.34 |
| Zhenming Feng | 2 | 83 | 9.77 |