Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
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)
Adaptive packet marking for maintaining end-to-end throughput in a differentiated-services internet
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
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
How to Make Assured Service More Assured
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Design, implementation and evaluation of a QoS-aware transport protocol
Computer Communications
AIMD penalty shaper to enforce assured service for TCP flows
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Penalty shaper to enforce assured service for TCP flows
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
An aggregate marker for bandwidth fairness in DiffServ
Journal of Network and Computer Applications
A provision aware proportional fair sharing three colour marker
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Fairness is one of the important problems in assured forwarding (AF) performance in the differentiated services (DiffServ) framework [An architecture for differentiated services, RFC 2475, IETF, December 1998; A two-bit differentiated services architecture for the Internet, Internet-draft, draft-nichols-diff-svc-arch-02.pdf, IETF, April I999]. In this paper we present a two-part solution for the fairness problem in AF. The first part is a new packet marking algorithm called equation-based marking (EBM) and is based on the TCP model given by Padhye et al. [Modeling TCP throughput: A simple model and its empirical validation, in: Proceedings of ACM SIGCOMM '98, October 1998]. EBM is to handle the problems found in other marking schemes regarding fairness among heterogeneous TCP flows through a tight feedback-loop operation and adaptation of the packet marking probability to network conditions. The second part is called packet separation used at routers to handle the fairness between responsive and nonresponsive traffic. We evaluate the performance of a packet marker that uses EBM as the marking algorithm using in-depth simulation. We prove, analytically and using simulation, the correctness of the marking algorithm and compare it with other marking schemes for different network scenarios. We also use simulation to show the effectiveness of the packet separation mechanism in solving the fairness problem between responsive and non-responsive traffic. Our evaluation results demonstrate the effectiveness of EBM along with packet separation in providing the required fairness among heterogeneous flows and ensuring protection against non-assured traffic.