{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T10:00:29Z","timestamp":1770890429087,"version":"3.50.1"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T00:00:00Z","timestamp":1733356800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nd\/4.0\/"}],"funder":[{"name":"DFF project QASNET and by the S4OS Villum Investigator","award":["37819"],"award-info":[{"award-number":["37819"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2024,12,31]]},"abstract":"<jats:p>Network telemetry and analytics is essential for providing highly dependable services in modern computer networks. In particular, network flow analytics for internet service provider (ISP) networks allows operators to inspect and reason about traffic patterns in their networks in order to react to anomalies. High performance network analytics systems are designed with scalability in mind and can consequently only observe partial information about the network traffic. Still, they need to provide a holistic view of the traffic, including the distribution of different traffic flows on each link. It is impractical to monitor such fine-grained telemetry, and in large, heterogeneous networks, it is often too complex and error prone, if not impossible, to access and maintain all technical specifications and router-specific configurations needed to determine, for example, the load balancing weights used when traffic is split onto multiple paths. The ratios by which flows are split on the possible paths must be derived indirectly from the measured flow demands and link utilizations. Motivated by a case study provided by a major European ISP, we suggest an efficient method to estimate the flow splitting ratios. Our approach, based on quadratic linear programming, is scalable and achieves robustness to the measurement noise found in a typical network analytics deployment by filtering out certain constraints in the linear program. Finally, we implement an automated tool for estimating the flow splitting ratios and document its applicability on real data from the ISP.<\/jats:p>","DOI":"10.1145\/3700602","type":"journal-article","created":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T11:12:34Z","timestamp":1728990754000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Measurement-Noise Filtering for Automatic Discovery of Flow Splitting Ratios in ISP Networks"],"prefix":"10.1145","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5970-4294","authenticated-orcid":false,"given":"Morten Konggaard","family":"Schou","sequence":"first","affiliation":[{"name":"Computer Science, Aalborg University, Aalborg, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6326-9854","authenticated-orcid":false,"given":"Ingmar","family":"Poese","sequence":"additional","affiliation":[{"name":"BENOCS GmbH, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5551-6547","authenticated-orcid":false,"given":"Jiri","family":"Srba","sequence":"additional","affiliation":[{"name":"Computer Science, Aalborg Universitet, Aalborg, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,12,5]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.17487\/RFC7011"},{"key":"e_1_3_1_3_2","unstructured":"BENOCS. n.d. BENOCS Home Page. Retrieved October 15 2024 from https:\/\/www.benocs.com\/"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342069"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.17487\/RFC1195"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.17487\/RFC1157"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3366697"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.17487\/RFC3954"},{"key":"e_1_3_1_9_2","volume-title":"Introduction to Algorithms (4th ed.)","author":"Cormen Thomas H.","year":"2022","unstructured":"Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2022. Introduction to Algorithms (4th ed.). MIT Press."},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195833"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3419394.3423658"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1039866"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2012.022412.110184"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/CATCH.2009.47"},{"key":"e_1_3_1_15_2","volume-title":"Gurobi Optimizer Reference Manual\u2014Version 10.0","author":"Optimization Gurobi","year":"2023","unstructured":"Gurobi Optimization. 2023. Gurobi Optimizer Reference Manual\u2014Version 10.0. Gurobi Optimization. https:\/\/www.gurobi.com\/wp-content\/plugins\/hd_documentations\/documentation\/10.0\/refman.pdf"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.17487\/RFC3411"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195830"},{"key":"e_1_3_1_18_2","volume-title":"RapidMiner: Data Mining Use Cases and Business Analytics Applications","author":"Hofmann Markus","year":"2013","unstructured":"Markus Hofmann and Ralf Klinkenberg (Eds.). 2013. RapidMiner: Data Mining Use Cases and Business Analytics Applications. CRC Press."},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2014.2321898"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486012"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.17487\/RFC2992"},{"key":"e_1_3_1_22_2","unstructured":"IBM. n.d. IBM ILOG CPLEX Optimization Studio 22.1.0. Retrieved October 15 2024 from https:\/\/www.ibm.com\/docs\/en\/icos\/22.1.0"},{"key":"e_1_3_1_23_2","article-title":"Intermediate System to Intermediate System Intra-Domain\n                  Routeing Exchange Protocol for Use in Conjunction\n                  with the Protocol for Providing the Connectionless-Mode Network Service (ISO 8473)","year":"2002","unstructured":"ISO. 2002. Intermediate System to Intermediate System Intra-DomainRouteing Exchange Protocol for Use in Conjunctionwith the Protocol for Providing the Connectionless-Mode Network Service (ISO 8473). ISO\/IEC 10589:2002. ISO. https:\/\/www.iso.org\/standard\/30932.html","journal-title":"ISO\/IEC 10589:2002"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3555050.3569119"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3387514.3405858"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/1029208.1029219"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2012.12.020"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626314"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.17487\/RFC2328"},{"key":"e_1_3_1_31_2","unstructured":"Juniper Networks. 2021. IS-IS User Guide: Understanding Weighted ECMP Traffic Distribution on One-Hop IS-IS Neighbors. Juniper Networks. https:\/\/www.juniper.net\/documentation\/us\/en\/software\/junos\/is-is\/topics\/concept\/wecmp-for-one-hop-isis-neighbors-overview.html"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78243-8_6"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.17487\/RFC4271"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/1096536.1096551"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2020.3034278"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/PRDC59308.2023.00017"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.13326011"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/2007116.2007128"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/NOMS54207.2022.9789776"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3281411.3281433"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39415-8"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851218"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3700602","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3700602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:28Z","timestamp":1750295848000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3700602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,5]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12,31]]}},"alternative-id":["10.1145\/3700602"],"URL":"https:\/\/doi.org\/10.1145\/3700602","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,5]]},"assertion":[{"value":"2024-05-03","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-09-24","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-12-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}