Skip to main content
SpringerLink
Log in

A Barzilai–Borwein Gradient Algorithm for Spatio-Temporal Internet Traffic Data Completion via Tensor Triple Decomposition

  • Published:
Journal of Scientific Computing Aims and scope Submit manuscript

Abstract

With the coming of high-speed network and 5G era, internet traffic data is crucial for various network tasks such as traffic engineering, capacity planning and anomaly detection. To explore the natural spatio-temporal structure of network flow, we use the novel triple decomposition of tensors to establish an optimization model with the spatio-temporal regularization for completing the internet traffic data. A Barzilai–Borwein gradient algorithm is designed for solving the spatio-temporal internet traffic tensor completion problem. We prove the convergence of this algorithm and analyze its convergence rate with the tool of the Kurdyka-Łojasiewicz property. Numerical experiments on Abilene and GÉANT datasets report that the proposed tensor completion method is effective.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Data availability

The datasets generated during and/or analysed during the current study are available from the corresponding author on reasonable request.

Notes

  1. The Abilene Observatory Data Collections. “http://abilene.internet2.edu/observatory/datacollections.html”.

  2. “https://www.mathworks.com/matlabcentral/fileexchange/26395-matrix-completion-via-thresholding”.

  3. “https://www.math.ucla.edu/~wotaoyin/papers/bcu/”.

  4. “https://www.math.ucla.edu/~wotaoyin/papers/tmac_tensor_recovery.html”.

  5. “https://github.com/jamiezeminzhang/Tensor_Completion_and_Tensor_RPCA”.

  6. “https://github.com/lijunsun/bgcp_imputation”.

References

  1. Acar, E., Dunlavy, D.M., Kolda, T.G., Mørup, M.: Scalable tensor factorizations for incomplete data. Chemometr. Intell. Lab. Syst. 106, 41–56 (2011)

    Article  Google Scholar 

  2. Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116, 5–16 (2009)

    Article  MathSciNet  Google Scholar 

  3. Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the Kurdyka-Łojasiewicz inequality. Math. Oper. Res. 35, 438–457 (2010)

    Article  MathSciNet  Google Scholar 

  4. Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8, 141–148 (1988)

    Article  MathSciNet  Google Scholar 

  5. Bolte, J., Daniilidis, A., Lewis, A.: The Łojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17, 1205–1223 (2007)

    Article  Google Scholar 

  6. Candès, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 717–772 (2009)

    Article  MathSciNet  Google Scholar 

  7. Chen, C., Li, X., Ng, M., Yuan, X.: Total variation based tensor decomposition for multi-dimensional data with time dimension. Numer. Linear Algebra Appl. 22, 999–1019 (2015)

    Article  MathSciNet  Google Scholar 

  8. Chen, X., He, Z., Sun, L.: A Bayesian tensor decomposition approach for spatiotemporal traffic data imputation. Transp. Res. Part C: Emerg. Technol. 98, 73–84 (2019)

    Article  Google Scholar 

  9. Chen, X., He, Z., Wang, J.: Spatial-temporal traffic speed patterns discovery and incomplete data recovery via SVD-combined tensor decomposition. Transp. Res. Part C: Emerg. Technol. 86, 59–77 (2018)

    Article  Google Scholar 

  10. Chen, X., Yang, J., Sun, L.: A nonconvex low-rank tensor completion model for spatiotemporal traffic data imputation. Transp. Res. Part C: Emerg. Technol. 117, 102673 (2020)

    Article  Google Scholar 

  11. De Lathauwer, L.: Decompositions of a higher-order tensor in block terms–Part I: lemmas for partitioned matrices. SIAM J. Matrix Anal. Appl. 30, 1022–1032 (2008)

    Article  MathSciNet  Google Scholar 

  12. De Lathauwer, L.: Decompositions of a higher-order tensor in block terms–Part II: definitions and uniqueness. SIAM J. Matrix Anal. Appl. 30, 1033–1066 (2008)

    Article  MathSciNet  Google Scholar 

  13. De Lathauwer, L., Nion, D.: Decompositions of a higher-order tensor in block terms–Part III: alternating least squares algorithms. SIAM J. Matrix Anal. Appl. 30, 1067–1083 (2008)

    Article  MathSciNet  Google Scholar 

  14. de Goulart, J.D.M., Kibangou, A.Y., Favier, G.: Traffic data imputation via tensor completion based on soft thresholding of Tucker core. Transp. Res. Part C: Emerg. Technol. 85, 348–362 (2017)

    Article  Google Scholar 

  15. De Silva, V., Lim, L.-H.: Tensor rank and the ill-posedness of the best low-rank approximation problem. SIAM J. Matrix Anal. Appl. 30, 1084–1127 (2008)

    Article  MathSciNet  Google Scholar 

  16. Gunnar, A., Johansson, M., Telkamp, T.: “Traffic matrix estimation on a large IP backbone: A comparison on real data”, in Proc. 4th ACM SIGCOMM Conf. Internet Meas. (2004) 149–160

  17. “Introduction to Cisco IOS NetFlow - A Technical Overview”, (2012)

  18. Jiang, B., Yang, F., Zhang, S.: Tensor and its tucker core: The invariance relationships. Num. Linear Algebra Appl. 24, e2086 (2017)

    Article  MathSciNet  Google Scholar 

  19. Jiang, Q., Ng, M.: “Robust low-tubal-rank tensor completion via convex optimization”, Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-19) (2019) 2649–2655

  20. Kolda, T.G., Bader, B.: Tensor decompositions and applications. SIAM Rev. 51, 455–500 (2009)

    Article  MathSciNet  Google Scholar 

  21. Liu, J., Musialski, P., Wonka, P., Ye, J.: Tensor completion for estimating missing values in visual data. IEEE Trans. Pattern Anal. Mach. Intell. 35, 208–220 (2013)

    Article  Google Scholar 

  22. Majumdar, A.: Matrix Completion via Thresholding, MATLAB Central File Exchange. Retrieved March 28, 2020

  23. Medina, A., Taft, N., Salamatian, K., Bhattacharyya, S., Diot, C.: Traffic matrix estimation: Existing techniques and new directions. ACM SIGCOMM Comput. Commun. Rev. 32, 161–174 (2002)

    Article  Google Scholar 

  24. Qi, L., Chen, Y., Bakshi, M., Zhang, X.: Triple decomposition and tensor recovery of third order tensors. SIAM J. Matrix Anal. Appl. 42, 299–329 (2021)

    Article  MathSciNet  Google Scholar 

  25. Roughan, M., Zhang, Y., Willinger, W., Qiu, L.: Spatio-temporal compressive sensing and internet traffic matrices (extended version). IEEE/ACM Trans. Network. 20, 662–676 (2012)

    Article  Google Scholar 

  26. Sidiropoulos, N.D., De Lathauwer, L., Fu, X., Huang, K., Papalexakis, E.E., Faloutsos, C.: Tensor decomposition for signal processing and machine learning. IEEE Trans. Signal Process. 65, 3551–3582 (2017)

    Article  MathSciNet  Google Scholar 

  27. Tootoonchian, A., Ghobadi, M., Ganjali, Y.: “OpenTM: Traffic matrix estimator for OpenFlow networks”. in Proc. Int. Conf. Passive Active Netw. Meas. (2010) 201–210

  28. Tune, P., Roughan, M.: “Internet traffic matrices: a primer”, in ACM SIGCOMM eBook: Recent Advances in Networking, (2013)

  29. Uhlig, S., Quoitin, B., Lepropre, J., Balon, S.: Providing public intradomain traffic matrices to the research community. ACM SIGCOMM Computer Commun. Rev. 36(1), 83–86 (2006)

    Article  Google Scholar 

  30. Vardi, Y.: Network tomography: Estimating source-destination traffic intensities from link data. J. Am. Stat. Assoc. 91, 365–377 (1996)

    Article  MathSciNet  Google Scholar 

  31. Wang, L., Xie, K., Semong, T., Zhou, H.: Missing data recovery based on tensor-CUR decomposition. IEEE Access 6, 532–544 (2017)

    Article  Google Scholar 

  32. Xie, K., Peng, C., Wang, X., Xie, G., Wen, J., Cao, J., Zhang, D., Qin, Z.: Accurate recovery of internet traffic data under variable rate measurements. IEEE/ACM Trans. Network. 26, 1137–1150 (2018)

    Article  Google Scholar 

  33. Xie, K., Wang, L., Wang, X., Xie, G., Wen, J., Zhang, G.: “Accurate recovery of internet traffic data: A tensor completion approach”, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications (2016)

  34. Xie, K., Wang, L., Wang, X., Xie, G., Wen, J., Zhang, G., Cao, J., Zhang, D.: Accurate recovery of internet traffic data: a sequential tensor completion approach. IEEE/ACM Trans. Network. 26, 793–806 (2018)

    Article  Google Scholar 

  35. Xu, Y., Yin, W.: A block coordinate method for regularized multiconvex optimization with applications to nonnegatove tensor factorizatn and completion. SIAM J. Imaging Sci. 6, 1758–1789 (2013)

    Article  MathSciNet  Google Scholar 

  36. Xu, Y., Hao, R., Yin, W., Su, Z.: Parallel matrix factorization for low-rank tensor completion. Inverse Problems Imaging 9, 601–624 (2015)

    Article  MathSciNet  Google Scholar 

  37. Zhang, Y., Roughan, M., Duffield, N., Greenberg, A.: Fast accurate computation of large-scale IP traffic matrices from link loads. ACM SIGMETRICS Perform. Eval. Rev. 31, 206–217 (2003)

    Article  Google Scholar 

  38. Zhang, Z., Ely, G., Aeron, S., Hao, N., Kilmer, M.: “Novel methods for multilinear data completion and de-noising based on tensor-SVD”, 2014 IEEE Conference on Computer Vision and Pattern Recognition, Columbus, OH, 2014, pp. 3842–3849

  39. Zhou, H., Zhang, D., Xie, K., Chen, Y.: “Spatio-temporal tensor completion for imputing missing internet traffic data”, in Proc. IEEE 34th Int. Perform Comput. Commun. Conf. (2015) 1–7

  40. Zhou, H., Zhang, D., Xie, K., Chen, Y.: “Robust spatio-temporal tensor recovery for internet traffic data”, in 2016 IEEE Trustcom/BigDataSE/ISPA (2016) 1404–1411

  41. Zhou, P., Lu, C., Lin, Z., Zhang, C.: Tensor factorization for low-rank tensor completion. IEEE Trans. Image Process. 27, 1152–1163 (2018)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors are grateful to the associate editor and anonymous referees for helping us to improve the original manuscript.

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, South China Normal University, Guangzhou, China

    Yannan Chen

  2. School of Mathematics, Tianjin University, Tianjin, 300354, China

    Xinzhen Zhang

  3. Future Network Theory Lab, 2012 Labs Huawei Technologies Investment Co., Ltd., Shatin, New Territory, Hong Kong, China

    Liqun Qi

  4. Department of Mathematics, School of Science, Hangzhou Dianzi University, Hangzhou, 310018, China

    Liqun Qi

  5. Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, China

    Liqun Qi

  6. Huawei Theory Research Lab, Kowloon, Hong Kong, China

    Yanwei Xu

Authors
  1. Yannan Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xinzhen Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Liqun Qi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yanwei Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liqun Qi.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Yannan Chen author was supported by the National Natural Science Foundation of China (11771405 and 12071159) and the Guangdong Basic and Applied Basic Research Foundation (2020A1515010489).

Xinzhen Zhang author’s work was supported by NSFC (Grant No. 11871369)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, Y., Zhang, X., Qi, L. et al. A Barzilai–Borwein Gradient Algorithm for Spatio-Temporal Internet Traffic Data Completion via Tensor Triple Decomposition. J Sci Comput 88, 65 (2021). https://doi.org/10.1007/s10915-021-01574-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10915-021-01574-0

Keywords

Search

Navigation