Leland W, Taqqu M, and Weland W, et al.. On the self-similar nature of ethernet traffic (Extended version)[J].IEEE/ACM Transactions on Networking.1994, 2(3):1-15[2]Paxson V and Floyd S. Wide-area traffic: the failure of poisson modeling[J].IEEE/ACM Transactions on Networking.1995, 3(2):226-244[3]Uhlig S, Quoitin B, and Lepropre J, et al.. Providing public intradomain traffic matrices to the research community. ACM SIGCOMM Computer Communication Review, 2006, 36(3): 156-167.[4]Lakhina A, Crovella M, and Diot C. Diagnosing network-wide traffic anomalies. SIGCOMM, Portland, Oregon, USA, 2004: 224-235.[5]Rubinstein B I P, Nelson B, and Huang L. Stealthy Poisoning Attacks on PCA-based Anomaly Detectors. SIGMETRICS, 2009: 168-179.Rubinstein B I P, Nelson B, and Huang L, et al.. Compromising PCA-based anomaly detectors for network- wide traffic. Technical Report UCB/EECS-2008-73, 2009.[6]Vardi V. Network tomography: estimating source-destination traffic intensities from link data[J].Journal of the American Statistical Association.1996, 91(6):365-377[7]Lakhina A, papagiannaki K, and Crovella M, et al.. Structural analysis of network traffic flows. SIGMETRICS, New York, NY, USA, 2004: 345-356.[8]Zhang Y, Roughan M, and Willinger W, et al.. Spatio- temporal compressive sensing and Internet traffic matrices. SIGCOMM, Barcelona, Spain, 2009: 110-121.[9]Xu K, Zhang Z L, and Bhattacharyya S. Internet traffic behavior profiling for network security monitoring[J].IEEE/ACM Transactions on Networking.2008, 16(4):1241-1252[10]Tenenbaum J B, Silva V D, and Langford J C. A global geometric framework for nonlinear dimensionality reduction[J].Science.2000, 290(12):2319-2323[11]Roweis S T and Saul L K. Nonlinear dimensionality reduction by locally linear embedding[J].Science.2000, 290(12):2323-2325[12]Gerber S, Tasdizen T, and Joshi S, et al.. On the manifold structure of the space of brain images. MICCAI, USA, 2009: 263-268.[13]邵超, 黄厚宽, 赵连伟. 一种更具拓扑稳定性的ISOMAP算法. 软件学报, 2007, 18(3): 869-877.[14]文贵华, 陆庭辉, 江丽君. 基于相对流形的局部线性嵌入. 软件学报, 2009, 20(6): 2376-2386.
|