CCIPCA-OPCSC: An online method for detecting shared congestion paths

It is very useful to detect network paths sharing the same bottleneck for improving efficiency and fairness of network resource usage. Existing techniques have been designed to detect shared congestion between a pair of paths with a common source or destination point. And they are poor in scalability and not applicable to online detection. To cope with these problems, a novel method called CCIPCA-based Online Path Clustering by Shared Congestion (CCIPCA-OPCSC) is proposed to detect shared congestion paths, whose essence lies in the use of a novel eigenvector projection analysis (EPA). First, the delay measurement data of each path are mapped into a point in a new, low-dimensional space based on the correlation among paths reflected by the eigenvectors and eigenvalues in the process of PCA. In this new space, points are close to each other if the corresponding paths share congestion. CCIPCA is also introduced to compute the eigenvectors and eigenvalues incrementally. Second, the clustering analysis is applied on these points so as to identify shared congestion paths accurately. CCIPCA-OPCSC has low computational complexity and can fulfill the requirement of online detection. This method is evaluated by NS2 simulations and experiments on the PlanetLab testbed over the Internet. The results demonstrate that this novel method is feasible and effective.

[1]  Azer Bestavros,et al.  Robust identification of shared losses using end-to-end unicast probes , 2000, Proceedings 2000 International Conference on Network Protocols.

[2]  Ossama Younis,et al.  FlowMate: scalable on-line flow clustering , 2005, IEEE/ACM Transactions on Networking.

[3]  Joseph D. Touch,et al.  TCP Control Block Interdependence , 1997, RFC.

[4]  Donald F. Towsley,et al.  Detecting shared congestion of flows via end-to-end measurement , 2002, TNET.

[5]  Xiaowei Yang,et al.  A passive approach for detecting shared bottlenecks , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

[6]  Yong-June Shin,et al.  A wavelet-based approach to detect shared congestion , 2004, TNET.

[7]  Muhammad Murtaza Yousaf.  Accurate Shared Bottleneck Detection and File Transfer Delay Prediction for Grid Scheduling , 2008 .

[8]  Gene H. Golub,et al.  Matrix computations , 1983 .

[9]  D. Massart,et al.  Looking for natural patterns in data: Part 1. Density-based approach , 2001 .

[10]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[11]  Xiaomin Zhu,et al.  Introducing multipath selection for concurrent multipath transfer in the future internet , 2011, Comput. Networks.

[12]  Srinivasan Seshan,et al.  An integrated congestion management architecture for Internet hosts , 1999, SIGCOMM '99.

[13]  Juyang Weng,et al.  Candid Covariance-Free Incremental Principal Component Analysis , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Yuji Oie,et al.  Locating congested segments over the Internet by clustering the delay performance of multiple paths , 2009, Comput. Commun..

[15]  John S. Heidemann,et al.  Effects of ensemble-TCP , 2000, CCRV.

[16]  Peter Steenkiste,et al.  Exploiting internet route sharing for large scale available bandwidth estimation , 2005, IMC '05.

[17]  Yong-June Shin,et al.  Scalable Clustering of Internet Paths by Shared Congestion , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.