Although the multi-level route analysis (e.g., AS, subnet, IP levels) is very useful to many applications (e.g. profiling route changes, designing efficient route-tracing algorithms, etc.), few research investigates how to conduct such analysis efficiently. Regarding routes as sequences, current approaches only handle two routes at a time and they just apply algorithms designed for general sequence comparison. In this paper, we propose and implement a new approach named Fast-rtd that contrastsmultiple routes simultaneously andexploits the unique features of Internet routes to decrease the computational complexity in terms of time and memory. Our extensive evaluations on real traceroute data demonstrate the efficiency of Fast-rtd, suchasmore than45%memoryreduction, 3% to 15% pruning rate increase, and up to 25% speed improvement.
|Name||Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST|
|Conference||9th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, TridentCom 2014|
|Period||5/05/14 → 7/05/14|
- Multi-level route analysis
- Multiple LCS
- Computer Networks and Communications