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)
A new fair marker algorithm for DiffServ networks
Computer Communications
Fuzzy explicit marking: A unified congestion controller for Best-Effort and Diff-Serv networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A provision-aware fair bandwidth distribution marker algorithm for DiffServ networks
Journal of Network and Computer Applications
ItswTCM: a new aggregate marker to improve fairness in DiffServ
Computer Communications
An aggregate marker for bandwidth fairness in DiffServ
Journal of Network and Computer Applications
| Hi-index | 0.00 |
The Quality of Service (QoS) requirement Differentiated Services (DiffServ) typically having three main categories of performance metrics-bandwidth, latency and jitter. Although the DiffServ routers provide Per Hop Behaviours (PHBs) to aggregate traffic for different levels of service through the Assured Forwarding (AF) by provides service differentiation to aggregates, an unfairness problem still occurs in DiffServ networks. In order to improve bandwidth fairness along with efficient optimization to alleviate this problem, this article proposes a Double Modified Double Improved time sliding window Three Colour Marker (M^2I^2tswTCM) algorithm , which makes a new value of @c that depends on the logarithm peak information rate (PIR) and which is added to the adaptive factor that exists in the previous algorithm. Through extensive simulation implementation using the NS-2 under DiffServ network, we compare the fairness of the proposed algorithm with previous algorithms. The results show that the M^2I^2tswTCM algorithm performed better than the seven marker algorithms in terms of fair bandwidth distribution for different network provision levels.