Abstract
The routing protocols play a vital role in saving energy, especially by minimizing the time a packet takes to travel from source to destination. The aim of energy-aware routing protocols is to select a route that engages routers in such a way that the overall energy consumption is minimized. In this paper, a relationship between resource utilization and energy consumption is stated, further, a resource-aware dynamic routing algorithm for SDN is proposed. The contribution of this paper is a queuing theory-based approach that measures the average waiting time of nodes and links based on their utilization and finds a path that costs the least time. The paper also proposes a framework for implementing routing algorithm over an SDN. Performance of the algorithm is verified using a GNS3 based implementation with an Opendaylight controller.
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Original language | English |
---|---|
DOIs | |
Publication status | Published - 21 Feb 2019 |
Event | IEEE Global Communications Conference (GLOBECOM) - Duration: 12 Apr 2022 → … |
Conference
Conference | IEEE Global Communications Conference (GLOBECOM) |
---|---|
Period | 12/04/22 → … |