Simulation of Class Based Weighted Fair Queue Algorithm on an IP Router Using OPNET

Idris Zakariyya, M Nordin A Rahman


Network traffics and congestion control are becoming complex and critical issue due to the emergence of modern multimedia internet applications. Industries and universities are facing the critical challenges of providing the required internet services demanded by the users. Global and rapid internet access slows down the network performance and degrades quality of service. Efficient scheduling mechanism plays a significant role in the sharing of network resources effectively during the period of congestion. Generally, as part of resource allocation algorithm, each router must implement certain scheduling algorithm that governs the order of packets transmission in a network. In this paper a class-based weighted fair queuing (CBWFQ) algorithm is proposed and simulated along side with first-in-first-out (FIFO) and custom queue (CQ) scheduling algorithms on an IP router using OPNET simulation software. The arrivals and service rate of the applications traffics classes are modelled to follows the poisons and exponential distribution based on Markov-Chain queuing model. The HTTP, FTP, video and voice application traffics are configured in the network environment using the applications and profiles configuration objects. Additionally, discrete event simulations statistic is collected and recorded. Simulations graphs of various scenarios are studied and analyzed critically. Results revealed the efficient performance improvement of the proposed class-based weighted fair queue algorithm compared with the selected traditional queuing scheduling algorithms. In general, in terms of packets loss and queuing delay, the proposed algorithm demonstrated an excellent performance with a very low probability of dropping packets and minimal queuing delay. Overall the study contributed on the use of scheduling algorithm on network router for proper traffic control and management.


Algorithm, Markov-Chain, Packets Scheduling, Traffic Management, OPNET Simulator

Full Text:

Abstract PDF


Balogh T., Medvecky M (2010). Comparison of Priority Queue Based Scheduling Algorithms. 1(1), pp. 1 – 8.

Calif., San Jose (2013). Cisco Virtual Networking Index Forecast white paper.

Kassim M., Ismail M., Jumari K. & Yusof M.I (2011). A survey: Bandwidth management in an IP based network. World academy of science, engineering and technology, 6(2), pp. 332-339.

Shalangwa D.A (2014). Evaluation of bandwidth Performance in a corporate network by using simulation model. Journal of engineering and technology research, 6(1), pp. 1-5.

Idris Zakariyya, Nordin A Rahman M (2015). Bandwidth guarantee using class based weighted fair queue scheduling algorithm. International Journal of Digital Information and Wireless Communications, 5(3), pp. 152-157.

Hussein A. Mohammed, Adnan Hussein Ali & Hawraa Jassim Mohammed (2013). The affects of different queuing algorithms within the router on QoS VoIP application using OPNET. International Journal of Computer Networks and Communication, 5(1), pp. 117-124.

Vijayakumar M., Karthikeyani V & Omar M (2013). Implementation of Queuing Algorithm in Multipath Dynamic routing architecture for effective and secured data transfer in VoIP. International Journal of Engineering Trends and Technology, 4(4), pp. 1226-1230.

Emad Aboelela (2003). Network simulation experiments manual. Morgan Kaufmann.

Tommy Svenson & Alex Popescu (2003). Development of laboratory exercise based on OPNET modeller. Thesis, Department of electrical engineering, Bleking Institute of Technology.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.