Maximum Flow Minimum Energy routing for ExaScale Cloud Computing systems

This paper explores the feasibility of Exascale Cloud Computing over the Nobel-EU (European Union) IP backbone network. The EU represents an attractive environment for Exascale Cloud Computing, due to its well-established IP infrastructure with relatively low edge distances. An Exascale Cloud Computing system linking hundreds of data-centers can interconnect potentially millions of servers, considerably larger than the world's most powerful supercomputer. However, the US Dept. of Energy has recently concluded that cloud computing is too expensive and suitable only for scientific applications with minimal communications requirements. This paper explores a Future-Internet network to address these concerns. The network combines several technologies; (i) a QoS-aware router scheduling algorithm, (ii) a flow resource-reservation signalling algorithm, and (iii) flow aggregation, to establish highly-efficient guaranteed-rate connections between data-centers. A Maximum-Flow Minimum-Energy routing algorithm is used to route high-capacity ”trunks” between data-centers with minimum energy requirements. The traffic flows between data-centers are aggregated onto the trunks, to achieve exceptionally low latencies with improved link utilizations and energy-efficiencies. The high packet loss rates and large queueing delays of traditional Best-Effort Internet are eliminated, and the latency over the cloud is reduced to the fiber latency. The average fiber latencies over the Nobel-EU network are a few milliseconds, and they can be mitigated with multithreading. The bisection bandwidth of the cloud can be improved to match the demand by activating dark fiber. By lowering latencies, the utilization of the Internet data-centers will also increase, further improving overall energy efficiency. The proposed Future Internet network can improve the utilization and energy efficiency of both the communications and computations in Cloud Computing systems.

[1]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[2]  Dave Gilbert,et al.  Provisioning mission-critical telerobotic control systems over internet backbone networks with essentially-perfect QoS , 2010, IEEE Journal on Selected Areas in Communications.

[3]  Ted H. Szymanski,et al.  Max-Flow Min-Cost Routing in a Future-Internet with Improved QoS Guarantees , 2013, IEEE Transactions on Communications.

[4]  Ted H. Szymanski,et al.  Low latency energy efficient communications in global-scale cloud computing systems , 2013, EEHPDC '13.

[5]  Jon Crowcroft,et al.  Congestion control mechanisms and the best effort service model , 2001, IEEE Netw..

[6]  Cornelia Kappler,et al.  RMD-QOSM: The NSIS Quality-of-Service Model for Resource Management in Diffserv , 2010, RFC.

[7]  Barath Raghavan,et al.  The energy and emergy of the internet , 2011, HotNets-X.

[8]  Ted H. Szymanski,et al.  A low-jitter guaranteed-rate scheduling algorithm for packet-switched ip routers , 2009, IEEE Transactions on Communications.

[9]  Nick McKeown,et al.  Designing Packet Buffers for Router Linecards , 2008, IEEE/ACM Transactions on Networking.

[10]  J. Koomey Worldwide electricity used in data centers , 2008 .

[11]  David A. Maltz,et al.  Network traffic characteristics of data centers in the wild , 2010, IMC '10.

[12]  Franco Davoli,et al.  Energy Efficiency in the Future Internet: A Survey of Existing Approaches and Trends in Energy-Aware Fixed Network Infrastructures , 2011, IEEE Communications Surveys & Tutorials.

[13]  Alberto Leon-Garcia,et al.  Communication Networks , 2000 .

[14]  Alberto Leon-Garcia,et al.  Communication Networks: Fundamental Concepts and Key Architectures , 1999 .

[15]  Brett Chapman,et al.  Deploying QoS for Cisco IP and Next Generation Networks: The Definitive Guide , 2009 .

[16]  Murali S. Kodialam,et al.  On guaranteed smooth scheduling for input-queued switches , 2005, IEEE/ACM Transactions on Networking.