Effects of Various Queuing Algorithms for Network Services

A few years ago, the internet evolved into a communication environment used not only for human and social contact but also for commercial and educational purposes in colleges and schools. As a result, a tremendous amount of new multimedia content has been created, such as interactive environments, 3D videos network gaming, virtual worlds, and other programs that demand a higher bandwidth to function properly. Multimedia applications via IP networks are becoming increasingly popular. The bandwidth consumed has become a major issue for Internet service providers (ISPs) and online communities. Since bandwidth is a limited network resource, numerous types of traffic are employed across the network, including video conferencing, VoIP, and file transfer. As a result, routers employ various traffic management techniques known as queuing approaches to administer these services by managing how packets are delayed while waiting to be dispatched. This article employs three distinct queuing systems, FIFO, PQ, and WFQ, and we attempted to set up three networks with varying traffic volumes and designed network topologies using OPNET tools. These simulations illustrate that the WFQ algorithm performs better under various traffic loads

Now a day Internet only put up best effort service. Traffic is transmitting as earliest as possible, but during transmission, there is no guarantee of timelines or real delivery of packets. With the swiftly transformation of the Internet into a commercial infrastructure, demands for a quality of service have developed in rapid rate. People of the present world are very much depending upon the various network services like VOIP, Video conferencing and File Transfer [6,7]. Various categories of Traffic Management systems are used in those services. Queuing is one of the very important mechanisms in traffic management system. Each router in the network must implement some queuing discipline that control how packets are buffered while waiting to be transmitted. The main aim of this paper is to highlight quality of service (QoS) analysis using different queuing disciplines.

Daffodil International University Journal of Science and Technology, 1970

Today's Internet only provides Best Effort Service. Traffic is processed as quickly as possible, but there is no guarantee of timelines or actual delivery. With the rapid transformation of the Internet into a commercial infrastructure, demands for service quality have rapidly developed. People of the modern world are very much dependent on various network services like VOIP, Videoconferencing and File Transfer. Different types of Traffic Management systems are used in those services. Queuing is one of the very vital mechanisms in traffic management system. Each router in the network must implement some queuing discipline that governs how packets are buffered while waiting to be transmitted. This paper gives a comparative analysis of three queuing systems FIFO, PQ and WFQ. The study has been carried out on some issues like: Traffic dropped Traffic Received and packet end to end delay and the simulation results shows that WFQ technique has a superior quality than the other techniq...

In this work, simulation tool "OPNET Modeler version 14.0" is used to implement the proposed network (VoIP Network). The proposed network is a private network for a company that has two locations located at two different countries around the world in order to simulate the communications within the same location as a local and the communications between two locations as a long distance and analyze VoIP QoS through measuring the major factors that affect the QoS for VoIP according to international telecommunication union (ITU) standards such as: delay, jitter and packet loss.

2013

This paper presents a comparative analysis of different queuing scheduling disciplines for networking services using Optimized Network Engineering Tool (OPNET). Mainly, we focus on various queuing scheduling disciplines including Modified Weighted Round Robin (MWRR), First in-First out (FIFO), Priority Queuing (PQ), and Weighted Fair Queuing (WFQ). This modeling and simulation are based on the effects of these queuing scheduling disciplines on packet delivery for three next generation Internet streaming applications: File Transfer Protocol (FTP), Video-conferencing, and Voice over Internet Protocol (VoIP).

2014

— This paper presents performance analysis of different queuing scheduling disciplines for Internet applications and services using Optimized Network Engineering Tool (OPNET). Mainly, we focus on various queuing scheduling disciplines including Modified Weighted Round Robin (MWRR), First in-First out (FIFO), Priority Queuing (PQ), and Weighted Fair Queuing (WFQ). This modeling and simulation are based on the effects of these queuing scheduling disciplines on packet delivery for three next generation Internet streaming applications: File Transfer

Indonesian Journal of Electrical Engineering and Computer Science, 2023

A quality network infrastructure is a user demand for the increment of traffic nowadays. Due to data traffic congestion, a network's service quality cannot fulfill the user demand, especially for streaming-type traffic. For this, an appropriate queuing method can be a convenient solution for network congestion at the time of picking traffic load. In this paper, a simulation was conducted using the OPNET application to examine the feasibility of three types of queuing methods, namely first in first out (FIFO), priority queuing (PQ), and weighted fair queuing (WFQ). During the simulation, several important parameters such as delay, throughput, and response time are considered as performance metrics and compared among four types of applications as file transfer protocol (FTP), hypertext transfer protocol (HTTP), voice over internet protocol (VoIP), and video conferencing. According to the result, it is observed that WFQ provides comparatively improved results than PQ and FIFO.

2020

A protocol is a set of rules that governs data communication which decides when to communicate, how to communicate and where to communicate and also what to communicate. One of them is Transmission Control Protocol (TCP) that is the most popular and known protocol for controlling of the data transmission from source to destination or from one node to another node. It gives the best results in offline streaming of the data as compared to User Datagram Protocol (UDP). Congestion is the mechanism in networking that takes place in the time of communication when the data exceeds from its actual limit and it becomes overhead then congestion problem occurs. It usually occurs on the network like if there exist a router then the overhead occurs on router when there is limited time-baud buffer due to which the data may loss or overhead occurs. For this solution TCP is the best option to control and avoid from this problem. In this paper, an analysis has been made with the help of TCP for examining the congestion control queuing mechanism. Along with that, some parameters have been taken into account take are throughput and delay. These parameters have been tested under different settings and have been showed that by utilizing TCP congestion control queuing approach high throughput and low delay of queuing has encountered. From OPNET simulation results it has been concluded that TCP have shown remarkable and outstanding performance for controlling congestion issue with the help of other existing schemes that has shown poor performance.

Congestion in data Communication networks poses a serious problem especially in situations where efficiency and link reliability is needed for optimum performance of the network devices. In this Paper, Congestion Control Problem is solved using the concept of Queuing theory. The network planning engineer would find the developed computational software useful in network planning. The software would enable him decide on the choice of routers 49and other Physical network devices to run his desired Algorithms on. The designed software computes the needed parameters based on the M/M/1 queuing Model.

VoIP Technologies, 2011

Nowadays we can find many TCP/IP based network applications, such as: WWW, e-mail, video-conferencing, VoIP, remote accesses, telnet, p2p file sharing, etc. All mentioned applications became popular because of fast-spreading broadband internet technologies, like xDSL, DOCSIS, FTTH, etc. Some of the applications, such as VoIP (Voice over Internet Protocol) and video-conferencing, are more time-sensitive in delivery of network traffic than others, and need to be treated specially. This special treatment of the time-sensitive applications is one of the main topics of this chapter. It includes methodologies for providing a proper quality of service (QoS) for VoIP traffic within networks. Normally, their efficiency is intensively tested with simulations before implementation. In the last few years, the use of simulation tools in R&D of communication technologies has rapidly risen, mostly because of higher network complexity. The internet is expanding on a daily basis, and the number of network infrastructure components is rapidly increasing. Routers are most commonly used to interconnect different networks. One of their tasks is to keep the proper quality of service level. The leading network equipment manufacturers, such as Cisco Systems, provide on their routers mechanisms for reliable transfer of time-sensitive applications from one network segment to another. In case of VoIP the requirement is to deliver packets in less than 150ms. This limit is set to a level where a human ear cannot recognize variations in voice quality. This is one of the main reasons why leading network equipment manufacturers implement the QoS functionality into their solutions. QoS is a very complex and comprehensive system which belongs to the area of priority congestions management. It is implemented by using different queuing mechanisms, which take care of arranging traffic into waiting queues. Time-sensitive traffic should have maximum possible priority provided. However, if a proper queuing mechanism (FIFO, CQ, WFQ, etc.) is not used, the priority loses its initial meaning. It is also a well-known fact that all elements with memory capability involve additional delays during data transfer from one network segment to another, so a proper queuing mechanism and a proper buffer length should be used, or the VoIP quality will deteriorate. If we take a look at the router, as a basic element of network equipment, we can realise that we are dealing with application priorities on the lowest level. Such level is presented by waiting queues and queuing mechanisms, related with the input traffic connection interface.