Abstract
In this paper the problem of packet scheduling in the node of packet-switched computer communication network is considered. Packet scheduling in the network node is one of the crucial mechanisms essential for delivery of required level of quality of services (QoS). In order to satisfy QoS guaranties for each connection belonging to one of distinguished traffic classes, packet scheduling algorithm must make decisions basing on current state of the scheduling system (e.g. buffer lengths) and actual characteristics of the serviced traffic (e.g.: connections lengths, packet intensities within connections, etc.). Here we propose a new packet scheduling algorithm based on Weighted Round Robin (WRR), which weights are adapted according to changes of system and traffic characteristics. By means of computer simulation, on representative examples, we show, that utilization of additional knowledge in the process of packet scheduling may improve QoS guaranties for serviced traffic.
Users
Please
log in to take part in the discussion (add own reviews or comments).