DocumentCode
2693370
Title
Application dependency discovery using matrix factorization
Author
Ding, Min ; Singh, Vishal ; Zhang, Yueping ; Jiang, Guofei
Author_Institution
NEC Labs. America, Inc., Princeton, NJ, USA
fYear
2012
fDate
4-5 June 2012
Firstpage
1
Lastpage
4
Abstract
Driven by the large-scale growth of applications deployment in data centers and complicated interactions between service components, automated application dependency discovery becomes essential to daily system management and operation. In this paper, we present ADD, which extracts dependency paths for each application by decomposing the application-layer connectivity graph inferred from passive network monitoring data. ADD utilizes a series of statistical techniques and is based on the combination of global observation of application traffic matrix in the data center and local observation of traffic volumes at small time scales on each server. Compared to existing approaches, ADD is especially effective in the presence of overlapping and multi-hop applications and resilient to data loss and estimation errors.
Keywords
computer centres; graph theory; matrix decomposition; network servers; statistical analysis; telecommunication traffic; ADD; application traffic matrix; application-layer connectivity graph; automated application dependency discovery; daily system management; daily system operation; data center; data loss; dependency path; estimation error; matrix factorization; multihop application; passive network monitoring data; server; service component; statistical technique; traffic volume; Accuracy; Correlation; Estimation; Matrix decomposition; Monitoring; Servers; Time measurement;
fLanguage
English
Publisher
ieee
Conference_Titel
Quality of Service (IWQoS), 2012 IEEE 20th International Workshop on
Conference_Location
Coimbra
ISSN
1548-615X
Print_ISBN
978-1-4673-1296-7
Electronic_ISBN
1548-615X
Type
conf
DOI
10.1109/IWQoS.2012.6245965
Filename
6245965
Link To Document