Performance of New Dynamic Benefit-Weighted Scheduling Scheme in DiffServ Networks

Sharma, Reema and Kumar, Navin and Talabattula, Srinivas (2014) Performance of New Dynamic Benefit-Weighted Scheduling Scheme in DiffServ Networks. In: 3rd International Conference on Advances in Computing, Communications and Informatics (ICACCI), SEP 24-27, 2014, New Delhi, INDIA, pp. 2578-2583.

PDF 2014_Int_Con_on_Adv_in_Com_Com_and_Inf_2578_2014.pdf - Published Version Restricted to Registered users only Download (299kB) | Request a copy

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.

Item Type:	Conference Proceedings
Publisher:	IEEE
Additional Information:	Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Keywords:	DiffServ; Packet scheduling; Average Queue Length; Service differentiation
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	11 Sep 2015 05:37
Last Modified:	11 Sep 2015 05:37
URI:	http://eprints.iisc.ac.in/id/eprint/52350

Actions (login required)

View Item