Name
Abstract | ||
|---|---|---|
Last few decades have observed exponential growth in network demands due to increased popularity of real time applications, such as live chat, gaming etc. The resulting infrastructure growth has made it difficult for the service providers to abide by the service level agreements, especially with regards to the quality of service guarantees. Predicting network latencies from noisy and missing measurements has therefore emerged as an important problem, and a plethora of solutions have been proposed for the same. Existing network latency predictions rely either on Euclidean embedding or matrix completion methods. This work considers the estimation and prediction of network latencies from a sequence of noisy and incomplete latency matrices collected over time. An adaptive matrix completion algorithm is proposed that can handle streaming data at low computational complexity. The performance of the proposed algorithm is characterized both in theory and using a real dataset, demonstrating its viability as a network monitoring tool. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/SPCOM.2018.8724422 | 2018 International Conference on Signal Processing and Communications (SPCOM) |
Keywords | Field | DocType |
Heuristic algorithms,Prediction algorithms,Noise measurement,Delays,Symmetric matrices,Real-time systems | Dynamic network analysis,Service level,Pattern recognition,Matrix completion,Computer science,Latency (engineering),Quality of service,Service provider,Artificial intelligence,Network monitoring,Computational complexity theory,Distributed computing | Conference |
ISSN | ISBN | Citations |
2474-9168 | 978-1-5386-3821-7 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ruchi Tripathi | 1 | 7 | 1.50 |
| Ketan Rajawat | 2 | 124 | 25.44 |