{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T18:39:10Z","timestamp":1740163150857,"version":"3.37.3"},"reference-count":16,"publisher":"Wiley","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"name":"Italian Ministry of Instruction, University and Research"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer Networks and Communications"],"published-print":{"date-parts":[[2013]]},"abstract":"<jats:p>The paper deeply analyzes a novel network-wide power management problem, called Power-Aware Routing and Network Design with Bundled Links (PARND-BL), which is able to take into account both the relationship between the power consumption and the traffic throughput of the nodes and to power off both the chassis and even the single Physical Interface Card (PIC) composing each link. The solutions of the PARND-BL model have been analyzed by taking into account different aspects associated with the actual applicability in real network scenarios: (i) the time for obtaining the solution, (ii) the deployed network topology and the resulting topology provided by the solution, (iii) the power behavior of the network elements, (iv) the traffic load, (v) the QoS requirement, and (vi) the number of paths to route each traffic demand. Among the most interesting and novel results, our analysis shows that the strategy of minimizing the number of powered-on network elements through the traffic consolidation does not always produce power savings, and the solution of this kind of problems, in some cases, can lead to spliting a single traffic demand into a high number of paths.<\/jats:p>","DOI":"10.1155\/2013\/154953","type":"journal-article","created":{"date-parts":[[2013,11,10]],"date-time":"2013-11-10T11:55:45Z","timestamp":1384084545000},"page":"1-16","source":"Crossref","is-referenced-by-count":4,"title":["Power-Aware Routing and Network Design with Bundled Links: Solutions and Analysis"],"prefix":"10.1155","volume":"2013","author":[{"given":"Rosario G.","family":"Garroppo","sequence":"first","affiliation":[{"name":"Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Pisa, Via Caruso 16, 56122 Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Giordano","sequence":"additional","affiliation":[{"name":"Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Pisa, Via Caruso 16, 56122 Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9684-0375","authenticated-orcid":true,"given":"Gianfranco","family":"Nencioni","sequence":"additional","affiliation":[{"name":"Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Pisa, Via Caruso 16, 56122 Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Grazia","family":"Scutell\u00e0","sequence":"additional","affiliation":[{"name":"Dipartimento di Informatica, Universit\u00e0 di Pisa, Largo Pontecorvo 3, 56127 Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"doi-asserted-by":"publisher","key":"2","DOI":"10.1109\/SURV.2011.071410.00073"},{"doi-asserted-by":"publisher","key":"3","DOI":"10.1007\/s11227-011-0632-2"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1109\/TC.2007.70836"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1016\/j.osn.2011.03.007"},{"issue":"1","key":"14","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.cor.2012.06.014","volume":"40","year":"2013","journal-title":"Computersand Operations Research"},{"doi-asserted-by":"publisher","key":"17","DOI":"10.1109\/65.642356"},{"year":"2010","key":"19"},{"year":"2001","key":"22"},{"year":"2001","key":"23"},{"doi-asserted-by":"publisher","key":"25","DOI":"10.1287\/opre.51.4.655.16098"},{"doi-asserted-by":"publisher","key":"26","DOI":"10.1109\/TNET.2011.2161487"},{"issue":"8","key":"16","doi-asserted-by":"crossref","first-page":"1774","DOI":"10.1016\/j.comnet.2013.03.006","volume":"57","year":"2013","journal-title":"Computer Networks"},{"issue":"12","key":"31","doi-asserted-by":"crossref","first-page":"1738","DOI":"10.1002\/cpe.2964","volume":"25","year":"2013","journal-title":"Concurrency and Computation: Practice and Experience"},{"year":"1993","key":"34"},{"doi-asserted-by":"publisher","key":"35","DOI":"10.1016\/j.ejor.2006.05.043"},{"doi-asserted-by":"publisher","key":"36","DOI":"10.1002\/net.20311"}],"container-title":["Journal of Computer Networks and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2013\/154953.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2013\/154953.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2013\/154953.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T21:42:40Z","timestamp":1498081360000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/jcnc\/2013\/154953\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"references-count":16,"alternative-id":["154953","154953"],"URL":"https:\/\/doi.org\/10.1155\/2013\/154953","relation":{},"ISSN":["2090-7141","2090-715X"],"issn-type":[{"type":"print","value":"2090-7141"},{"type":"electronic","value":"2090-715X"}],"subject":[],"published":{"date-parts":[[2013]]}}}