Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Approximate fairness through differential dropping
ACM SIGCOMM Computer Communication Review
Accurate, scalable in-network identification of p2p traffic using application signatures
Proceedings of the 13th international conference on World Wide Web
BLINC: multilevel traffic classification in the dark
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
A Longitudinal Study of P2P Traffic Classification
MASCOTS '06 Proceedings of the 14th IEEE International Symposium on Modeling, Analysis, and Simulation
Flow rate fairness: dismantling a religion
ACM SIGCOMM Computer Communication Review
Novel techniques and models for network traffic profiling: characterizing the unknown
Novel techniques and models for network traffic profiling: characterizing the unknown
Can ISPS and P2P users cooperate for improved performance?
ACM SIGCOMM Computer Communication Review
Offline/realtime traffic classification using semi-supervised learning
Performance Evaluation
User-level performance evaluation of VoIP using ns-2
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
P4p: provider portal for applications
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Policing freedom to use the internet resource pool
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
IEEE Communications Magazine
IEEE Spectrum
| Hi-index | 0.00 |
The ever-increasing share of the peer-to-peer (P2P) traffic flowing in the Internet has unleashed new challenges to the quality of service provisioning. Striving to accommodate the rise of P2P traffic or to curb its growth has led to many schemes being proposed: P2P caches, P2P filters, ALTO mechanisms and re-ECN. In this paper, we propose a scheme named ‘UARA:textbfUser/Application-aware RED-based AQM’ which has a better perspective on the problem: UARA is proposed to be implemented at the edge routers providing real-time near-end-user traffic shaping and congestion avoidance. UARA closes the loopholes exploited by the P2P traffic by bringing under control the P2P users who open and use numerous simultaneous connections. In congestion times, UARA monitors the flows of each user and caps the bandwidth used by ‘power users’ which leads to the fair usage of network resources. While doing so, UARA also prioritizes the real-time traffic of each user, further enhancing the average user quality of experience (QoE). UARA hence centralizes three important functionalities at the edge routers: (1) congestion avoidance; (2) providing user fairness; (3) prioritizing real-time traffic. The simulation results indicate that average user QoE is significantly improved in congestion times with UARA at the edge routers. Copyright © 2011 John Wiley & Sons, Ltd. (It is perhaps best put by the authors of [28] regarding their own fair bandwidth allocation scheme: ‘Some claim that such fair allocation mechanisms open the door to denial-of-service attacks through flow-spoofing; while we do not believe such arguments are sufficient to nullify the desirability of fair-bandwidth allocations, and that this paper is not the place to delve into such arguments at length, we did want to note the existence of objections to the fair-bandwidth allocation paradigm.’)