In EDS ansehen

Tomogravity space based traffic matrix estimation in data center networks.

Gespeichert in:
Bibliographische Detailangaben
Titel: Tomogravity space based traffic matrix estimation in data center networks.
Autoren: Liu, Guiyan1, Guo, Songtao1 stguo@swu.edu.cn, Zhao, Quanjun1, Yang, Yuanyuan1,2
Quelle: Future Generation Computer Systems. Sep2018, Vol. 86, p39-50. 12p.
Schlagwörter: *SERVER farms (Computer network management), *SIMPLE Network Management Protocol (Computer network protocol), *ESTIMATION theory, *DATABASE management, DATA packeting
Abstract: Traffic matrix (TM) is an important input requirement to better system management in data center networks (DCNs). Directly estimating TM is cost and difficult since the flow behaviors in DCNs are irregular and the TM across the Top of Rack (ToR) switches is huge. Although indirect TM estimation tomography based methods can be applied in DCNs after decomposing tree-like structure, these approaches require a good prior TM obtained by gravity model to improve estimation accuracy. In addition, data collection from the Simple Network Management Protocol (SNMP) employed in DCNs can result in unavoidable data missing and data errors. Therefore, it is necessary to estimate a good prior TM and study the effect of link data missing or data errors on estimation accuracy. In this paper, we utilize the tomogravity space to achieve TM estimation in decomposed tree-like DCNs without requiring a good prior TM because the gravity model can be replaced by gravity space. We propose two iterative algorithms to estimate TM between tomogravity space and gravity space, and use similar-Mahalanobis distance as a metric to control estimation errors. One iterative algorithm utilizes a prior TM calculated based on coarse-grained traffic characteristics, whereas the other considers moderate link data missing and no prior TM based on traffic characteristics. To further separately discuss the effect of link data errors, we obtain desirable link measurement from packet trace and routing matrix. Numerical results demonstrate that our iterative algorithms outperform the existing algorithms in terms of controlling data errors based on decomposed structure and produce robust results when adding different noise level on the link data. [ABSTRACT FROM AUTHOR]
Copyright of Future Generation Computer Systems is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Datenbank: Business Source Index
Beschreibung
Abstract:Traffic matrix (TM) is an important input requirement to better system management in data center networks (DCNs). Directly estimating TM is cost and difficult since the flow behaviors in DCNs are irregular and the TM across the Top of Rack (ToR) switches is huge. Although indirect TM estimation tomography based methods can be applied in DCNs after decomposing tree-like structure, these approaches require a good prior TM obtained by gravity model to improve estimation accuracy. In addition, data collection from the Simple Network Management Protocol (SNMP) employed in DCNs can result in unavoidable data missing and data errors. Therefore, it is necessary to estimate a good prior TM and study the effect of link data missing or data errors on estimation accuracy. In this paper, we utilize the tomogravity space to achieve TM estimation in decomposed tree-like DCNs without requiring a good prior TM because the gravity model can be replaced by gravity space. We propose two iterative algorithms to estimate TM between tomogravity space and gravity space, and use similar-Mahalanobis distance as a metric to control estimation errors. One iterative algorithm utilizes a prior TM calculated based on coarse-grained traffic characteristics, whereas the other considers moderate link data missing and no prior TM based on traffic characteristics. To further separately discuss the effect of link data errors, we obtain desirable link measurement from packet trace and routing matrix. Numerical results demonstrate that our iterative algorithms outperform the existing algorithms in terms of controlling data errors based on decomposed structure and produce robust results when adding different noise level on the link data. [ABSTRACT FROM AUTHOR]
ISSN:0167739X
DOI:10.1016/j.future.2018.03.011