{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:40:29Z","timestamp":1770284429319,"version":"3.49.0"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Green Commun. Netw."],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1109\/tgcn.2018.2832658","type":"journal-article","created":{"date-parts":[[2018,5,3]],"date-time":"2018-05-03T18:43:54Z","timestamp":1525373034000},"page":"844-858","source":"Crossref","is-referenced-by-count":45,"title":["Energy-Aware Routing in Carrier-Grade Ethernet Using SDN Approach"],"prefix":"10.1109","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4500-1010","authenticated-orcid":false,"given":"Rihab","family":"Maaloul","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raouia","family":"Taktak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lamia","family":"Chaari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7287-874X","authenticated-orcid":false,"given":"Bernard","family":"Cousin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80026-7"},{"key":"ref38","volume":"70","author":"garey","year":"1979","journal-title":"A Guide to the Theory of NP-Completeness"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566832"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535373"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2016.12.012"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2014.7037187"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2016.05.009"},{"key":"ref36","author":"ahuja","year":"1993","journal-title":"Network Flows Theory Algorithms and Applications"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35668-1_32"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2015.7417661"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2015.2431074"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2013.39"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/WoWMoM.2014.6918982"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSTQE.2010.2053522"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2011.5730522"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/GreenCom-CPSCom.2010.147"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2013.02.006"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2161487"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2012.08.002"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2015.01.004"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ITC.2014.6932957"},{"key":"ref25","first-page":"249","article-title":"ElasticTree: Saving energy in data center networks","author":"heller","year":"2010","journal-title":"Proc NSDI"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567024"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2371999"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"1668","DOI":"10.1016\/j.dam.2010.05.026","article-title":"Tighter bounds of the first fit algorithm for the bin-packing problem","volume":"158","author":"binzhou","year":"2010","journal-title":"Discrete Appl Math"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/LANMAN.2011.6076935"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2016.10.005"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2010.5466646"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2011.5928832"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/WoWMoM.2011.5986481"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2012.03.009"},{"key":"ref18","first-page":"378","article-title":"Energy-saving routing algorithm using Steiner tree","author":"matsuura","year":"2013","journal-title":"Proc IFIP\/IEEE Int Symp Integr Netw Manage"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/AICCSA.2015.7507246"},{"key":"ref4","first-page":"1","article-title":"Energy profile aware routing","author":"restrepo","year":"2009","journal-title":"Proc Int Conf Commun (ICC) Workshops"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.csi.2017.04.001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/DSN-W.2016.29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2014.012214.00180"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/NOC.2012.6249914"},{"key":"ref7","year":"2012","journal-title":"Software-Defined Networking The New Norm for Networks (white paper)"},{"key":"ref49","author":"telkamp","year":"2005","journal-title":"Best Practices for Determining the Traffic Matrix in IP Networks V 2 0 NANOG"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2014.7037129"},{"key":"ref46","year":"2018","journal-title":"CPLEX Optimizers"},{"key":"ref45","year":"2012","journal-title":"IBM ILOG Cplex 12 4 User Manual"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1002\/net.20371","article-title":"SNDlib 1.0–Survivable network design library","volume":"55","author":"orlowski","year":"2010","journal-title":"Networks"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s101070050077","article-title":"A branch-and-cut algorithm for capacitated network design problems","volume":"86","author":"g\u00fcnl\u00fck","year":"1999","journal-title":"Math Program"},{"key":"ref42","first-page":"871","article-title":"The Laplacian spectrum of graphs","volume":"2","author":"bojan","year":"1991","journal-title":"Graph Theory Combinatorics Appl"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref44","author":"jain","year":"1990","journal-title":"The Art of Computer Systems Performance Analysis Techniques for Experimental Design Measurement Simulation and Modeling"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","article-title":"Algebraic connectivity of graphs","volume":"23","author":"fiedler","year":"1973","journal-title":"Czechoslovak Math J"}],"container-title":["IEEE Transactions on Green Communications and Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7511293\/8439027\/08353829.pdf?arnumber=8353829","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T13:39:06Z","timestamp":1720273146000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8353829\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":49,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tgcn.2018.2832658","relation":{},"ISSN":["2473-2400"],"issn-type":[{"value":"2473-2400","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9]]}}}