Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/25924
Title: An efficient approach to multi-level route analytics
Authors: Chen, A
Chan, EWW
Luo, X 
Fok, WWT
Chang, RKC 
Keywords: IP networks
Graph theory
Pattern clustering
Redundancy
Telecommunication network routing
Issue Date: 2013
Publisher: IEEE
Source: 2013 IFIP/IEEE International Symposium on Integrated Network Management (IM 2013), 27-31 May 2013, Ghent, p. 101-108 How to cite?
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.
URI: http://hdl.handle.net/10397/25924
ISBN: 978-1-4673-5229-1
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

40
Last Week
1
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.