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

被引：0

作者：

Sharma, Reema ^{[1
]}

Kumar, Navin ^{[2
]}

Talabattula, Srinivas ^{[3
]}

机构：

[1] Oxford Coll Engn, Dept ECE, Bangalore, Karnataka, India

[2] Amrita Vishwa Vidyapeetham, Amrita Sch Engn, Dept ECE, Bangalore, Karnataka, India

[3] Indian Inst Sci, Dept ECE, Bangalore 560012, Karnataka, India

来源：

2014 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI) | 2014年

关键词：

DiffServ; Packet scheduling; Average Queue Length; Service differentiation;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：2578 / 2583

页数：6

共 9 条

[1]

Bernet Y., 1999, FRAMEWORK D IN PRESS

[2]

Cruvinel L, 2011, IEEE COMPUTER COMMUN, P1

[3]

Dovrolis Constantinos, 2002, IEEE ACM T NETWORKIN, V10

[4]

Geng Xianmin, 2012, IEEE COMMUNICATION L, V16

[5] A probabilistic priority scheduling discipline for multi-service networks [J].

Jiang, YM ;

Tham, CK ;

Ko, CC .

COMPUTER COMMUNICATIONS, 2002, 25 (13) :1243-1254

[6] Proportional delay differentiation service based on weighted fair queuing [J].

Li, CC ;

Tsao, SL ;

Chen, MC ;

Sun, YL ;

Huang, YM .

NINTH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2000, :418-423

[7] Random Early Detection for Congestion Avoidance in Wired Networks: A Discretized Pursuit Learning-Automata-Like Solution [J].

Misra, Sudip ;

Oommen, B. John ;

Yanamandra, Sreekeerthy ;

Obaidat, Mohammad S. .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2010, 40 (01) :66-76

[8]

Stojanovic M., 2004, FACTA UNIVERSITATIS (NI_S), Series: Electronics and Energetics, P261

[9]

Wang HN, 2001, 2001 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-10, CONFERENCE RECORD, P1846, DOI 10.1109/ICC.2001.937110

← 1 →