Dynamic benefit-weighted scheduling scheme in multi service networks

Abstract

This paper proposes a new dynamic packet scheduling scheme which guarantees the delay and jitter properties of differentiated services (DiffServ) network for both real time and non-real time traffics. The proposed dynamic packet scheduling algorithm uses a new weighted computation scheme known as dynamic benefit weighted scheduling (DB-WS) which is loosely based on weighted round robin (WRR) or fair queuing policy. The novelty of this scheduler is that it predicts the weight required by expedited forwarding (EF) service for current time slot (t) based on two factors: (i) previous weight allocated to it at time slot (t−1), and (ii) average increase in weights of EF traffic in consecutive time slots. This prediction provides smoother and balanced bandwidth allocation to EF, assured forwarding (AF) and best effort (BE) packets by not allocating all the resources to EF and also ensuring minimal packet losses for EF service. Adopting such a dynamic resource allocation effectively achieves reduction in packet loss, end to end delay and delay jitter. The algorithm is tested with different data rates and found to outperform other existing methods in terms of packet loss and end to end delay.