Low-Carbon Routing Algorithms For Cloud Computing Services in IP-over-WDM Networks Achille Pattavina To be presented at ICC 2012, Ottawa, Canada.

Slides:



Advertisements
Similar presentations
ICT Infrastructures and Climate Change Chaesub Lee Chairman of ITU-T SG 13 (ETRI, Korea)
Advertisements

Lecture 4. Topics covered in last lecture Multistage Switching (Clos Network) Architecture of Clos Network Routing in Clos Network Blocking Rearranging.
Internetworking II: MPLS, Security, and Traffic Engineering
LASTor: A Low-Latency AS-Aware Tor Client
POWER EFFICIENCY ROUTING ALGORITHMS OF WIRELESS SENSOR NETWORKS
CSC 778 Fall 2007 Routing & Wavelength Assignment Vinod Damle Hardik Thakker.
Lecture: 4 WDM Networks Design & Operation
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
AGH University of Science and Technology NOBEL WP2 Meeting, Berlin May QoS/GoS Routing in Optical Networks.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Green Cloud Computing Hadi Salimi Distributed Systems Lab, School of Computer Engineering, Iran University of Science and Technology,
Towards Virtual Routers as a Service 6th GI/ITG KuVS Workshop on “Future Internet” November 22, 2010 Hannover Zdravko Bozakov.
Data Center Demand Response: Coordinating IT and the Smart Grid Zhenhua Liu California Institute of Technology December 18, 2013 Acknowledgements:
GREEN CLOUD By Sphoorthy. LOGO WHAT IS CLOUD COMPUTING? Cloud computing is a model for enabling convenient, on- demand network access to a shared pool.
“ElasticTree: Saving energy in data center networks“ by Brandon Heller, Seetharaman, Mahadevan, Yiakoumis, Sharma, Banerjee, McKeown presented by Nicoara.
Montek Singh COMP Nov 10,  Design questions at various leves ◦ Network Adapter design ◦ Network level: topology and routing ◦ Link level:
1 A Vehicle Route Management Solution Enabled by Wireless Vehicular Networks Kevin Collins and Gabriel-Miro Muntean IEEE INFOCOM 2008.
High Performance Router Architectures for Network- based Computing By Dr. Timothy Mark Pinkston University of South California Computer Engineering Division.
Traffic Engineering With Traditional IP Routing Protocols
Data-Centric Energy Efficient Scheduling for Densely Deployed Sensor Networks IEEE Communications Society 2004 Chi Ma, Ming Ma and Yuanyuan Yang.
1 Evgeny Bolotin – Efficient Routing, DATE 2007 Routing Table Minimization for Irregular Mesh NoCs Evgeny Bolotin, Israel Cidon, Ran Ginosar, Avinoam Kolodny.
Sponsored by BellSouth, Cisco, UC Micro Program Design and Development of an MPLambdaS Simulator Jian Wang, Biswanath Mukherjee, S, J, Ben Yoo University.
Architecture and Routing for NoC-based FPGA Israel Cidon* *joint work with Roman Gindin and Idit Keidar.
Kick-off meeting 3 October 2012 Patras. Research Team B Communication Networks Laboratory (CNL), Computer Engineering & Informatics Department (CEID),
A Survey of Home Energy Management Systems in Future Smart Grid Communications By Muhammad Ishfaq Khan.
A Scalable, Commodity Data Center Network Architecture.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
Advanced Energy Management in Cloud Computing multi data center environments Giuliana Carello, DEI, Politecnico di Milano Danilo.
CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.
Steady and Fair Rate Allocation for Rechargeable Sensors in Perpetual Sensor Networks Zizhan Zheng Authors: Kai-Wei Fan, Zizhan Zheng and Prasun Sinha.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
CSC 778 Presentation Waveband Switching Neil D’souza Jonathan Grice.
BENEFITTING FROM GREEN IT – FINDINGS FROM THE SUSTEIT PROJECT Professor Peter James
NOBEL WP5 Meeting Munich – 14 June 2005 WP5 Cost Study Group Author:Martin Wade (BT) Lead:Andrew Lord (BT) Relative Cost Analysis of Transparent & Opaque.
Integrated Dynamic IP and Wavelength Routing in IP over WDM Networks Murali Kodialam and T. V. Lakshman Bell Laboratories Lucent Technologies IEEE INFOCOM.
Report Advisor: Dr. Vishwani D. Agrawal Report Committee: Dr. Shiwen Mao and Dr. Jitendra Tugnait Survey of Wireless Network-on-Chip Systems Master’s Project.
Network Aware Resource Allocation in Distributed Clouds.
Towards Sustainable Portable Computing through Cloud Computing and Cognitive Radios Vinod Namboodiri Wichita State University.
2015/10/1 A color-theory-based energy efficient routing algorithm for mobile wireless sensor networks Tai-Jung Chang, Kuochen Wang, Yi-Ling Hsieh Department.
1 Protection Mechanisms for Optical WDM Networks based on Wavelength Converter Multiplexing and Backup Path Relocation Techniques Sunil Gowda and Krishna.
Research Testbeds to help reduce Global Warming Bill St. Arnaud CANARIE Inc – Unless otherwise noted all material.
DAC PROJECT Capacity Building in Balcan Countries for the Abatement of Greenhouse Gases Setting priorities for GHG emissions’ reduction George Mavrotas.
On the Cost/Delay Tradeoff of Wireless Delay Tolerant Geographic Routing Argyrios Tasiopoulos MSc, student, AUEB Master Thesis presentation.
NREL is a national laboratory of the U.S. Department of Energy, Office of Energy Efficiency and Renewable Energy, operated by the Alliance for Sustainable.
Presenter: Jonathan Murphy On Adaptive Routing in Wavelength-Routed Networks Authors: Ching-Fang Hsu Te-Lung Liu Nen-Fu Huang.
Small School Thin Client Network Using Windows OS.
Brussels Workshop Use case 3 11/09/2015 Mario Sisinni.
BARD / April BARD: Bayesian-Assisted Resource Discovery Fred Stann (USC/ISI) Joint Work With John Heidemann (USC/ISI) April 9, 2004.
1 Presented by Sarbagya Buddhacharya. 2 Increasing bandwidth demand in telecommunication networks is satisfied by WDM networks. Dimensioning of WDM networks.
Dzmitry Kliazovich University of Luxembourg, Luxembourg
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
11/02/2001 Workshop on Optical Networking 1 Design Method of Logical Topologies in WDM Network with Quality of Protection Junichi Katou Dept. of Informatics.
1 Dynamic RWA Connection requests arrive sequentially. Setup a lightpath when a connection request arrives and teardown the lightpath when a connection.
GridNets 2006 – October 1 st Grid Resource Management by means of Ant Colony Optimization Gustavo Sousa Pavani and Helio Waldman Optical Networking Laboratory.
Power to the Coast Project Presented by: Su Wei Tan Industrial Research Ltd.
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Low Carbon Virtual Private Clouds Fereydoun Farrahi Moghaddam, Mohamed Cheriet, Kim Khoa Nguyen Synchromedia Laboratory Ecole de technologie superieure,
Logically Centralized? State Distribution Trade-offs in Software Defined Networks.
Using routing protocols for reducing power consumption - a metric-based approach Shankar Raman, Balaji Venkat*, Gaurav Raina Indian Institute of Technology.
Yiting Xia, T. S. Eugene Ng Rice University
Constraint-Based Routing
What Are Routers? Routers are an intermediate system at the network layer that is used to connect networks together based on a common network layer protocol.
Isabella Cerutti, Andrea Fumagalli, Sonal Sheth
A SEMINAR ON HYBRID POWER SYSTEM
CIS679: Anycast Review of Last lecture Anycast.
Data and Computer Communications
Backbone Traffic Engineering
Chapter 10 RWA 2019/5/9.
QoS routing Finding a path that can satisfy the QoS requirement of a connection. Achieving high resource utilization.
Presentation transcript:

Low-Carbon Routing Algorithms For Cloud Computing Services in IP-over-WDM Networks Achille Pattavina To be presented at ICC 2012, Ottawa, Canada

Achille Pattavina Summary  Motivations  Power consumption models  Low-carbon routing algorithms  Case study  Conclusions 2

Achille Pattavina Summary  Motivations  ICT and emissions  Data centers and renewable energy  Power consumption models  Low-carbon routing algorithms  Case study  Conclusions 3

Achille Pattavina ICT and emissions  ICT responsable of 8% of global energy consumption  Up to 20% in 2020  Data centers count for 2% of electrical consumption  ICT is the key for a Low-Carbon Economy  Great benefits in reduction of greenhouse gas emissions using renewable energy sources (sun and wind)  Difference between CO2 reduction and energy efficiency 4

Achille Pattavina Data center and renewable energy  Renewable energy sites are usually in remote locations, hard to connect to electrical grid  Data centers delocalization  Data centers moved nearby renewable energy sources (ex. Google, Microsoft)  Avoid power transmissions lines losses (up to 15 %)  Connected through optical network  Our aim is to do a dynamic-low CO2 emissions routing  «Follow the Wind, Follow the Sun» architectures  Trade-off between transport power and power needed to elaborate each connection inside a DC 5

Achille Pattavina 6 Renewable energy distribution  Solar powered data centers  Power profile during 24 hours of the day  Shifted according to the time zone  Variations mainly do to diurnal cycle of the sun  power from 6 to 22  Wind powered data centers  Power profile during 24 hours of the day  Shifted according to the time zone  Variations due to the waxing and waning of the wind  hard to predict

Achille Pattavina Summary  Motivations  Power consumption models  Data center power supply  Transport power  Processing power  Low-carbon routing algorithms  Case study  Conclusions 7

Achille Pattavina Renewable energy production 8

Achille Pattavina Transport power  Transport cost of a lightpath is function of the hop number H  IP-over-WDM basic configuration (Switching Lv. 3) 9 P t,IP = 2*H*P tr1 + (H-1)*P IP Source: F. Musumeci, M. Tornatore, and A. Pattavina, “A power consumption analysis for IP-Over-WDM core network architectures”

Achille Pattavina Transport power  Transport cost of a lightpath is function of the hop number H  IP-over-WDM basic configuration (Switching Lv. 3)  IP-over-SDH-over-WDM configuration (Switching Lv. 2) 10 Source: F. Musumeci, M. Tornatore, and A. Pattavina, “A power consumption analysis for IP-Over-WDM core network architectures” P t,SDH = 2*H*P tr2 + (H+1)*P SDH +4*P SR P t,IP = 2*H*P tr1 + (H-1)*P IP

Achille Pattavina Transport power  Transport cost of a lightpath is function of the hop number H  IP-over-WDM basic configuration (Switching Lv. 3)  IP-over-SDH-over-WDM configuration (Switching Lv. 2)  IP-over-WDM Opaque configuration (Switching Lv. 1) 11 Source: F. Musumeci, M. Tornatore, and A. Pattavina, “A power consumption analysis for IP-Over-WDM core network architectures” P t,SDH = 2*H*P tr2 + (H+1)*P SDH +4*P SR P t,IP = 2*H*P tr1 + (H-1)*P IP P t,OP = 2*H*P tr2 + (H+1)*P o +2*P SR

Achille Pattavina Transport power  Transport cost of a lightpath is function of the hop number H  IP-over-WDM basic configuration (Switching Lv. 3)  IP-over-SDH-over-WDM configuration (Switching Lv. 2)  IP-over-WDM Opaque configuration (Switching Lv. 1) 12 Source: F. Musumeci, M. Tornatore, and A. Pattavina, “A power consumption analysis for IP-Over-WDM core network architectures” P t,OP = 2*H*P tr2 + (H+1)*P o +2*P SR P t,SDH = 2*H*P tr2 + (H+1)*P SDH +4*P SR P t,IP = 2*H*P tr1 + (H-1)*P IP Network Element Power Consumption *per 10 Gbit/s Trasponder (P tr1 ) 34.5 (W) Trasponder (P tr2 ) (W) Short-reach (P SR ) (W) DXC (P SDH ) (W) IP router (P IP ) 145 (W) Optical switch (P O ) 1.5 (W)

Achille Pattavina Processing power 13 *Baliga et al., “Green cloud computing: Balancing energy in processing, storage and transport”.

Achille Pattavina 14 Data center consumption and design  Server consumption Cooling factor + OH Conversion time

Achille Pattavina Summary  Motivations  Power consumption models  Low-carbon routing algorithms  Anycast routing  Energy-aware routing algorithms  Case study  Conclusions 15

Achille Pattavina Routing problem 16 0 Dummy Node Anycast link CO 2 Is it better to route towards a remote DC with renewable energy ? Anycast Routing Problem Trade-off between transport and processing power

Achille Pattavina Algorithms  Routing algorithms: aim to minimize the total non-renewable (brown) energy of the network (emissions  1 kwh=228 gCO2)  Sun&Wind Energy-Aware Routing (SWEAR): chooses for each connection between two paths  1 - Maximum usage of renewable energy  2 - Lowest transport energy  Green Energy-Aware Routing (GEAR): finds for each connection the path with  Lowest non-renewable (brown) energy  Trade-off bbetween transport power and (green) processing power 17

Achille Pattavina SWEAR A simple example CO 2 Routing towards Green Sources Load Balancing when the traffic on a link overcome the fixed threshold P lg -P ls < P p ?

Achille Pattavina SWEAR Flow chart 19 Weight Assignment for anycast links T1-T2< S Weight Assignment for transport links Save the transport cost of the path in T1 Restore to 1 all weights and calculate the shortest path Save the transport cost of the path in T2 Choose Path 1 Choose Path 2 NO YES Exist? NO YES Route the connection and update the residual capacity on auxiliary graph Block the connection Calculate Shortest Path with these weights

Achille Pattavina 20 GEAR A simple example CO 2 Transport links weight equal to transport power Anycast links weight equal to brown processing power Homogeneous weights asseignment (brown power) for all network links

Achille Pattavina 21 GEAR Flow chart Weight assignment for anycast links Weight assignment for transport links Calculate Shortest Path with these weights NO YES Exist? Route the connection and update the residual capacity on auxiliary graph Block the connection Weight on transport links is equal to the power needed to transport the connection on the link Weight on anycast links is equal to the brown power needed to elaborate the connection in the DC With this assignment, we have homogeneous weights (brown power) on all network links

Achille Pattavina Summary  Motivations  Power consumption models  Low-carbon routing algorithms  Case study  Conclusions 22

Achille Pattavina 23 Case study  Poisson interarrival traffic  Holding time with negative exponential distribution Average duration 1 s  Each connection requires an entire 10 Gbit/s lighpath  Traffic uniformly distributed  24 nodes, links  16 wavelenghts/link  6 Data centers: 1 with Wind energy (1) 2 with Solar energy (14,15) 3 with Non-Renewable energy (5,11,17)  21 nodes, 36 links  16 wavelenghts/link  6 Data centers: 1 with Wind energy (15) 2 with Solar energy (7,20) 3 with Non-Renewable energy (1,11,13)

Achille Pattavina Case study  GEAR and SWEAR compared with two reference algorithms:  Shortest Path (SP)  Best Green Data Center (BGD): always routing towards the DC with more renewable energy 24

Achille Pattavina 25 Results Total Brown Power Reduction in total emissions vs. SP: 21% con SWEAR 24% con GEAR Reduction in total emissions vs. BGD: 25% with SWEAR 27% with GEAR Results for ItalyNet in Opaque architecture configuration

Achille Pattavina Results Other contributions 26 Increase in renewable energy consumption of 120% vs. SP Reduction in processing energy consumption vs. SP 75% with SWEAR 79% with GEAR Increase in renewable energy consumption of 10% vs. BGD Reduction in processing energy consumption vs. BGD 22% with SWEAR 35% with GEAR Increase in transport energy consumption of 28% vs. SP Reduction in transport energy consumption of 26% vs. BGD

Achille Pattavina 27 Results Total Brown Power Reduction in total emissions vs. SP: 8% con SWEAR 11% con GEAR Reduction in total emissions vs. BGD: 20% with SWEAR and GEAR Results for USA24 in Opaque architecture configuration

Achille Pattavina  Comparison with different IPoWDM configurations  Opaque configuration obtains best results  Evolution toward an «all- optic» solution fits better with our approach 28 Results Architecture comparison Switching Lv.3 Switching Lv.2 Switching Lv.1 IPbasic reduction in total emissions of 1% vs. SP IPoSDH reduction in total emissions of 2,7% and 5% vs. SP

Achille Pattavina 29 Results Blocking probability

Achille Pattavina Summary  Motivations  Power consumption models  Low-carbon routing algorithms  Case study  Conclusions 30

Achille Pattavina Conclusions and Future Works 31

Achille Pattavina 32 Thank You!!