Premium
A dynamic sleep‐scheduling algorithm based on vertex cover in autonomous systems
Author(s) -
DabaghiZarandi Fahimeh,
Movahedi Zeinab
Publication year - 2021
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.4790
Subject(s) - computer science , vertex cover , network packet , computer network , the internet , scheduling (production processes) , network delay , algorithm , distributed computing , time complexity , mathematical optimization , mathematics , world wide web
Summary Over recent years, energy conservation in Internet backbone networks has been proposed to reduce economic cost and environmental pollution produced by networking sectors. In this regard, we propose a new dynamic vertex cover‐based green algorithm (DVCGA) in order to conserve energy. Our solution considers online local/global traffic knowledge to switch off some underutilized network devices during nonpeak periods and reswitch on some sleep devices in congestion situation. In addition, DVCGA does not require any centralized controller and uses only information provided by a link‐state protocol. Results, obtained by real network scenario, show that up to 28% of network nodes and up to 82% of the maximum number of switchable links are switched off after DVCGA running. In addition, network performance metrics such as delay and packet delivery ratio during DVCGA running are close to original network and better than similar works. Moreover, the number of device state changes in the effect of DVCGA execution during network running is lower than similar proposals resulting in low network overhead.