ACM Home Page
Please provide us with feedback. Feedback
Manifold learning visualization of network traffic data
Full text PdfPdf (327 KB)
Source Joint International Conference on Measurement and Modeling of Computer Systems archive
Proceedings of the 2005 ACM SIGCOMM workshop on Mining network data table of contents
Philadelphia, Pennsylvania, USA
SESSION: Traffic analysis and infrastructure monitoring table of contents
Pages: 191 - 196  
Year of Publication: 2005
ISBN:1-59593-026-4
Authors
Neal Patwari  University of Michigan, Ann Arbor, MI
Alfred O. Hero, III  University of Michigan, Ann Arbor, MI
Adam Pacholski  University of Michigan, Ann Arbor, MI
Sponsors
SIGCOMM: ACM Special Interest Group on Data Communication
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 91,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1080173.1080182
What is a DOI?

ABSTRACT

When traffic anomalies or intrusion attempts occur on the network, we expect that the distribution of network traffic will change. Monitoring the network for changes over time, across space (at various routers in the network), over source and destination ports, IP addresses, or AS numbers, is an important part of anomaly detection. We present a manifold learning (ML)-based tool for the visualization of large sets of data which emphasizes the unusually small or large correlations that exist within the data set. We apply the tool to display anomalous traffic recorded by NetFlow on the Abilene backbone network. Furthermore, we present an online Java-based GUI which allows interactive demonstration of the use of the visualization method.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
J. B. Tenenbaum, V. de Silva, and J. C. Langford, "A global geometric framework for nonlinear dimensionality reduction," Science, vol. 290, pp. 2319--2323, Dec 2000.
 
4
S. T. Roweis and L. K. Saul, "Nonlinear dimensionality reduction by local linear embedding," Science, vol. 290, pp. 2323--2326, Dec 2000.
 
5
J. A. Costa, N. Patwari, and A. O. Hero III, "Distributed multidimensional scaling with adaptive weighting for node localization in sensor networks," IEEE/ACM Trans. Sensor Networks, submitted May 2004, (revised Jan. and May 2005). {Online}. Available: http://www.eecs.umich.edu/~hero/comm.html
 
6
A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. J. Strauss, "QuickSAND: Quick summary and analysis of network data," DIMACS, Tech. Rep. 2001-43, Nov. 2001. {Online}. Available: http://www.math.lsa.umich.edu/~annacg/ps.files/quickdimacstr.ps
7
8
 
9
10
11
 
12
Cooperative Association for Internet Data Analysis (CAIDA). http://www.caida.org/.
 
13
 
14
 
15
W. Cleveland, "Robust locally weighted regression and smoothing scatterplots," J. American Statistical Assoc., vol. 74, no. 368, pp. 829--836, 1979.
 
16
Map-tools online supplement. http://www.engin.umich.edu/~npatwari/mnd05.
 
17
Internet2: Abilene Observatory. http://abilene.internet2.edu/observatory/.


Collaborative Colleagues:
Neal Patwari: colleagues
Alfred O. Hero, III: colleagues
Adam Pacholski: colleagues