Abstract
Active Queue Management (AQM) plays an important role in the Internet congestion control. Random Early Detection (RED) is the most popular active queue management algorithm that is used in the in Internet routers. The effectiveness of RED algorithm highly depends on appropriate setting of its parameters. Moreover, RED uses only the average queue length as a congestion meter to trigger packet dropping as a congestion feedback. Since the average queue length considers only long-term behavior of any queue, this approach fails to see instantaneous changes of the queue and hence its reaction is not fast enough. This paper inspires from the economic principles to design a new congestion control algorithm. This algorithm, called ECORED, enhances the network performance by dynamically tuning of RED's parameters. ECORED introduces two meters i.e. queue length growth velocity and drop rate velocity to measure the congestion level and produce appropriate congestion feedbacks. Based on extensive simulations conducted using Network Simulator-2 (ns-2), we show that ECORED algorithm reduces the packet loss rate and achieves high utilization in compare with RED, ARED and NLRED.
Highlights
With the rapid growth of the Internet-based services, congestion control has emerged as a major issue in computer and communication network design
We have proposed an active queue management algorithm by using economic theory, ECORED, which has never been considered in existing Active Queue Management (AQM) algorithms
In ECORED, we have used both of the queue length growth velocity and the drop velocity n order to achieve equilibrium between transmission rate and available bandwidth
Summary
With the rapid growth of the Internet-based services, congestion control has emerged as a major issue in computer and communication network design. Active queue management techniques have been proposed to alleviate some congestion control problems for IP networks as well as provide some notion of quality of service. LRED7 takes into account the dropping probability based on loss rate and queue length rather than average queue size This algorithm outperforms stability of original RED and archives high throughput. This method introduces additional parameters that are needed to be optimized to stabilize the queue length in different network scenarios. On the Use of Economical Theories and Metrics to Design an Intelligent Active Queue Management in the Internet is further examined under various simulated network environments, and compared to some existing AQM algorithms.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
