IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v87y2024i3d10.1007_s10589-023-00545-5.html
   My bibliography  Save this article

Internet traffic tensor completion with tensor nuclear norm

Author

Listed:
  • Can Li

    (South China Normal University
    Honghe University)

  • Yannan Chen

    (South China Normal University)

  • Dong-Hui Li

    (South China Normal University)

Abstract

The incomplete data is a common phenomenon in traffic network because of the high measurement cost, the failure of data collection systems and unavoidable transmission loss. Recovering the whole data from incomplete data is a very important task in internet engineering and management. In this paper, we adopt the low-rank tensor completion model equipped with tensor nuclear norm to reconstruct the internet traffic data. Besides using a low rank tensor to capture the global information of internet traffic data, we also utilize spatial correlation and periodicity to characterize the local information. The resulting model is a convex and separable optimization. Then, a proximal alternating direction method of multipliers is customized to solve the optimization problem, where all subproblems have closed-form solutions. Convergence analysis of the algorithm is given without any assumptions. Numerical experiments on Abilene and GÉANT datasets with random missing and structured loss show that the proposed model and algorithm perform better than other existing algorithms.

Suggested Citation

  • Can Li & Yannan Chen & Dong-Hui Li, 2024. "Internet traffic tensor completion with tensor nuclear norm," Computational Optimization and Applications, Springer, vol. 87(3), pages 1033-1057, April.
    • Handle: RePEc:spr:coopap:v:87:y:2024:i:3:d:10.1007_s10589-023-00545-5
    DOI: 10.1007/s10589-023-00545-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-023-00545-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10589-023-00545-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:87:y:2024:i:3:d:10.1007_s10589-023-00545-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.