A Dynamic traffic-aware energy-efficient algorithm based on sleep-scheduling for autonomous systems

Dabaghi‐Zarandi, Fahimeh; Movahedi, Zeinab

doi:10.1007/s00607-018-0589-6

Cited by 6 publications

(4 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An on‐line green algorithm based on sleep scheduling (OGAS) was proposed in Dabaghi‐Zarandi and Movahedi 21 that dynamically selects some network links and nodes to switch off/on based on network situation in order to conserve energy. The OGAS proposal developed a distributed green architecture in each network node.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A dynamic sleep‐scheduling algorithm based on vertex cover in autonomous systems

Dabaghi‐Zarandi

Movahedi

2021

Int J Communication

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

“…In order to better evaluation, we compare our algorithm with on‐line version of our previous dynamic green routing algorithms based on sleep scheduling called DOGAS that was presented in Section 2 21 . We also compare network performance measure after running our green algorithm with original topology.…”

Section: Performance Analysismentioning

confidence: 99%

A dynamic sleep‐scheduling algorithm based on vertex cover in autonomous systems

Dabaghi‐Zarandi

Movahedi

2021

Int J Communication

Self Cite

View full text Add to dashboard Cite

show abstract

“…As known network traffic load differs from time to time, resulting in peak hours in which the network is overloaded and highly congested and off-peak hours in which the network is not congested at all and have the ability to power off some network devices and links, while preserving connectivity and reliability. Therefore, the main idea here is to keep the network connectivity with no packet loss and with the least amount of energy consumption [5]- [7].…”

Section: Introductionmentioning

confidence: 99%

“…If a configuration choice is previously followed by a network congestion or disconnection at the same day of week, or the same day of month and month, or the same hour, the penalty function is updated as shown in (5). −…”

mentioning

confidence: 99%

Green distributed algorithm for energy saving in IP wired networks using sleep scheduling

Hussein

Alabbasi

Alsadeh

2021

IJECE

View full text Add to dashboard Cite

Energy saving has become a critical issue and a great challenge in the past few decades, and a great effort as well is being made to reduce consumed energy. The Internet forms a major source for energy consumption. Therefore, in this work we propose an algorithm for energy saving in distributed backbone networks, the reduced energy consumption (RedCon) algorithm. In this paper, we introduce a new version for saving energy on the Internet by switching off underutilized links and switching on idle links when the network is overloaded in a distributed manner over the network nodes based on LSA messages and without any knowledge of the traffic matrix. Our algorithm is more accurate and outperforms other algorithms with its time checks and advanced learning algorithm.

show abstract

Complex application identification and private network mining algorithm based on traffic-aware model in large-scale networks

Tian

Zhu

2019

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

A Dynamic traffic-aware energy-efficient algorithm based on sleep-scheduling for autonomous systems

Cited by 6 publications

References 34 publications

A dynamic sleep‐scheduling algorithm based on vertex cover in autonomous systems

A dynamic sleep‐scheduling algorithm based on vertex cover in autonomous systems

Green distributed algorithm for energy saving in IP wired networks using sleep scheduling

Complex application identification and private network mining algorithm based on traffic-aware model in large-scale networks

Contact Info

Product

Resources

About