Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Conference paper
Title: Where’s Waldo? practical searches for stability in iBGP
Author: Flavel, A.
Roughan, M.
Bean, N.
Shaikh, A.
Citation: Proceedings of the IEEE: International Conference on Network Protocols, 2008:pp.308-317
Publisher: IEEE
Publisher Place: CD
Issue Date: 2008
Series/Report no.: IEEE International Conference on Network Protocols Proceedings
ISBN: 9781424425075
ISSN: 1092-1648
Conference Name: ICNP 2008: IEEE International Conference on Network Protocols (16th : 2008 : Orlando, Florida)
Statement of
Ashley Flavel, Matthew Roughan, Nigel Bean and Aman Shaikh
Abstract: What does a child’s search of a large, complex cartoon for the eponymous character (Waldo) have to do with Internet routing? Network operators also search complex datasets, but Waldo is the least of their worries. Routing oscillation is a much greater concern. Networks can be designed to avoid routing oscillation, but the approaches so far proposed unnecessarily reduce the configuration flexibility. More importantly, apparently minor changes to a configuration can lead to instability. Verification of network stability is therefore an important task, but unlike the child’s search, this problem is NP hard. Until now, no practical method was available for large networks. In this paper, we present an efficient algorithm for proving stability of iBGP, or finding the potential oscillatory modes, and demonstrate its efficacy by applying it to the iBGP configuration of a large Tier-2AS.
Description: Copyright © 2008 IEEE
RMID: 0020085184
DOI: 10.1109/ICNP.2008.4697049
Grant ID:
Published version:
Appears in Collections:Environment Institute publications
Mathematical Sciences publications

Files in This Item:
File Description SizeFormat 
hdl_49342.pdf816.46 kBPublisher's post-printView/Open

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