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

Alkharasani, Ameen M.; Othman, Мohamed

doi:10.1016/j.jnca.2012.01.021

Cited by 3 publications

(6 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [2], the Double Modified Double Improved time sliding window Three Colour Marker (M 2 I 2 tswTCM) ensured additional injected yellow traffic through a new definition for the adaptive factor γ . It ensured that the additional yellow traffic was injected in proportion to the CIR by using the adaptive new factor γ that is not constant, as in the I 2 tswTCM marker algorithm.…”

Section: Marker Algorithms Of Traffic Probabilitymentioning

confidence: 99%

“…UDP connections were used in Experiment 2 and UDP flows were used in CBR traffic with a sending rate that was set at 1.5 Mbps and a packet size of 512 bytes. The PIR for all marker algorithms was [2,33,34]. The simulation used representative or nonrepresentative aggregate protocols to evaluate the TCP performance, namely TCP and UDP protocols.…”

Section: Performance Evaluation and Simulation Setupmentioning

confidence: 99%

“…The current requirements of the Internet and telecommunications would need to be studied to enable them to work in harmony. Consider this instead: the Internet does not provide a guaranteed quality of service (QoS) for traditional data applications [1][2][3]. However, for real-time applications such as for telecommunications, QoS demands are important in the networks and need to be given adequate representation [2,[4][5][6].…”

Section: Introductionmentioning

confidence: 99%

“…The IntServ network's main goal is a guaranteed QoS on the individual connection; but in the DiffServ approach, the QoS is guaranteed at the individual router [1,2,19,20]. In addition, the IETF provided a perhop behaviour (PHB) mechanism for service classes to optimize QoS in the DiffServ network [21,22].…”

Section: Introductionmentioning

confidence: 99%

“…The first of these classes was the expedited forwarding (EF), in which the queue of the EF class maintained delay sensitivity for real time traffic flows. The second class, the assured forwarding (AF), was intended to provide a scale of reliable traffic flows [2,[23][24][25].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

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: Marker Algorithms Of Traffic Probabilitymentioning

confidence: 99%

Section: Performance Evaluation and Simulation Setupmentioning

confidence: 99%