An aggregate marker for bandwidth fairness in DiffServ

Selvaraj, S.; Ammasaigounden, N.

doi:10.1016/j.jnca.2012.07.020

Cited by 1 publication

(2 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This mechanism is performed at the core router by means of a queuing algorithm, such as weighted round robin (WRR), weighted fair queuing (WFQ), weighted random early detection (WRED) and random early detection (RED), with an input and output queue (RIO) [26,27]. Together with the unfairness problem of sharing bandwidth among flow aggregates, there are several causes for the locking of QoS in the DiffServ network [28][29][30]. Therefore, more marker algorithms have been designed to find the optimal solution for fair sharing of the TCP flow aggregates.…”

Section: Introductionmentioning

confidence: 99%

“…However, the marker algorithms were not designed to investigate the unfairness problem or responsive and nonresponsive fairness in the aggregate and their causes [28]. This article proposes a new efficient marker algorithm to find the optimal solution for the unfairness of sharing bandwidth, responsive and non-responsive fairness, and studies the performance measurement for the causes of the number of TCP flows.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An optimized aggregate marker algorithm for bandwidth fairness improvement in classifying traffic networks

Alkharasani

Othman

Abdullah

et al. 2016

J Wireless Com Network

View full text Add to dashboard Cite

The quality of service (QoS) requirements do not define a marker algorithm for service classes and managing network traffic to provide fair bandwidth sharing among aggregate flows. Additionally, the assured service is designed for applications relying on the Transmission Control Protocol (TCP). This article analyses and evaluates a new time sliding window traffic marker algorithm called the Optimized time sliding window Three Colour Marker (OtswTCM). The new design of the OtswTCM algorithm depends on the adaptability of the gamma (γ ) concept in the Improved time sliding window Three Colour Marker (ItswTCM), the Double Improved time sliding window Three Colour Marker (I 2 tswTCM) and the Double Modified Double Improved time sliding window Three Colour Marker (M 2 I 2 tswTCM) algorithms to affect fairness and multiple protocols in classifying network traffic. This is achieved through separating marker TCP and User Datagram Protocol (UDP) and extending the marking probability for injecting more green and yellow traffic into the network. The marking probability mechanism was also studied to check how parameters in the traffic rate affect fairness. Extensive simulations were carried out to implement the algorithm using the NS2 simulator and compare the proposed marker algorithm with several other algorithms. The results show that the proposed marker algorithm is not affected by the number of flows and outperforms the previous marker algorithms in terms of fairness.

show abstract