DocumentCode
2017811
Title
Harnessing Internet topological stability in Thorup-Zwick compact routing
Author
Strowes, Stephen D. ; Perkins, Colin
Author_Institution
Sch. of Comput. Sci., Univ. of Glasgow, Glasgow, UK
fYear
2012
fDate
25-30 March 2012
Firstpage
2551
Lastpage
2555
Abstract
Thorup-Zwick (TZ) compact routing guarantees sublinear state growth with the size of the network by routing via landmarks and incurring some path stretch. It uses a pseudo-random landmark selection designed for static graphs, and unsuitable for Internet routing. We propose a landmark selection algorithm for the Internet AS graph that uses k-shells decomposition to choose landmarks. Using snapshots of the AS graph from 1997-2010, we demonstrate that the ASes in the kmax-shell are highly-stable over time, and form a sufficient landmark set for TZ routing in the overwhelming majority of cases (in the remainder, adding the next k-shell suffices). We evaluate path stretch and forwarding table sizes, and show that these landmark sets retain low average path stretch with tiny forwarding tables, but are better suited to the dynamic nature of the AS graph than the original TZ landmark selection algorithm.
Keywords
Internet; graph theory; telecommunication network routing; telecommunication network topology; Internet AS graph; Internet routing; Internet topological stability; TZ landmark selection algorithm; Thorup-Zwick compact routing; forwarding tables; pseudo-random landmark selection; static graphs; sublinear state growth; Additives; Clustering algorithms; Educational institutions; Heuristic algorithms; Internet; Peer to peer computing; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM, 2012 Proceedings IEEE
Conference_Location
Orlando, FL
ISSN
0743-166X
Print_ISBN
978-1-4673-0773-4
Type
conf
DOI
10.1109/INFCOM.2012.6195651
Filename
6195651
Link To Document