Energy-fair routing in multi-domain green networks

Providing energy-fairness in multi-domain green networks is a vital but hitherto unexplored issue. In this paper, we address energy-fair routing in multi-domain green networks by formulating an optimization problem as an integer linear program. Our problem maximizes the energy saving of the domain with minimum energy saving while ensuring that the energy consumption of each domain is below a given threshold. We design an efficient heuristic algorithm called Balanced Multi-Domain Green Routing (BMDGR) for this problem. We evaluate the performance of BMDGR by comparison to the results obtained from our integer linear program using optimization software CPLEX. The simulation results show that BMDGR yields close results to the values obtained from CPLEX in terms of energy efficiency while having low computational complexity.