Skip to main content

Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4852))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Google Scholar 

  2. 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)

    Google Scholar 

  3. Ash, G.R.: Dynamic Routing in Telecommunications Networks. McGraw-Hill, New York (1998)

    Google Scholar 

  4. Atkinson, R.: QoS vs Bandwidth Overprovisioning. End-to-End mailing list (April 2001)

    Google Scholar 

  5. Beneš, V.E.: Optimal rearrangeable multistage connecting networks. Bell System Technical Journal 43, 1641–1656 (1964)

    MathSciNet  Google Scholar 

  6. Bhagat, S.: QoS: Solution Waiting for a Problem, position paper, Dept of Comp. Sci. Rutgers University

    Google Scholar 

  7. 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

  8. 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)

    Google Scholar 

  9. 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)

    Google Scholar 

  10. 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)

    Google Scholar 

  11. Feldman, P., Friedman, J., Pippenger, N.: Wide-sense nonblocking networks. SIAM Journal of Discrete Mathematics 1, 158–173 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  12. 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)

    Google Scholar 

  13. Gibbens, R., Kelly, F.: Resource pricing and the evolution of congestion control. Automatica 35 (1999)

    Google Scholar 

  14. 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)

    Google Scholar 

  15. Van Jacobson: A New View of Networking, Google Tech Talk (2007)

    Google Scholar 

  16. Keshav, S.: An Engineering Approach to Computer Networking. Addison-Wesley, Reading

    Google Scholar 

  17. Keslassy, I., Chang, C.-S., McKeown, N., Lee, D.-S.: Optimal load-balancing. In: Proceedings of IEEE Infocom, pp. 1712–1722 (2005)

    Google Scholar 

  18. 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)

    Google Scholar 

  19. Menth, M., Martin, R., Charzinski, J.: Capacity Overprovisioning for Networks with Resilience Requirements. In: Proceedings of SIGCOMM 2006, September 11-15 (2006)

    Google Scholar 

  20. Milbrandt, J., Menth, M., Junker, J.: Experience-Based Admission Control in the Presence of Traffic Changes. Journal of Communications 2(1) (January 2007)

    Google Scholar 

  21. Odlyzko, A.: Data Networks are Lightly Utilized, and will Stay that Way. The Review of Network Economics 2 (2003)

    Google Scholar 

  22. Olifer, N., Olifer, V.: Computer Networks: Principles, Technologies and Protocols for Network Design. John Wiley & Sons, Chichester (2005)

    Google Scholar 

  23. 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)

    Google Scholar 

  24. Pippenger, N.: Information Theory and the Complexity of Switching Networks. In: Proceedings of FOCS, pp. 113–118 (1975)

    Google Scholar 

  25. Pippenger, N.: On Rearrangeable and Non-Blocking Switching Networks. Journal of Computer Systems and Sciences 17(2), 145–162 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  26. Pippenger, N.: Telephone Switching Networks. In: Proceedings of Symposia in Applied Mathematics, vol. 26, pp. 101–133 (1982)

    Google Scholar 

  27. Pippenger, N., Valiant, L.G.: Shifting Graphs and Their Applications. Journal of the ACM 23(3), 423–432 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  28. Pippenger, N., Yao, A.C.: Rearrange-able networks with limited depth. SIAM Journal Algebraic Discrete Methods 3(4), 411–417 (1982)

    MATH  MathSciNet  Google Scholar 

  29. 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)

    Google Scholar 

  30. 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)

    Google Scholar 

  31. Shepherd, F.B., Winzer, P.J.: Selective randomized load balancing and mesh networks with changing demands. J. Opt. Netw. 5, 320–339 (2006)

    Article  Google Scholar 

  32. Telkamp, T.: Traffic Characteristics and Network Planning. In: ISMA 2002 (October 7-11, 2002)

    Google Scholar 

  33. Valiant, L.G., Brebner, G.J.: Universal Schemes for Parallel Communication STOC 1981, pp. 263–277 (1981)

    Google Scholar 

  34. Valiant, L.G.: A Scheme for Fast Parallel Communication. SIAM J. Comput. 11(2), 350–361 (1982)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jeannette Janssen Paweł Prałat

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics