Where’s Waldo? practical searches for stability in iBGP
Date
2008
Authors
Flavel, A.
Roughan, M.
Bean, N.
Shaikh, A.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings of the IEEE: International Conference on Network Protocols, 2008:pp.308-317
Statement of Responsibility
Ashley Flavel, Matthew Roughan, Nigel Bean and Aman Shaikh
Conference Name
ICNP 2008: IEEE International Conference on Network Protocols (16th : 2008 : Orlando, Florida)
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.
School/Discipline
Dissertation Note
Provenance
Description
Copyright © 2008 IEEE