Name
Abstract | ||
|---|---|---|
Most existing techniques detecting shared congestion paths are based on pair-wise comparison of paths with a common source or destination point. It is difficult to extend them to cluster paths with different sources and destinations. In this paper, we propose a scalable approach to cluster shared congestion paths based on PCA. This algorithm maps the delay measurement data of each path into a point in a new, low-dimensional space based on the factor loading matrix in PCA, which reflect correlation between paths. In this new space, points are close to each other if the corresponding paths share congestion. Then, the clustering analysis is applied to these points so as to identify shared congestion paths accurately. This algorithm is evaluated by NS2 simulations. The results show us that this algorithm has high accuracy. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/IWQOS.2011.5931338 | IWQoS |
Keywords | Field | DocType |
common source,new space,clustering analysis,ns2 simulation,low-dimensional space,cluster path,congestion path,destination point,algorithm map,corresponding paths share congestion,covariance matrix,dbscan,correlation,pair wise comparison,pca,internet,principal component analysis,cluster analysis,network congestion,clustering algorithms | Pairwise comparison,Computer science,Matrix (mathematics),Computer network,Network congestion,Covariance matrix,Cluster analysis,Principal component analysis,DBSCAN,Scalability | Conference |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lidong Yu | 1 | 0 | 0.68 |
| Changyou Xing | 2 | 47 | 10.55 |
| Huali Bai | 3 | 8 | 1.85 |
| Ming Chen | 4 | 59 | 12.00 |
| Mingwei Xu | 5 | 644 | 97.00 |