乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T06:42:13Z","timestamp":1723531333698},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2018,4,27]],"date-time":"2018-04-27T00:00:00Z","timestamp":1524787200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2018,4,27]]},"abstract":"Network failures are frequent and disruptive, and can significantly reduce the throughput even in highly connected and regular networks such as datacenters. While many modern networks support some kind of local fast failover to quickly reroute flows encountering link failures to new paths, employing such mechanisms is known to be non-trivial, as conditional failover rules can only depend on local failure information.<\/jats:p>\n While over the last years, important insights have been gained on how to design failover schemes providing high resiliency, existing approaches have the shortcoming that the resulting failover routes may be unnecessarily long, i.e., they have a large stretch compared to the original route length. This is a serious drawback, as long routes entail higher latencies and introduce loads, which may cause the rerouted flows to interfere with existing flows and harm throughput.<\/jats:p>\n This paper presents the first deterministic local fast failover algorithms providing provable resiliency and failover route lengths, even in the presence of many concurrent failures. We present stretch-optimal failover algorithms for different network topologies, including multi-dimensional grids, hypercubes and Clos networks, as they are frequently deployed in the context of HPC clusters and datacenters. We show that the computed failover routes are optimal in the sense that no failover algorithm can provide shorter paths for a given number of link failures.<\/jats:p>","DOI":"10.1145\/3211852.3211858","type":"journal-article","created":{"date-parts":[[2018,4,30]],"date-time":"2018-04-30T11:58:18Z","timestamp":1525089498000},"page":"35-41","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Local Fast Failover Routing With Low Stretch"],"prefix":"10.1145","volume":"48","author":[{"given":"Klaus-Tycho","family":"Foerster","sequence":"first","affiliation":[{"name":"Aalborg University, Denmark"}]},{"given":"Yvonne-Anne","family":"Pignolet","sequence":"additional","affiliation":[{"name":"ABB Corporate Research, Switzerland"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"University of Vienna, Austria"}]},{"given":"Gilles","family":"Tredan","sequence":"additional","affiliation":[{"name":"CNRS-LAAS, France"}]}],"member":"320","published-online":{"date-parts":[[2018,4,27]]},"reference":[{"key":"e_1_2_1_1_2","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402967"},{"key":"e_1_2_1_2_2","volume-title":"Proc. SODA","author":"Bhalgat A.","year":"2008","unstructured":"A. Bhalgat , R. Hariharan , T. Kavitha , and D. Panigrahi . Fast edge splitting and edmonds' arborescence construction for unweighted graphs . In Proc. SODA , 2008 . A. Bhalgat, R. Hariharan, T. Kavitha, and D. Panigrahi. Fast edge splitting and edmonds' arborescence construction for unweighted graphs. In Proc. SODA, 2008."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/2620728.2620746"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03850-6_6"},{"key":"e_1_2_1_5_2","volume-title":"Exploring the limits of static failover routing (v4). arXiv:1409.0034 {cs.NI}","author":"Chiesa M.","year":"2016","unstructured":"M. Chiesa , A. Gurtov , A. Madry , S. Mitrovic , I. Nikolaevkiy , A. Panda , M. Schapira , and S. Shenker . Exploring the limits of static failover routing (v4). arXiv:1409.0034 {cs.NI} , 2016 . M. Chiesa, A. Gurtov, A. Madry, S. Mitrovic, I. Nikolaevkiy, A. Panda, M. Schapira, and S. Shenker. Exploring the limits of static failover routing (v4). arXiv:1409.0034 {cs.NI}, 2016."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2619398"},{"issue":"91","key":"e_1_2_1_7_2","first-page":"2","article-title":"Edge-disjoint branchings","volume":"9","author":"Edmonds J.","year":"1973","unstructured":"J. Edmonds . Edge-disjoint branchings . Combinatorial algorithms , 9 ( 91-96 ): 2 , 1973 . J. Edmonds. Edge-disjoint branchings. Combinatorial algorithms, 9(91-96):2, 1973.","journal-title":"Combinatorial algorithms"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1981.1094876"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018477"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592577"},{"key":"e_1_2_1_11_2","volume-title":"On representatives of subsets. Journal of the London Mathematical Society, s1-10(1):26\u201330","author":"Hall P.","year":"1935","unstructured":"P. Hall . On representatives of subsets. Journal of the London Mathematical Society, s1-10(1):26\u201330 , 1935 . P. Hall. On representatives of subsets. Journal of the London Mathematical Society, s1-10(1):26\u201330, 1935."},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539789162109"},{"key":"e_1_2_1_13_2","volume-title":"Proc. USENIX NSDI","author":"Liu V.","year":"2013","unstructured":"V. Liu , D. Halperin , A. Krishnamurthy , and T. E. Anderson . F10: A fault-tolerant engineered network . In Proc. USENIX NSDI , 2013 . V. Liu, D. Halperin, A. Krishnamurthy, and T. E. Anderson. F10: A fault-tolerant engineered network. In Proc. USENIX NSDI, 2013."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354653"},{"key":"e_1_2_1_15_2","volume-title":"Proc. DSN","author":"Pignolet Y.-A.","year":"2017","unstructured":"Y.-A. Pignolet , S. Schmid , and G. Tredan . Load-optimal local fast rerouting for dependable networks . In Proc. DSN , 2017 . Y.-A. Pignolet, S. Schmid, and G. Tredan. Load-optimal local fast rerouting for dependable networks. In Proc. DSN, 2017."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486261"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637236"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/2535771.2535774"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/2890955.2890957"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90354-5"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851218"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2004.1301021"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3211852.3211858","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T19:49:15Z","timestamp":1672516155000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3211852.3211858"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,27]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,4,27]]}},"alternative-id":["10.1145\/3211852.3211858"],"URL":"https:\/\/doi.org\/10.1145\/3211852.3211858","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2018,4,27]]},"assertion":[{"value":"2018-04-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}