{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:09Z","timestamp":1759638849472,"version":"3.28.0"},"reference-count":34,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1109\/hpsr.2015.7483079","type":"proceedings-article","created":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T13:06:59Z","timestamp":1464872819000},"page":"1-8","source":"Crossref","is-referenced-by-count":2,"title":["Robust network flow against attackers with knowledge of routing method"],"prefix":"10.1109","author":[{"given":"Vorapong","family":"Suppakitpaisarn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenkai","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Francois","family":"Baffier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704446232"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/LCN.2014.6925759"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-013-9454-3"},{"key":"ref10","first-page":"776","article-title":"A method for obtaining the maximum 6-reliable flow in a network","volume":"81","author":"kishimoto","year":"1998","journal-title":"IEICE Trans on Fundamentals"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199607)27:4<279::AID-NET3>3.0.CO;2-D"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/net.10008"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30176-9_40"},{"journal-title":"CDP attacks Cisco Discovery Protocol Attack","year":"2011","author":"popeskic","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2500468.2500473"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/946493"},{"key":"ref17","first-page":"26","article-title":"Parametric multiroute flow and its application to robust network with k edge failures","author":"baffier","year":"2014","journal-title":"Proceedings of ISCA&#x2019;"},{"key":"ref18","first-page":"1185","article-title":"On m-route flows in a network","volume":"j 76 a","author":"kishimoto","year":"1993","journal-title":"IEICE Trans"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"ref28","article-title":"An approximation algorithm for multiroute flow decomposition","author":"suppakitpaisarn","year":"2015","journal-title":"Proc INOC&#x2019;15"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2413176.2413189"},{"key":"ref27","first-page":"180","article-title":"Speeding up algorithm for maximizing barrier coverage using parametric multiroute flow","author":"suppakitpaisarn","year":"2014","journal-title":"Proc T JIA&#x2019;14"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848098"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04657-0_9"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.05.001"},{"key":"ref5","first-page":"142","article-title":"IP fast rerouting for single-link\/node failure recovery","author":"xi","year":"2007","journal-title":"Proc BROADNETS"},{"article-title":"Reducing the maximum flow","year":"2012","author":"gonshorovitz","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-009-0116-y"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848100"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.897956"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-005-3513-x"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/65.826370"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.05.043"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195830"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.804825"},{"journal-title":"Decomposition of Flow into Paths to Minimize Their Length","year":"0","author":"hendel","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2014.6883314"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2010.78"}],"event":{"name":"2015 IEEE 16th International Conference on High-Performance Switching and Routing (HPSR)","start":{"date-parts":[[2015,7,1]]},"location":"Budapest","end":{"date-parts":[[2015,7,4]]}},"container-title":["2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7477974\/7483067\/07483079.pdf?arnumber=7483079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T17:12:11Z","timestamp":1489770731000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7483079\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/hpsr.2015.7483079","relation":{},"subject":[],"published":{"date-parts":[[2015,7]]}}}