A Case for Complexity Models in Network Design and Management

File(s):

Author(s): Benson, Theophilus; Akella, Aditya; Maltz, Dave
Publisher: University of Wisconsin-Madison Department of Computer Sciences
Date: Mar 15, 2012
Abstract: Anecdotal evidence and intuition suggest that an operatorís ability to manage a network decreases as the network becomes more complex. However, there is currently no way to systematically quantify how complex a networkís design is nor how complexity may impact network management activities. In this paper, we develop a suite of complexity models that describe the routing design and conﬁguration of a network in a succinct fashion, abstracting away details of the underlying conﬁguration languages. Our models, and the complexity metrics arising from them, capture the difﬁculty of conﬁguring speciﬁc control and data plane behaviors in various routers. They also enable measurement of the inherent complexity of reachability constraints that a network implements via its routing design. Our models simplify network design and management by facil- itating comparison between alternative designs for a network. To demonstrate their value, we use the metrics to perform a comparative study of the complexity of ﬁve different networks, including three university networks and two enterprise networks.
Permanent link: http://digital.library.wisc.edu/1793/60650
Export: Export to RefWorks