{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T05:44:38Z","timestamp":1782798278074,"version":"3.54.5"},"reference-count":48,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,18]]},"DOI":"10.1109\/infocom59046.2026.11571662","type":"proceedings-article","created":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T19:38:15Z","timestamp":1782761895000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["No Traffic to Cry: Traffic-Oblivious Link Deactivation for Green Traffic Engineering"],"prefix":"10.1109","author":[{"given":"Max","family":"Ilsen","sequence":"first","affiliation":[{"name":"Osnabr&#x00FC;ck University,Institute of Computer Science,Osnabr&#x00FC;ck,Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Otten","sequence":"additional","affiliation":[{"name":"Osnabr&#x00FC;ck University,Institute of Computer Science,Osnabr&#x00FC;ck,Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nils","family":"Aschenbruck","sequence":"additional","affiliation":[{"name":"Osnabr&#x00FC;ck University,Institute of Computer Science,Osnabr&#x00FC;ck,Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Markus","family":"Chimani","sequence":"additional","affiliation":[{"name":"Osnabr&#x00FC;ck University,Institute of Computer Science,Osnabr&#x00FC;ck,Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Energy` aware management of resilient networks with shared protection","volume-title":"Proc. SustainIT","author":"Addis"},{"key":"ref2","article-title":"Approximability of robust network design: The directed case","volume-title":"Proc. STACS","volume":"219","author":"Al-Najjar"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/WoWMoM.2011.5986482"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.20"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.010"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-005-1741-7"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s13675-018-0109-7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218434"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/11496915_8"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796747"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM52122.2024.10621256"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ANTS.2014.7057272"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2009.5199404"},{"key":"ref14","first-page":"19:1","article-title":"Traffic-oblivious multi-commodity flow network design","volume-title":"Proc. ISAAC","volume":"359","author":"Chimani"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10228948"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2010.5466646"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2011.5928832"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM52122.2024.10621340"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2016.07.011"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3629165"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1023\/B:COAP.0000039487.35027.02"},{"key":"ref22","article-title":"REPETITA: Repeatable Experiments for Performance Evaluation of Traffic-Engineering Algorithms","volume-title":"CoRR","author":"Gay","year":"2017"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICT.2017.7998240"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290688"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23219-5_41"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566937"},{"key":"ref27","article-title":"IBM ILOG CPLEX Optimization Studio 20.1.0","year":"2020"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3630614.3630620"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2017.12.004"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICICT48043.2020.9112569"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806698"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.28"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2967878.2967912"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1002\/dac.3224"},{"key":"ref36","article-title":"On approximation preserving reductions: Complete problems and robust measures (revised version)","volume-title":"Department of Computer Science, University of Helsinki, Tech. Rep. C-1987-28","author":"Orponen","year":"1990"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/LCN60385.2024.10639630"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/LCN58197.2023.10223344"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3727200.3727209"},{"issue":"12","key":"ref40","first-page":"1104","article-title":"Load-dependent power-efficient passive optical network architectures","volume":"6","author":"Sankaran","year":"2014","journal-title":"JOCN"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/LCN.2017.49"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796682"},{"key":"ref43","article-title":"Management and Sustainability Report 2023"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2079296.2079314"},{"key":"ref45","volume-title":"Approximation algorithms.","author":"Vazirani","year":"2001"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155264"},{"key":"ref47","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms.","author":"Williamson","year":"2011"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2010.5762751"}],"event":{"name":"IEEE INFOCOM 2026 - IEEE Conference on Computer Communications","location":"Tokyo, Japan","start":{"date-parts":[[2026,5,18]]},"end":{"date-parts":[[2026,5,21]]}},"container-title":["IEEE INFOCOM 2026 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11571071\/11571169\/11571662.pdf?arnumber=11571662","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T05:13:16Z","timestamp":1782796396000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11571662\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/infocom59046.2026.11571662","relation":{},"subject":[],"published":{"date-parts":[[2026,5,18]]}}}