Assessing Buffering with Scheduling Schemes in a QoS Internet Router
Onadokun I. O · IOSR Journal of Computer Engineering · 2013
A key requirement for service differentiation as required in Internet of the future and QoS to work effectively is the extension of traffic management routines of the current TCP/IP protocol. Two among of such traffic functions are the introduction of differential packet buffering and multi-queue scheduling algorithms at the routers. Different propositions have been made to extend the Internet best-effort service model but they are yet to be incorporated into the protocol as they are still subjected to experimentations. This paper examines priority, round robin and weighted round robin scheduling algorithms that could be used in a multi-queue platform and simulate them with RIO-C penalty enforcement buffering scheme to determine which one could improve the network performance in terms of loss rate. From the simulation analyses, priority discipline ranked first with scheduler drop rate of 29.46% and a RED loss rate of 14.95%. Round Robin ranked second with 29.53% and 10.50% scheduler and RED loss rates respectively. Weighted round robin ranked third with 30.28% and 3.04% scheduler and RED loss rates respectively. With these results, it was observed that a network that desires feasible quality of service implementation could adopt admission control based on RIO-C with priority scheduling algorithm.