Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
The Markov-modulated Poisson process (MMPP) cookbook
Performance Evaluation
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Foundations of queueing theory
Foundations of queueing theory
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
Probability and statistics with reliability, queuing and computer science applications
Probability and statistics with reliability, queuing and computer science applications
Insensitivity in processor-sharing networks
Performance Evaluation
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Traffic matrix estimation: existing techniques and new directions
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
An information-theoretic approach to traffic matrix estimation
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Simulation analysis of RED with short lived TCP connections
Computer Networks: The International Journal of Computer and Telecommunications Networking
A first-principles approach to understanding the internet's router-level topology
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Why is the internet traffic bursty in short time scales?
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A network service curve approach for the stochastic analysis of networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The power of explicit congestion notification
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Does Over-Provisioning Become More or Less Efficient as Networks Grow Larger?
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Net neutrality: the technical side of the debate: a white paper
ACM SIGCOMM Computer Communication Review
Negotiation-based routing between neighboring ISPs
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
A constant revenue model for packet switched network
GIIS'09 Proceedings of the Second international conference on Global Information Infrastructure Symposium
Two schemes to reduce latency in short lived TCP flows
IEEE Communications Letters
AQUILA: adaptive resource control for QoS using an IP-based layered architecture
IEEE Communications Magazine
Cadenus: creation and deployment of end-user services in premium IP networks
IEEE Communications Magazine
A Markovian approach for modeling packet traffic with long-range dependence
IEEE Journal on Selected Areas in Communications
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
Integration of call signaling and resource management for IP telephony
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
The benefit of Class-of-Service (CoS) is an important topic in the ''Network Neutrality'' debate. As part of the debate, it has been suggested that over-provisioning is a viable strategy to meet performance targets of future applications, and that there is no need for to worry about provisioning differentiated services in an IP backbone for a small fraction of users needing better-than-best-effort service. In this paper, we quantify the extra capacity requirement for an over-provisioned classless (i.e., best-effort) network compared to a CoS network providing the same delay or loss performance for premium traffic. We first develop a link model that quantifies the required extra capacity (REC). To illustrate key parameters involved in analytically quantifying REC, we start with simple traffic distributions. Then, for more bursty traffic distributions (e.g., long-range dependent), we find the REC using ns-2 simulations of CoS and classless links. We, then, use these link models to quantify the REC for network topologies (obtained from Rocketfuel) under various scenarios including situations with ''closed loop'' traffic generated by many TCP sources that adapt to the available capacity. We also study the REC under link and node failures. We show that REC can still be significant even when the proportion of premium traffic requiring performance assurances is small, a situation often considered benign for the over-provisioning alternative. We also show that the impact of CoS on best-effort (BE) traffic is relatively small while still providing the desired performance for premium traffic.