Abstract
Contrasting multi-level routes (e.g., IP, subnet, AS levels) is an analytical primitive underpinning many applications, such as route asymmetry and/or diversity measurement, route change characterization, efficient route-tracing design, and others. We are the first to identify that current approaches incur redundant node comparisons, because they treat each level independently. We propose a new approach called rtd that eliminates the redundancy, therefore improves the analysis efficiency, by integrating all levels recursively. Our extensive evaluations on simulated traces and real data from Ark, FastMapping, and iPlane datasets show that rtd eliminates 85% comparisons on average and doubles the analysis speed. Finally, we design a route clustering application using rtd, and demonstrate how it aids the monitoring of an ISP transition.
Original language | English |
---|---|
Title of host publication | 2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013), 27-31 May 2013, Ghent |
Publisher | IEEE |
Pages | 101-108 |
Number of pages | 8 |
ISBN (Print) | 9783901882517 |
Publication status | Published - May 2013 |
Event | 2013 IFIP/IEEE International Symposium on Integrated Network Management, IM 2013 - Ghent, Belgium Duration: 27 May 2013 → 31 May 2013 |
Conference
Conference | 2013 IFIP/IEEE International Symposium on Integrated Network Management, IM 2013 |
---|---|
Country/Territory | Belgium |
City | Ghent |
Period | 27/05/13 → 31/05/13 |
Keywords
- IP networks
- Graph theory
- Pattern clustering
- Redundancy
- Telecommunication network routing
ASJC Scopus subject areas
- Computer Networks and Communications