Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Explicit allocation of best-effort packet delivery service
IEEE/ACM Transactions on Networking (TON)
On achievable service differentiation with token bucket marking for TCP
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
TCP-friendly traffic conditioning in DiffServ networks: a memory-based approach
Computer Networks: The International Journal of Computer and Telecommunications Networking
Assured forwarding fairness using equation-based packet marking and packet separation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Novel dynamic delay allocation adjustment for improving bandwidth efficiency
Computer Communications
A provision-aware fair bandwidth distribution marker algorithm for DiffServ networks
Journal of Network and Computer Applications
Design and implementation of a Secure Bandwidth Broker Discovery Protocol
Computer Standards & Interfaces
Journal of Network and Computer Applications
ItswTCM: a new aggregate marker to improve fairness in DiffServ
Computer Communications
| Hi-index | 0.00 |
Surveys and studies on DiffServ exhibit existence of unfairness between aggregates in the excess bandwidth region. Many researchers have proved that providing a proportional fair share of the bandwidth between aggregates solve this. Based on this, aggregate markers such as ItswTCM and I2tswTCM are found to improve bandwidth fairness in DiffServ network among aggregates, when the aggregates are responsive in nature. However, co-existence of non-responsive aggregates with responsive aggregates leads to unfairness. Hence, in this paper an attempt has been made to evade the above unfairness by a new TSW based marker; where the drop precedence of the packet is arrived at an adaptive manner based on its estimated rate and the availability of the network resource. The unique feature of this proposed algorithm is that it provides enhanced fairness not only among responsive aggregates but also between responsive and non-responsive aggregates. Further, simulations have been carried out in NS-2 with changes in RTT, target rate of the aggregates and the number of flows in the aggregate. The results show that the proposed marker reduces the influence of these factors on the fairness performance exhibiting the suitability of the marker for different network topologies.