Abstract
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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Armitage, G.J.: Revisiting IP QoS: Why do we care, what have we learned. ACM 2003 RIPOS Workshop Report, ACM SIGCOMM Comp. Comm. Rev. vol. 33(5) (October 2003)
Arora, S., Leighton, F.T., Maggs, B.M.: On-line Algorithms for Path Selection in a Nonblocking Network. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pp. 149–158 (May 1990)
Ash, G.R.: Dynamic Routing in Telecommunications Networks. McGraw-Hill, New York (1998)
Atkinson, R.: QoS vs Bandwidth Overprovisioning. End-to-End mailing list (April 2001)
Beneš, V.E.: Optimal rearrangeable multistage connecting networks. Bell System Technical Journal 43, 1641–1656 (1964)
Bhagat, S.: QoS: Solution Waiting for a Problem, position paper, Dept of Comp. Sci. Rutgers University
Casner, S., Alaettinoglu, C., Kuan, C.-C.: A Fine-Grained View of High-Performance Networking, NANOG 22, http://www.nanog.org/mtg-0105/casner.html
Crowcroft, J., Hand, S., Mortier, R., Roscoe, T., Warfield, A.: QoS’s Downfall: At the bottom, or not at all! In: Proceedings of the Workshop on Revisiting IP QoS (RIPQoS), at ACM SIGCOMM 2003, August 27, 2003, Karlsruhe, Germany (2003)
Dellamonica Jr., D., Kohayakawa, Y.: An algorithmic Friedman–Pippenger theorem on tree embeddings and applications to routing. In: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 1038–1044 (2006)
Feldman, P., Friedman, J., Pippenger, N.: Non-blocking networks. In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pp. 247–254 (May 1986)
Feldman, P., Friedman, J., Pippenger, N.: Wide-sense nonblocking networks. SIAM Journal of Discrete Mathematics 1, 158–173 (1988)
Fraleigh, C., Tobagi, F., Diot, C.: Provisioning IP Backbone Networks to Support Latency Sensitive Traffic. In: Proceedings of IEEE Infocom 2003, San Francisco, USA (2003)
Gibbens, R., Kelly, F.: Resource pricing and the evolution of congestion control. Automatica 35 (1999)
Gupta, A., Kleinberg, J.M., Kumar, A., Rastogi, R., Yener, B.: Provisioning a virtual private network: a network design problem for multicommodity flow. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 389–398 (2001)
Van Jacobson: A New View of Networking, Google Tech Talk (2007)
Keshav, S.: An Engineering Approach to Computer Networking. Addison-Wesley, Reading
Keslassy, I., Chang, C.-S., McKeown, N., Lee, D.-S.: Optimal load-balancing. In: Proceedings of IEEE Infocom, pp. 1712–1722 (2005)
Martin, R., Menth, M., Charzinski, J.: Comparison of Border-to-Border Budget Based Network Admission Control and Capacity Overprovisioning. In: Boutaba, R., Almeroth, K.C., Puigjaner, R., Shen, S., Black, J.P. (eds.) NETWORKING 2005. LNCS, vol. 3462, pp. 1056–1068. Springer, Heidelberg (2005)
Menth, M., Martin, R., Charzinski, J.: Capacity Overprovisioning for Networks with Resilience Requirements. In: Proceedings of SIGCOMM 2006, September 11-15 (2006)
Milbrandt, J., Menth, M., Junker, J.: Experience-Based Admission Control in the Presence of Traffic Changes. Journal of Communications 2(1) (January 2007)
Odlyzko, A.: Data Networks are Lightly Utilized, and will Stay that Way. The Review of Network Economics 2 (2003)
Olifer, N., Olifer, V.: Computer Networks: Principles, Technologies and Protocols for Network Design. John Wiley & Sons, Chichester (2005)
Parekh, A.: Why there is no QoS and what to do about it. In: Jeffay, K., Stoica, I., Wehrle, K. (eds.) IWQoS 2003. LNCS, vol. 2707, Springer, Heidelberg (2003)
Pippenger, N.: Information Theory and the Complexity of Switching Networks. In: Proceedings of FOCS, pp. 113–118 (1975)
Pippenger, N.: On Rearrangeable and Non-Blocking Switching Networks. Journal of Computer Systems and Sciences 17(2), 145–162 (1978)
Pippenger, N.: Telephone Switching Networks. In: Proceedings of Symposia in Applied Mathematics, vol. 26, pp. 101–133 (1982)
Pippenger, N., Valiant, L.G.: Shifting Graphs and Their Applications. Journal of the ACM 23(3), 423–432 (1976)
Pippenger, N., Yao, A.C.: Rearrange-able networks with limited depth. SIAM Journal Algebraic Discrete Methods 3(4), 411–417 (1982)
Prasad, R.S., Winzer, P.J., Borst, S., Thottan, M.K.: Queuing Delays in Randomized Load Balanced Networks. In: Proceedings of IEEE Infocom 2007 (2007)
Rui, Z.-S., McKeown, N.: Designing a Predictable Internet Backbone with Valiant Load-Balancing. In: de Meer, H., Bhatti, N. (eds.) IWQoS 2005. LNCS, vol. 3552, pp. 178–192. Springer, Heidelberg (2005)
Shepherd, F.B., Winzer, P.J.: Selective randomized load balancing and mesh networks with changing demands. J. Opt. Netw. 5, 320–339 (2006)
Telkamp, T.: Traffic Characteristics and Network Planning. In: ISMA 2002 (October 7-11, 2002)
Valiant, L.G., Brebner, G.J.: Universal Schemes for Parallel Communication STOC 1981, pp. 263–277 (1981)
Valiant, L.G.: A Scheme for Fast Parallel Communication. SIAM J. Comput. 11(2), 350–361 (1982)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
López-Ortiz, A. (2007). Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design. In: Janssen, J., Prałat, P. (eds) Combinatorial and Algorithmic Aspects of Networking. CAAN 2007. Lecture Notes in Computer Science, vol 4852. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77294-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-77294-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77293-4
Online ISBN: 978-3-540-77294-1
eBook Packages: Computer ScienceComputer Science (R0)