QLREDActive Queue Management Algorithm

The Random Early Detection (RED) algorithm has not been successful in keeping the average queue size low. In this paper, we an improved RED-based algorithm called QLRED which divides the dropping probability function of the RED algorithm into two equal segments. The first segment utilises a quadratic packet dropping function while the second segment deploys a linear packet dropping function respectively so as to distinguish between light and high traffic loads. The ns-3 simulation performance evaluations clearly showed that QLRED algorithm effectively controls the average queue size under various network conditions resulting in a low delay. Replacing/upgrading the RED algorithm in Internet routers requires minimal effort since only the packet dropping probability profile needs to be adjusted.

On the Transient Queue with the Dropping Function

We deal with a queueing system, in which arriving packets are being dropped with the probability depending on the queue size. Such a scheme is used in several active queue management schemes proposed for Internet routers. In this paper, we derive and analyze a selected transient characteristic of the model, i.e., the probability that in a given time interval the queue size is kept under a predefined level. As the main purpose of the discussed queueing scheme is to maintain the queue size low, this is a natural characteristic to study. In addition to that, the average time to reach a given level is derived. Theoretical results for both characteristics are accompanied by numerical examples. Among other things, they demonstrate that the transient behavior of the queue may vary significantly with the shape of the dropping function, even if the steady-state performance remains unaltered.

ANALISIS KOMPARASI PERFORMA JARINGAN KOMPUTER PADA IMPLEMENTASI IPv4 dan IPv6

Routers have important functions in the network, especially the internet. Routers can connect several network segments so that they can communicate with other users even though they are separated by a great distance (Sofana, 2013). IPv4 was originally a 32-bit binary number that was used to identify hosts on the network, after successful use by internet users then a new problem arises where IPv4 cannot accommodate Internet users in the future because it runs out of IPv4 addresses. Then IPv6 was created with the aim to provide more addressing than IPv4 (Sugeng, 2015). The problem is seen from the difference in the bit width between IPv4 and IPv6 whether it affects the CPU performance of the computer and the performance of data sent, average speed on the network. Then there will be research on the comparative performance of the CPU load and the performance of the data sent, the average speed of the computer network on the implementation of IPv4 and IPv6 using Passmark Advance Network Test. So that it can provide an overview of the results of the comparison of IPv4 and IPv6 QoS that are better than the 3 parameters tested with TCP and UDP protocols