Designing a Predictable Internet Backbone with Valiant Load-Balancing
Network operators would like their network to support current and future traffic matrices, even when links and routers fail. Not surprisingly, no backbone network can do this today: It is hard to accurately measure the current matrix, and harder still to predict future ones. Even if the matrices are known, how do we know a network will support them, particularly under failures? As a result, today’s networks are designed in a somewhat ad-hoc fashion, using rules-of-thumb and crude estimates of current and future traffic.
Previously we proposed the use of Valiant Load-balancing (VLB) for backbone design. It can guarantee 100% throughput to any traffic matrix, even under link and router failures. Our initial work was limited to homogeneous backbones in which routers had the same capacity. In this paper we extend our results in two ways: First, we show that the same qualities of service (guaranteed support of any traffic matrix with or without failure) can be achieved in a realistic heterogeneous backbone network; and second, we show that VLB is optimal, in the sense that the capacity required by VLB is very close to the lower bound of total capacity needed by any architecture in order to support all traffic matrices.
KeywordsLink Capacity Backbone Network Star Topology Node Capacity Traffic Matrix
Unable to display preview. Download preview PDF.
- 1.Applegate, D., Cohen, E.: Making intra-domain routing robust to changing and uncertain traffic demands: Understanding fundamental tradeoffs. In: Proceedings of the ACM SIGCOMM 2003 Conference (2003)Google Scholar
- 2.Chang, C.-S., Lee, D.-S., Jou, Y.-S.: Load balanced Birkhoff-von Neumann switches, Part I: One-stage buffering. In: Proceedings of IEEE HPSR 2001 (May 2001)Google Scholar
- 3.Keslassy, I., Chang, C.-S., McKeown, N., Lee, D.-S.: Optimal load-balancing. In: Proceedings of IEEE Infocom 2005 (March 2005)Google Scholar
- 4.Keslassy, I., Chuang, S.-T., Yu, K., Miller, D., Horowitz, M., Solgaard, O., McKeown, N.: Scaling Internet routers using optics. In: Proceedings of ACM SIGCOMM 2003, Computer Communication Review, October 2003, vol. 33(4), pp. 189–200 (2003)Google Scholar
- 5.Kodialam, M., Lakshman, T.V., Sengupta, S.: Efficient and robust routing of highly variable traffic. In: HotNets III (November 2004)Google Scholar
- 6.Medina, A., Taft, N., Salamatian, K., Bhattacharyya, S., Diot, C.: Traffic matrix estimation: Existing techniques and new directions. In: Proceedings of ACM SIGCOMM 2002, Pittsburgh, USA (August 2002)Google Scholar
- 7.Prasanna, G., Vishwanath, A.: Traffic constraints instead of traffic matrices: Capabilities of a new approach to traffic characterization. In: Providing quality of service in heterogeneous environments: Proceedings of the 18th International Teletraffic Congress (2003)Google Scholar
- 9.Zhang, Y., Roughan, M., Lund, C., Donoho, D.: An information-theoretic approach to traffic matrix estimation. In: Proceedings of ACM SIGCOMM 2003, pp. 301–312. ACM Press, New York (2003)Google Scholar
- 10.Zhang-Shen, R., McKeown, N.: Designing a predictable Internet backbone network. In: HotNets III (November 2004)Google Scholar
- 11.Zhang-Shen, R., McKeown, N.: Designing a predictable Internet backbone with Valiant load-balancing (extended version). Stanford HPNG Technical Report TR05-HPNG-040605 (April 2005)Google Scholar