A new fair marker algorithm for DiffServ networks

Authors:
M. A. Elshaikh;M. Othman;S. Shamala;J. M. Desa
Affiliations:
Department of Communication Technology and Network, University Putra Malaysia, 43400 UPM, Serdang, Selangor D.E., Malaysia;Department of Communication Technology and Network, University Putra Malaysia, 43400 UPM, Serdang, Selangor D.E., Malaysia;Department of Communication Technology and Network, University Putra Malaysia, 43400 UPM, Serdang, Selangor D.E., Malaysia;Department of Communication Technology and Network, University Putra Malaysia, 43400 UPM, Serdang, Selangor D.E., Malaysia
Venue:
Computer Communications
Year:
2008

Citing 3
Cited 3

Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Explicit allocation of best-effort packet delivery service

IEEE/ACM Transactions on Networking (TON)
ItswTCM: a new aggregate marker to improve fairness in DiffServ

Computer Communications

A provision-aware fair bandwidth distribution marker algorithm for DiffServ networks

Journal of Network and Computer Applications
M2I2tswTCM: A new efficient optimization marker algorithm to improve fairness bandwidth in DiffServ networks

Journal of Network and Computer Applications
A provision aware proportional fair sharing three colour marker

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.24

Visualization

Abstract

Internet Engineering Task Force (IETF) has proposed many new technologies to cover the new real time applications which have become very important in today's Internet demands. One such technology is Differentiated Services (DiffServ). DiffServ routers provide Per Hop Behaviors (PHBs) to aggregate traffic for different level of services. There is an unfairness problem that occur in a DiffServ networks. In this paper an improved version of the time sliding window three color marker is proposed and analyzed. The proposed algorithm is based on the adaptability concept of changing the constant value in the previous version of the algorithm (ItswTCM), in other words, changing the limit for the constant value without affecting the simplicity of the algorithm. The paper design and implement the algorithm with extensive simulations using NS-2 simulator to compare the proposed algorithm with previous algorithms. Results show that our new marker performs better than previous algorithms such as srTCM, trTCM, tswWTCM and ItswTCM in terms of fairness and number of yellow packets injected to the network in proportion to the committed rate.