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)
ACM Transactions on Computer Systems (TOCS)
Adaptive proportional delay differentiated services: characterization and performance evaluation
IEEE/ACM Transactions on Networking (TON)
Proportional differentiated services: delay differentiation and packet scheduling
IEEE/ACM Transactions on Networking (TON)
JoBS: Joint Buffer Management and Scheduling for Differentiated Services
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
Hop-count filtering: an effective defense against spoofed DDoS traffic
Proceedings of the 10th ACM conference on Computer and communications security
IEEE Transactions on Parallel and Distributed Systems
Mitigating congestion in wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
An Analytical Approach to Providing Controllable Differentiated Quality of Service in Web Servers
IEEE Transactions on Parallel and Distributed Systems
A Loss and Queuing-Delay Controller for Router Buffer Management
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Congestion Avoidance Based on Lightweight Buffer Management in Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
LRED: A Robust and Responsive AQM Algorithm Using Packet Loss Ratio Measurement
IEEE Transactions on Parallel and Distributed Systems
Quality-of-service differentiation on the internet: a taxonomy
Journal of Network and Computer Applications - Special issue: Network and information security: A computational intelligence approach
Algorithms and protocols for stateless constrained-based routing
Computer Communications
| Hi-index | 0.24 |
Network applications and users have very diverse service expectations and requirements, demanding for provisioning different levels of quality of service on the Internet. As the speed of network links has been rising at a pace that exceeds that of the growth in the buffer size, packet loss rate differentiation has been an active research topic. However, none of the existing packet dropping schemes for loss rate differentiation considered an important issue, that is, the retransmission overhead of dropped packets. In this paper, we design a hop-count based probabilistic packet dropper (HPPD) for congestion mitigation and loss rate differentiation. HPPD aims to meet a unique two-fold objective by two-dimensional loss rate differentiation: the primary one is the congestion mitigation that aims to reduce congestion in the first place by dropping intra-class packets differently based on their maturity levels to reduce retransmission cost; the other is inter-class proportional loss rate differentiation. The maturity level of a packet, the number of hops it has travelled, is inferred from its time-to-live value in the IP header. We propose a novel intra-class nth-root proportional dropping scheme. The scheme reduces retransmission cost by giving higher dropping probabilities to less mature packets while all packets have their forwarding chances. The n is a controllable parameter trading off dropping fairness for congestion mitigation. It provides great controllability to network operators. Simulation results show that HPPD can significantly mitigate the congestion by reducing the retransmission overhead of dropped packets and achieve the proportional loss rate differentiation at the same time.