Selective randomized load balancing and mesh networks with changing demands

We consider the problem of building cost-effective networks that are robust to dynamic changes in demand patterns. We compare several architectures using demand-oblivious routing strategies. Traditional approaches include single-hop architectures based on a (static or dynamic) circuit-switched core infrastructure and multihop (packet-switched) architectures based on point-to-point circuits in the core. To address demand uncertainty, we seek minimum cost networks that can carry the class of hose demand matrices. Apart from shortest-path routing, Valiant's randomized load balancing (RLB), and virtual private network (VPN) tree routing, we propose a third, highly attractive approach: selective randomized load balancing (SRLB). This is a blend of dual-hop hub routing and randomized load balancing that combines the advantages of both architectures in terms of network cost, delay, and delay jitter. In particular, we give empirical analyses for the cost (in terms of transport and switching equipment) for the discussed architectures, based on three representative carrier networks. Of these three networks, SRLB maintains the resilience properties of RLB while achieving significant cost reduction over all other architectures, including RLB and multihop Internet protocol/multiprotocol label switching (IP/MPLS) networks using VPN-tree routing.

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

[2]  Walid Ben-Ameur,et al.  NEW ECONOMICAL VIRTUAL PRIVATE NETWORKS , 2003 .

[3]  P. Winzer,et al.  Load-balanced architecture for dynamic traffic , 2005, OFC/NFOEC Technical Digest. Optical Fiber Communication Conference, 2005..

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

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

[6]  Edoardo Amaldi,et al.  Provisioning virtual private networks under traffic uncertainty , 2007, Networks.

[7]  Friedrich Eisenbrand,et al.  An improved approximation algorithm for virtual private network design , 2005, SODA '05.

[8]  Anwar Elwalid,et al.  Exploiting parallelism to boost data-path rate in high-speed IP/MPLS networking , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  Gianpaolo Oriolo,et al.  Hardness of robust network design , 2007 .

[10]  Harald Räcke,et al.  Minimizing Congestion in General Networks , 2002, FOCS.

[11]  Peter J. Winzer,et al.  Robust network design and selective randomized load balancing , 2005 .

[12]  Wayne D. Grover,et al.  Capacity Planning of Survivable Mesh-based Transport Networks under Demand Uncertainty , 2005, Photonic Network Communications.

[13]  Debasis Mitra,et al.  Randomized parallel communications on an extension of the omega network , 1987, JACM.

[14]  Tim Roughgarden,et al.  Simpler and better approximation algorithms for network design , 2003, STOC '03.

[15]  Walid Ben-Ameur,et al.  Routing of Uncertain Traffic Demands , 2005 .

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

[17]  Gianpaolo Oriolo,et al.  Hardness of robust network design , 2007, Networks.

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

[19]  Edoardo Amaldi,et al.  Provisioning virtual private networks under traffic uncertainty , 2007 .

[20]  Vijay P. Kumar,et al.  Switched optical backbone for cost-effective scalable core IP networks , 2003, IEEE Commun. Mag..

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

[22]  Subhash Suri,et al.  Designing Least-Cost Nonblocking Broadband Networks , 1997, J. Algorithms.

[23]  Judith Keijsper,et al.  Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks , 2007, SIAM J. Discret. Math..

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

[25]  Thomas Erlebach,et al.  Optimal bandwidth reservation in hose-model VPNs with multi-path routing , 2004, IEEE INFOCOM 2004.

[26]  Amit Kumar,et al.  Algorithms for provisioning virtual private networks in the hose model , 2002, TNET.

[27]  Albert G. Greenberg,et al.  Resource management with hoses: point-to-cloud services for virtual private networks , 2002, TNET.

[28]  Amit Kumar,et al.  Provisioning a virtual private network: a network design problem for multicommodity flow , 2001, STOC '01.

[29]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.