A Revised Logic for Weighted Round Robin Scheduler towards Improving Network Throughput in a QoS Internet
No Thumbnail Available
Date
2007-06
Authors
Oladeji, F.A.
Uwadia, C. O.
Kourie, D.G.
Strauss, D.M.
Journal Title
Journal ISSN
Volume Title
Publisher
Journal of Computer Science and its Applications
Abstract
Attempts to support service differentiation and QoS on the internet have brought about various traffic management models. One such class of models deals with traffic scheduling at the Internet routers. A network scheduler generally implements three orthogonal policies, namely: a scheduling policy, a queuing policy and a packet drop policy. While the three policies work together to prevent a network collapse in face of congestions, this paper focuses on weighted round robin (WRR) policy and seeks how its performance can be improved in the face of bursty traffic situations. WRR allocates available resources in proportion to the prescribed weight. The early implementation of the scheduler was faced with performance degradation when the algorithm meets with bursty input traffic. in such a situation, queues might bot be served even through there is still bandwidth. this paper presents dynamic algorithm that caters for such lapses in this scheduler. Our scene tagged carry-on WRR (cWRR) made sure the remaining bandwidth is used up by other backlogged queues in the same round. The new scheme was simulated in Java and our observation shows that the throughput achieved was improved when compared to ordinary WRR scheduling discipline.
Description
Staff publication
Keywords
Internet , Traffic scheduling , Network scheduler , Java , Research Subject Categories::TECHNOLOGY::Information technology::Computer science
Citation
Oladeji F.A, Uwadia C.O, Kourie D. G. and D.M. Strauss. (2007). A Revised Logic for Weighted Round Robin Scheduler towards Improving Network Throughput in a QoS Internet. Journal of Computer Science and its Applications, 14(1): 139-151pp.