MODELLING THE PERFORMANCE OF CLASS-BASED WEIGHTED FAIR QUEUE USING OPNET

Abstract

Congestion control and internet network resources management are complex and critical issues in a high-speed packet switch data network, due to the emergence growth of modern multimedia streaming services. The increasing number of computer users in various organizations and institutions of higher learning have spurred a great deal of research on network traffic control. Network administrators are facing the challenges of providing efficient services that can satisfy user requirements. This research study proposed queuing algorithm based on classbased weighted fair queue scheme to complement congestion. Network simulation environment are designed and modeled using OPNET simulation software in-order to overcome the limitation of the traditional queuing approach. Various simulations scenarios are conducted. Analysis comparison with first-in-first-out and priority queue is recorded. And also, various network traffics such as: HTTP, video conferencing and voice applications among others are considered. From the graphical results obtained clearly shows that the overall applications services performances optimize significantly. In terms of the throughput, packet loss and queuing delay, the algorithms performs excellently compared with the FIFO and priority queue. This paper examines the implication of queuing scheduling algorithms on an IP router. It also outlines the effectiveness of the proposed algorithm in managing network resources during the period of congestion.