Computer networks: a systems approach
Computer networks: a systems approach
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Performance bonds for flow control protocols
IEEE/ACM Transactions on Networking (TON)
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
TCP is max-plus linear and what it tells us on its throughput
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Understanding TCP Vegas: a duality model
Journal of the ACM (JACM)
A min, + system theory for constrained traffic regulation and dynamic service guarantees
IEEE/ACM Transactions on Networking (TON)
A duality model of TCP and queue management algorithms
IEEE/ACM Transactions on Networking (TON)
Performance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control
ACM SIGCOMM Computer Communication Review
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Normalized queueing delay: congestion control jointly utilizing delay and marking
IEEE/ACM Transactions on Networking (TON)
Sensor network calculus – a framework for worst case analysis
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
TCP Vegas: end to end congestion avoidance on a global Internet
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In delay-based TCP congestion avoidance mechanisms, a source adjusts its window size to adapt to changes in network conditions as measured through changing queueing delays. Although network calculus (NC) has been used to study window flow control and determine performance bounds, there is a lack of a bridge between NC theory and the practical issues of delay-based TCP congestion avoidance. In this paper, we use an NC-based approach to derive ideal congestion controllers for representative delay-based window flow control models with time-variant feedback delays. We show that the basic delay-based TCP congestion avoidance mechanisms in TCP Vegas, Enhanced TCP Vegas, and FAST TCP can be viewed as different approaches to approximating a certain NC controller. Moreover, we derive another NC controller that is explicitly constructed to address the throughput degradation of the current delay-based methods due to delayed acknowledgement (ACK) packets caused by network traffic in the reverse path (ACK packet) direction. The approximation of this F-model NC-based controller is shown to provide better throughput and fairness over the existing delay-based methods for a variety of network topologies in ns-2 simulations.