Compact routing on the Internet AS-graph

Strowes, S.D., Mooney, G. and Perkins, C.S. (2011) Compact routing on the Internet AS-graph. In: INFOCOM Workshop: 2011 IEEE Conference on Computer Communications, Shanghai, China, 15 Apr 2011, pp. 852-857. (doi:10.1109/INFCOMW.2011.5928931)

[img] Text



Compact routing algorithms have been presented as candidates for scalable routing in the future Internet, achieving near-shortest path routing with considerably less forwarding state than the Border Gateway Protocol. Prior analyses have shown strong performance on power-law random graphs, but to better understand the applicability of compact routing algorithms in the context of the Internet, they must be evaluated against real- world data. To this end, we present the first systematic analysis of the behaviour of the Thorup-Zwick (TZ) and Brady-Cowen (BC) compact routing algorithms on snapshots of the Internet Autonomous System graph spanning a 14 year period. Both algorithms are shown to offer consistently strong performance on the AS graph, producing small forwarding tables with low stretch for all snapshots tested. We find that the average stretch for the TZ algorithm increases slightly as the AS graph has grown, while previous results on synthetic data suggested the opposite would be true. We also present new results to show which features of the algorithms contribute to their strong performance on these graphs.

Item Type:Conference Proceedings
Additional Information:© 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
Glasgow Author(s) Enlighten ID:Perkins, Dr Colin
Authors: Strowes, S.D., Mooney, G., and Perkins, C.S.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Research Group:ENDS
Copyright Holders:Copyright © 2011 IEEE
First Published:First published in Proceedings of INFOCOM Workshop: 2011 IEEE Conference on Computer Communications, Shanghai, China, 15 Apr 2011
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher.

University Staff: Request a correction | Enlighten Editors: Update this record