STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Wide-sense nonblocking networks
SIAM Journal on Discrete Mathematics
On-line algorithms for path selection in a nonblocking network
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Shifting Graphs and Their Applications
Journal of the ACM (JACM)
Provisioning a virtual private network: a network design problem for multicommodity flow
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Dynamic Routing in Telecommunications Networks
Dynamic Routing in Telecommunications Networks
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
QoS's downfall: at the bottom, or not at all!
RIPQoS '03 Proceedings of the ACM SIGCOMM workshop on Revisiting IP QoS: What have we learned, why do we care?
Revisiting IP QoS: why do we care, what have we learned? ACM SIGCOMM 2003 RIPQOS workshop report
ACM SIGCOMM Computer Communication Review
Computer Networks
An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Capacity overprovisioning for networks with resilience requirements
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Information theory and the complexity of switching networks
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
Designing a predictable internet backbone with valiant load-balancing
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Comparison of border-to-border budget based network admission control and capacity overprovisioning
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
Resource pricing and the evolution of congestion control
Automatica (Journal of IFAC)
Adaptive load-balancing in WDM mesh networks with performance guarantees
Photonic Network Communications
Mathematics of Operations Research
Hi-index | 0.00 |
The two main alternatives for achieving high QoS on the public internet are (i) admission control and (ii) capacity overprovisioning. In the study of these alternatives the implicit (and sometimes explicit) message is that ideally, QoS issues should be dealt with by means of sophisticated admission control (AC) algorithms, and only because of their complexity providers fall on the simpler, perhaps more cost-effective, yet "wasteful" solution of capacity overprovisioning (CO) (see e.g. Olifer and Olifer [Wiley&Sons, 2005], Parekh [IWQoS'2003], Milbrandt et al. [J.Comm. 2007]). In the present survey we observe that these two alternatives are far from being mutually exclusive. Rather, for data critical applications, a substantial amount of "overprovisioning" is in fact a fundamental step of any safe and acceptable solution to QoS and resiliency requirements. We observe from examples in real life that in many cases large amounts of overprovisioning are already silently deployed within the internet domain and that in some restricted network settings they have become accepted practice even in the academic literature. Then we survey the main techniques currently in use to compute the provisioning capacities required in a resilient high QoS network.