Publication Type : Conference Paper
Publisher : 2014 International Conference on Advances in Computing, Communications and Informatics (ICACCI), IEEE
Source : 2014 International Conference on Advances in Computing, Communications and Informatics (ICACCI), IEEE, Delhi, India (2014)
Url : https://ieeexplore.ieee.org/document/6968380
Campus : Bengaluru
School : School of Engineering
Department : Electronics and Communication
Year : 2014
Abstract : In this paper, we design a new dynamic packet scheduling scheme suitable for differentiated service (DiffServ) network. Designed dynamic benefit weighted scheduling (DBWS) uses a dynamic weighted computation scheme loosely based on weighted round robin (WRR) policy. It predicts the weight required by expedited forwarding (EF) service for the current time slot (t) based on two criteria; (i) previous weight allocated to it at time (t-1), and (ii) the average increase in the queue length of EF buffer. This prediction provides smooth bandwidth allocation to all the services by avoiding overbooking of resources for EF service and still providing guaranteed services for it. The performance is analyzed for various scenarios at high, medium and low traffic conditions. The results show that packet loss is minimized, end to end delay is minimized and jitter is reduced and therefore meet quality of service (QoS) requirement of a network.
Cite this Research Publication : R. Sharma, Dr. Navin Kumar, and Talabattula, S., “Performance of new dynamic benefit-weighted scheduling scheme in DiffServ networks”, in 2014 International Conference on Advances in Computing, Communications and Informatics (ICACCI), Delhi, India, 2014.