{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:47:16Z","timestamp":1767707236481,"version":"build-2065373602"},"reference-count":50,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T00:00:00Z","timestamp":1710201600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Key Research and Development Program of Hunan Province of China","doi-asserted-by":"publisher","award":["2023GK2001"],"award-info":[{"award-number":["2023GK2001"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014219","name":"National Science Foundation for Distinguished Young Scholars","doi-asserted-by":"crossref","award":["62025201"],"award-info":[{"award-number":["62025201"]}],"id":[{"id":"10.13039\/501100014219","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Natural Science Foundation of China-Research Grants Council (RGC) Joint Research Scheme","award":["62321166652"],"award-info":[{"award-number":["62321166652"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2024,3,12]]},"abstract":"<jats:p>Network telemetry, characterized by its efficient push model and high-performance communication protocol (gRPC), offers a new avenue for collecting fine-grained real-time data. Despite its advantages, existing network telemetry systems lack a theoretical basis for setting measurement frequency, struggle to capture informative samples, and face challenges in setting a uniform frequency for multi-metric monitoring. We introduce FineMon, an innovative adaptive network telemetry scheme for precise, fine-grained, multi-metric data monitoring. FineMon leverages a novel Two-sided Frequency Adjustment (TFA) to dynamically adjust the measurement frequency on the Network Management System (NMS) and infrastructure sides. On the NMS side, we provide a theoretical basis for frequency determination, drawing on changes in the rank of multi-metric data to minimize monitoring overhead. On the infrastructure side, we adjust the frequency in real-time to capture significant data fluctuations. We propose a robust Enhanced-Subspace-based Tensor Completion (ESTC) to ensure accurate recovery of fine-grained data, even with noise or outliers. Through extensive experimentation with three real datasets, we demonstrate FineMon's superiority over existing schemes in reduced measurement overhead, enhanced accuracy, and effective capture of intricate temporal features.<\/jats:p>","DOI":"10.1145\/3639267","type":"journal-article","created":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T18:51:32Z","timestamp":1711479092000},"page":"1-26","source":"Crossref","is-referenced-by-count":5,"title":["FineMon: An Innovative Adaptive Network Telemetry Scheme for Fine-Grained, Multi-Metric Data Monitoring with Dynamic Frequency Adjustment and Enhanced Data Recovery"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-6075-5075","authenticated-orcid":false,"given":"Haojie","family":"Ji","sequence":"first","affiliation":[{"name":"Hunan University, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2163-2723","authenticated-orcid":false,"given":"Kun","family":"Xie","sequence":"additional","affiliation":[{"name":"Hunan University, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7363-881X","authenticated-orcid":false,"given":"Jigang","family":"Wen","sequence":"additional","affiliation":[{"name":"Hunan University of Science and Technology, Xiangtan, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-1033-6340","authenticated-orcid":false,"given":"Qingyi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Huawei Technologies, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4964-1135","authenticated-orcid":false,"given":"Gaogang","family":"Xie","sequence":"additional","affiliation":[{"name":"Computer Network Information Center, Chinese Academy of Sciences &amp; School Computer Science and Technology, University of Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5074-1363","authenticated-orcid":false,"given":"Wei","family":"Liang","sequence":"additional","affiliation":[{"name":"Hunan University of Science and Technology, Xiangtan, China"}]}],"member":"320","published-online":{"date-parts":[[2024,3,26]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/321607.321609"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/360767.360779"},{"key":"e_1_2_2_3_1","volume-title":"Noise-tolerant life-long matrix completion via adaptive sampling. Advances in Neural Information Processing Systems 29","author":"Balcan Maria-Florina F","year":"2016","unstructured":"Maria-Florina F Balcan and Hongyang Zhang. 2016. Noise-tolerant life-long matrix completion via adaptive sampling. Advances in Neural Information Processing Systems 29 (2016)."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2004.826093"},{"key":"e_1_2_2_5_1","unstructured":"CAIDA. 2018. The CAIDA UCSD Anonymized Internet Traces. [Online]. Available: https:\/\/www.caida.org\/catalog\/datasets\/passive_dataset."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3386136"},{"key":"e_1_2_2_10_1","unstructured":"Jeffrey D Case Mark Fedor Martin L Schoffstall and James Davin. 1989. Simple network management protocol (SNMP). Technical Report."},{"key":"e_1_2_2_11_1","volume-title":"2000 USENIX Annual Technical Conference (USENIX ATC 00)","author":"Cho Kenjiro","year":"2000","unstructured":"Kenjiro Cho, Koushirou Mitsuya, and Akira Kato. 2000. Traffic data repository at the {WIDE} project. In 2000 USENIX Annual Technical Conference (USENIX ATC 00)."},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2021.3098637"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3022757"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0717021"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00022"},{"key":"e_1_2_2_16_1","unstructured":"Google. 2015. gRPC. https:\/\/grpc.io\/."},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230555"},{"key":"e_1_2_2_18_1","unstructured":"Richard A Harshman et al. 1970. Foundations of the PARAFAC procedure: Models and conditions for an\" explanatory\" multimodal factor analysis. (1970)."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2005.11.009"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3027736"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2014.2321898"},{"key":"e_1_2_2_22_1","first-page":"455","article-title":"Provable low-rank tensor recovery","volume":"4252","author":"Huang Bo","year":"2014","unstructured":"Bo Huang, Cun Mu, Donald Goldfarb, and John Wright. 2014. Provable low-rank tensor recovery. Optimization-Online 4252, 2 (2014), 455--500.","journal-title":"Optimization-Online"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00020"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32216-8_11"},{"key":"e_1_2_2_25_1","unstructured":"Zoom Video Communications Inc. 2020. Zoom Client Connection Process Whitepaper. https:\/\/explore.zoom.us\/docs\/doc\/Zoom_Client_Connection%20Process_Whitepaper.pdf."},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3544497.3544501"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/110837711"},{"key":"e_1_2_2_28_1","volume-title":"Low-rank matrix and tensor completion via adaptive sampling. Advances in neural information processing systems 26","author":"Krishnamurthy Akshay","year":"2013","unstructured":"Akshay Krishnamurthy and Aarti Singh. 2013. Low-rank matrix and tensor completion via adaptive sampling. Advances in neural information processing systems 26 (2013)."},{"key":"e_1_2_2_29_1","volume-title":"On the power of adaptivity in matrix completion and approximation. arXiv preprint arXiv:1407.3619","author":"Krishnamurthy Akshay","year":"2014","unstructured":"Akshay Krishnamurthy and Aarti Singh. 2014. On the power of adaptivity in matrix completion and approximation. arXiv preprint arXiv:1407.3619 (2014)."},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/0614071"},{"key":"e_1_2_2_31_1","volume-title":"Yan Zhuang, Fei Feng, Lingbo Tang, Zheng Cao, Ming Zhang, Frank Kelly, Mohammad Alizadeh, et al.","author":"Li Yuliang","year":"2019","unstructured":"Yuliang Li, Rui Miao, Hongqiang Harry Liu, Yan Zhuang, Fei Feng, Lingbo Tang, Zheng Cao, Ming Zhang, Frank Kelly, Mohammad Alizadeh, et al. 2019. HPCC: High precision congestion control. In Proceedings of the ACM Special Interest Group on Data Communication. 44--58."},{"key":"e_1_2_2_32_1","volume-title":"Tensor completion for estimating missing values in visual data","author":"Liu Ji","year":"2012","unstructured":"Ji Liu, Przemyslaw Musialski, Peter Wonka, and Jieping Ye. 2012. Tensor completion for estimating missing values in visual data. IEEE transactions on pattern analysis and machine intelligence 35, 1 (2012), 208--220."},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2015.2505729"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2019.2901311"},{"key":"e_1_2_2_35_1","volume-title":"Generalized higher order orthogonal iteration for tensor learning and decomposition","author":"Liu Yuanyuan","year":"2015","unstructured":"Yuanyuan Liu, Fanhua Shang, Wei Fan, James Cheng, and Hong Cheng. 2015. Generalized higher order orthogonal iteration for tensor learning and decomposition. IEEE transactions on neural networks and learning systems 27, 12 (2015), 2551--2563."},{"key":"e_1_2_2_36_1","volume-title":"Trace norm regularized CANDE-COMP\/PARAFAC decomposition with missing data","author":"Liu Yuanyuan","year":"2014","unstructured":"Yuanyuan Liu, Fanhua Shang, Licheng Jiao, James Cheng, and Hong Cheng. 2014. Trace norm regularized CANDE-COMP\/PARAFAC decomposition with missing data. IEEE transactions on cybernetics 45, 11 (2014), 2437--2448."},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"e_1_2_2_38_1","first-page":"1049","article-title":"Cubic spline interpolation","volume":"45","author":"McKinley Sky","year":"1998","unstructured":"Sky McKinley and Megan Levine. 1998. Cubic spline interpolation. College of the Redwoods 45, 1 (1998), 1049--1060.","journal-title":"College of the Redwoods"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00241"},{"key":"e_1_2_2_40_1","volume-title":"A new convex relaxation for tensor completion. Advances in neural information processing systems 26","author":"Romera-Paredes Bernardino","year":"2013","unstructured":"Bernardino Romera-Paredes and Massimiliano Pontil. 2013. A new convex relaxation for tensor completion. Advances in neural information processing systems 26 (2013)."},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195693"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637226"},{"key":"e_1_2_2_43_1","volume-title":"Estimation of low-rank tensors via convex optimization. arXiv preprint arXiv:1010.0789","author":"Tomioka Ryota","year":"2010","unstructured":"Ryota Tomioka, Kohei Hayashi, and Hisashi Kashima. 2010. Estimation of low-rank tensors via convex optimization. arXiv preprint arXiv:1010.0789 (2010)."},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2004.1281630"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISSRE52982.2021.00022"},{"key":"e_1_2_2_47_1","unstructured":"Qin Wu John Strassner Adrian Farrel and Liang Zhang. 2016. Network Telemetry and Big Data Analysis. Internet-Draft draft-wu-t2trg-network-telemetry-00. Internet Engineering Task Force. https:\/\/datatracker.ietf.org\/doc\/draft-wu-t2trg-network-telemetry\/00\/ Work in Progress."},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2987845"},{"key":"e_1_2_2_49_1","series-title":"SIAM Journal on imaging sciences 6, 3","volume-title":"A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion","author":"Xu Yangyang","year":"2013","unstructured":"Yangyang Xu and Wotao Yin. 2013. A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM Journal on imaging sciences 6, 3 (2013), 1758--1789."},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2639466"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639267","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3639267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T15:12:18Z","timestamp":1755789138000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,12]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3,12]]}},"alternative-id":["10.1145\/3639267"],"URL":"https:\/\/doi.org\/10.1145\/3639267","relation":{},"ISSN":["2836-6573"],"issn-type":[{"type":"electronic","value":"2836-6573"}],"subject":[],"published":{"date-parts":[[2024,3,12]]}}}