Joint overlay routing and relay assignment for green networks

dc.contributor.authorEkici, Fatma
dc.contributor.authorGözüpek, Didem
dc.date.accessioned2025-10-29T11:29:39Z
dc.date.issued2015
dc.departmentFakülteler, Mühendislik Fakültesi, Bilgisayar Mühendisliği Bölümü
dc.description.abstractPower consumption of information and communication technologies (ICT) has increasingly become an important issue in the last years. Both energy costs and environmental concerns call for energy aware green networking solutions in wired networks. Overlay routing is an attractive method to enhance the performance and reliability of routing mechanisms without the need to change the standards of the current underlying routing. In this work, we focus on overlay routing in wired networks from an energy efficiency perspective. We formulate an optimization problem called JORRA (Joint Overlay Routing and Relay Assignment), which jointly determines the overlay routing paths and relay nodes. We consider issues such as the relay costs, whether the network elements can be put into sleep mode or not as well as the energy efficiency and reliability tradeoff for source and destination pairs in the network. We formulate JORRA as an integer linear program and prove that it is APX-Hard in addition to being NP-Hard even in its special cases. We then show that another special case of JORRA admits a 2-approximation algorithm. Moreover, we propose two polynomial time heuristic algorithms and demonstrate through performance evaluation that our heuristics are suitable for practical implementation. (C) 2015 Elsevier B.V. All rights reserved.
dc.description.sponsorshipScientific and Technological Research Council of Turkey (TUBITAK) [113E567]
dc.description.sponsorshipThis work is supported by the Scientific and Technological Research Council of Turkey (TUBITAK) under Grant No. 113E567.
dc.identifier.doi10.1016/j.comnet.2015.01.005
dc.identifier.endpage344
dc.identifier.issn1389-1286
dc.identifier.issn1872-7069
dc.identifier.scopus2-s2.0-84923092386
dc.identifier.scopusqualityQ1
dc.identifier.startpage323
dc.identifier.urihttps://doi.org/10.1016/j.comnet.2015.01.005
dc.identifier.urihttps://hdl.handle.net/20.500.14854/11208
dc.identifier.volume79
dc.identifier.wosWOS:000353070900022
dc.identifier.wosqualityQ2
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherElsevier
dc.relation.ispartofComputer Networks
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WOS_20251020
dc.subjectGreen networks
dc.subjectRouting
dc.subjectOptimization
dc.subjectInteger programming
dc.subjectApproximation algorithms
dc.subjectHeuristic algorithms
dc.titleJoint overlay routing and relay assignment for green networks
dc.typeArticle

Dosyalar