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.

[1]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[2]  Carsten Lund,et al.  An information-theoretic approach to traffic matrix estimation , 2003, SIGCOMM '03.

[3]  Sudipta Sengupta,et al.  Efficient and robust routing of highly variable traffic , 2005 .

[4]  Cheng-Shang Chang,et al.  Load balanced Birkhoff-von Neumann switches , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[5]  Nick McKeown,et al.  Scaling internet routers using optics , 2003, SIGCOMM '03.

[6]  Cheng-Shang Chang,et al.  Load balanced Birkhoff-von Neumann switches, part I: one-stage buffering , 2002, Computer Communications.

[7]  N. McKeown,et al.  Designing a Predictable Internet Backbone Network , 2004 .

[8]  Cheng-Shang Chang,et al.  Load balanced Birkhoff-von Neumann switches, part II: multi-stage buffering , 2002, Comput. Commun..

[9]  Arun Vishwanath,et al.  Traffic constraints instead of traffic matrices: Capabilities of a new approach to traffic characterization , 2003 .

[10]  Edith Cohen,et al.  Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs , 2003, SIGCOMM '03.

[11]  Kavé Salamatian,et al.  Traffic matrix estimation: existing techniques and new directions , 2002, SIGCOMM '02.

[12]  Nick McKeown,et al.  Optimal load-balancing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..