{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T17:53:36Z","timestamp":1775066016901,"version":"3.50.1"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2007,3,20]],"date-time":"2007-03-20T00:00:00Z","timestamp":1174348800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/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":[[2007,3,20]]},"abstract":"<jats:p>Dynamic load balancing is a popular recent technique that protects ISP networks from sudden congestion caused by load spikes or link failures. Dynamic load balancing protocols, however, require schemes for splitting traffic across multiple paths at a fine granularity. Current splitting schemes present a tussle between slicing granularity and packet reordering. Splitting traffic at the granularity of packets quickly and accurately assigns the desired traffic share to each path, but can reorder packets within a TCP flow, confusing TCP congestion control. Splitting traffic at the granularity of a flow avoids packet reordering but may overshoot the desired shares by up to 60% in dynamic environments, resulting in low end-to-end network goodput<\/jats:p>\n          <jats:p>Contrary to popular belief, we show that one can systematically split a single flow across multiple paths without causing packet reordering. We propose FLARE, a new traffic splitting algorithm that operates on bursts of packets, carefully chosen to avoid reordering. Using a combination of analysis and trace-driven simulations, we show that FLARE attains accuracy and responsiveness comparable to packet switching without reordering packets. FLARE is simple and can be implemented with a few KB of router state<\/jats:p>","DOI":"10.1145\/1232919.1232925","type":"journal-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T19:52:18Z","timestamp":1175802738000},"page":"51-62","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":304,"title":["Dynamic load balancing without packet reordering"],"prefix":"10.1145","volume":"37","author":[{"given":"Srikanth","family":"Kandula","sequence":"first","affiliation":[{"name":"MIT"}]},{"given":"Dina","family":"Katabi","sequence":"additional","affiliation":[{"name":"MIT"}]},{"given":"Shantanu","family":"Sinha","sequence":"additional","affiliation":[{"name":"Microsoft"}]},{"given":"Arthur","family":"Berger","sequence":"additional","affiliation":[{"name":"MIT\/Akama"}]}],"member":"320","published-online":{"date-parts":[[2007,3,20]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832483"},{"key":"e_1_2_1_2_1","volume-title":"Multihoming Performance Benefits: An Experimental Evaluation of Practical Enterprise Strategies. In USENIX Tech. Conf.","author":"Akella A.","year":"2004"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/974036.974038"},{"key":"e_1_2_1_4_1","author":"Amstutz S.","year":"1986","journal-title":"Commun. Mag."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948218"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.811445"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/510726.510728"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(02)00177-3"},{"key":"e_1_2_1_9_1","volume-title":"IEEE INFOCOM","author":"Cao Z.","year":"2000"},{"key":"e_1_2_1_10_1","volume-title":"PAM","author":"Chuah C. N.","year":"2002"},{"key":"e_1_2_1_11_1","volume-title":"Cisco Systems.","year":"2002"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916625"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.1003042"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2329-1"},{"key":"e_1_2_1_16_1","volume-title":"Georgia Tech.","author":"Jiang H.","year":"2004"},{"key":"e_1_2_1_17_1","unstructured":"Junos 6.3 internet software routing protocols configuration guide. www.juniper.net\/techpubs\/software\/junos\/junos63\/swconfig63-routing\/html\/.  Junos 6.3 internet software routing protocols configuration guide. www.juniper.net\/techpubs\/software\/junos\/junos63\/swconfig63-routing\/html\/."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080122"},{"key":"e_1_2_1_19_1","volume-title":"ACM IMC","author":"Katti S.","year":"2004"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2002.1035115"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/505688.505692"},{"key":"e_1_2_1_22_1","volume-title":"INFOCOM","author":"Papagiannaki K.","year":"2004"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.779192"},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","unstructured":"V. Paxson and M. Allman. Computing tcp's retransmission timer 2000. IETF RFC 2988.   V. Paxson and M. Allman. Computing tcp's retransmission timer 2000. IETF RFC 2988.","DOI":"10.17487\/rfc2988"},{"key":"e_1_2_1_25_1","volume-title":"MIT","author":"Rost S.","year":"2003"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637213"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/217382.217453"},{"key":"e_1_2_1_28_1","unstructured":"C. Villamizar. MPLS Optimized Multipath (MPLS-OMP) 1999. Internet Draft.  C. Villamizar. MPLS Optimized Multipath (MPLS-OMP) 1999. Internet Draft."},{"key":"e_1_2_1_29_1","unstructured":"C. Villamizar. Ospf Optimized Multipath (OSPF-OMP) 1999. Internet Draft.  C. Villamizar. Ospf Optimized Multipath (OSPF-OMP) 1999. Internet Draft."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159926"},{"key":"e_1_2_1_31_1","volume-title":"IEEE ICCCN","author":"Wang Y.","year":"1999"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/115992.116006"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/951950.952207"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633055"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1209205"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1232919.1232925","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1232919.1232925","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:51Z","timestamp":1750258311000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1232919.1232925"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,20]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,3,20]]}},"alternative-id":["10.1145\/1232919.1232925"],"URL":"https:\/\/doi.org\/10.1145\/1232919.1232925","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2007,3,20]]},"assertion":[{"value":"2007-03-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}