Performance Evaluation of CANIT Algorithm in Presence of Congestion Losses

2001

In this paper, we analize by queuing-simulation CANIT (Congestion Avoidance with Normalized Interval of Time) algorithm performances in presence of congestion losses. In a former work [3], we proposed the algorithm (CANIT) for TCP (Transmission Control Protocol) congestion avoidance phase in order to improve fairness during this phase, and we showed that using CANIT algorithm in an environment without loss, instead of standard congestion avoidance algorithm improves both congestion avoidance fairness and bandwith utilization for long RTT connections. In this paper, we consider congestion losses and show that the fairness as well as the bandwith utilization are more efficient when using CANI…

MPWCA-L: A New Clustering Algorithm to Improve Stability and QoS in MANETs

2013

An analytical study of mixed backoff schemes for QoS differentiation in wireless LAN

2009

In this paper, we propose an analytical model to evaluate performances of a wireless network composed by two groups of nodes using two different backoff schemes for channel access. The two different backoff schemes are used for QoS differentiation in term of priority. Our analysis results show that the priority group can have its performances enhanced, in term of saturation throughput and delay, without significant degradation of normal group nodes performances. This enhancement is also noticed for throughput efficiency at system level.