A framework to determine bounds of maximum loss rate parameter of RED queue for next generation routers
نویسندگان
چکیده
Random early detection (RED) is expected to eliminate global synchronization by random active packet drop. Its packet drop probability is decided by the maximum packet drop probability in its drop function, buffer thresholds, and average queue length. It has been observed that for a large number of connections, a small value of the maximum packet drop probability may not eliminate global synchronization. Furthermore, since RED uses four parameters to regulate its performance, it is necessary to relate its maximum drop probability with those parameters. The objective of this paper is to develop a framework for the bounds of the maximum drop probability of RED, based on TCP channel model and traffic characteristics. The value of the maximum drop probability obtained by our model will make RED queue achieve its targeted goals. r 2008 Elsevier Ltd. All rights reserved.
منابع مشابه
A framework to determine the optimal weight parameter of RED in next-generation Internet routers
Active buffer management can improve the performance of Transmission Control Protocol/Internet Protocol-based networks. Random early detection (RED), an active queue management scheme, has been proposed by the Internet Engineering Task Force for next-generation Internet routers. RED uses a number of parameters, such as buffer thresholds, a packet drop probability and a weight parameter. RED suf...
متن کاملReduction of queue oscillation in the next generation Internet routers
The Internet routers employing the random early detection (RED) algorithm for congestion control suffer from the problem of chaotic queue oscillation. It is well known that the slowly varying nature of the average queue size computed using an exponentially weighted moving average (EWMA) used in the RED scheme causes this chaotic behavior. This paper presents a new mathematical function to model...
متن کاملVRED: An improvement over RED algorithm by using queue length growth velocity
Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...
متن کاملVRED: An improvement over RED algorithm by using queue length growth velocity
Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...
متن کاملDSRED: A New Queue Management Scheme for the Next Generation Internet
Random Early Detection (RED), an active queue management scheme, has been recommended by the Internet Engineering Task Force (IETF) for the next generation routers. RED suffers from a number of performance problems, such as low throughput, large delay/jitter, and induces instability in networks. Many of the previous attempts to improve the performance of RED have been based on optimizing the va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Network and Computer Applications
دوره 31 شماره
صفحات -
تاریخ انتشار 2008