loading...
Routing Inference Based on Pseudo Traffic Matrix Estimation
Vienna, Austria April 18-April 20
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AINA.2006.29120th International Conference on Adva ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ziqian Liu, Beijing Jiaotong University
Changjia Chen, Beijing Jiaotong University
Routing information is so crucial to an operational network that it is always regarded as confidential by network administrators. This paper proposes a novel routing inference method that only needs the knowledge of the network topology and the link counts, both of which can be obtained from MRTG (Multi-Router Traffic Grahper) data. The insight is that the traffic observed on each link arises from the superposition of the traffic demands between the origin-destination (OD) pairs and each traffic demand corresponds to a unique path. The method employs expectation maximization (EM) algorithm cooperating with a hypothetic pseudo routing scheme, which is expected to embrace the real routing, to compute a pseudo traffic matrix. The real routing then can be conjectured from this pseudo traffic matrix. This method is applied to a real IP network, and the results show that it correctly infers the routings for 87% OD pairs.
Citation:
Ziqian Liu, Changjia Chen, "Routing Inference Based on Pseudo Traffic Matrix Estimation," aina, vol. 1, pp.159-164, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.