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

Sani, Yusuf; Othman, Мohamed

doi:10.1016/j.jnca.2010.10.015

Cited by 6 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The analysis also showed the fairness behaviour of the proposed marker algorithm to be between the simulation and analytical marking probability. The simulation results verified that the fairness behaviour of the new marker algorithm was related with the other algorithms, such as the ItswTCM [33], I 2 tswTCM [34], MI 2 tswTCM [39], M 2 I 2 tswTCM [2], PaItswTCM [40] and PAPTCM [29] by verifying the CIR for the aggregate. In aggregate 1, the CIR was a constant value at 1 Mbps but the value increased from 1 to 14 Mbps in aggregate 2.…”

Section: Resultssupporting

confidence: 58%

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

Alkharasani

Othman

Abdullah

et al. 2016

J Wireless Com Network

Self Cite

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

Section: Resultssupporting

confidence: 58%

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

Alkharasani

Othman

Abdullah

et al. 2016

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

show abstract

“…To satisfy the bandwidth requirements of different priority web applications, DiffServ was proposed, which is the most important method to provide different QoS to different web applications. There are still many related work proposed recently . To provide the bandwidth guarantee to some web applications, there are also many proposed schemes: some early works such as the famous RSVP and PCP and some present works such as the schemes in and ESnet .…”

Section: Introductionmentioning

confidence: 99%

A universal QoS scheme for web applications

Wang

Zhang

2016

Int J Communication

View full text Add to dashboard Cite

SUMMARYThe common QoS metrics include delay, delay jitter, bandwidth guarantee, and so forth. Furthermore, the higher bandwidth requirement is also very important for some web applications, for instance, video on demand. Although QoS in networks has been well investigated during the past two decades, the existing QoS schemes usually aimed to satisfy only one QoS requirement for a particular web application. These schemes lack universality.Efficient and Fair eXplicit Congestion control Protocol (EFXCP) can achieve good network performance while maintaining low and stable queue length, which means low delay and delay jitter. In this paper, a new universal QoS scheme, E 2 FXCP, was proposed by extending EFXCP. Firstly, by utilizing the type of service field in the IP header to classify web applications into different priorities, a priority-based bandwidth allocation is implemented in E 2 FXCP, which can satisfy higher bandwidth requirement of some web applications. Secondly, by utilizing three bits in EFXCP header to mark different states of a web application with bandwidth guarantee requirement, E 2 FXCP can provide bandwidth guarantee to the web application. Simulations in Network Simulator 2 (NS2) have validated that E 2 FXCP is a universal QoS scheme, which can simultaneously satisfy multiple common QoS metrics for various web applications while maintaining good network performance.

show abstract

M2I2tswTCM: A new efficient optimization marker algorithm to improve fairness bandwidth in DiffServ networks

Alkharasani¹,

Othman²

2012

Journal of Network and Computer Applications

View full text Add to dashboard Cite

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

Cited by 6 publications

References 19 publications

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

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

A universal QoS scheme for web applications

M2I2tswTCM: A new efficient optimization marker algorithm to improve fairness bandwidth in DiffServ networks

Contact Info

Product

Resources

About