By Topic

Formal analysis approach on networks with dynamic behaviours

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Gayan de Silva ; Faculty of Information Technology, Brno University of Technology, Czech Republic ; Petr Matoušek ; Ondřej Ryšavý ; Miroslav Švéda

Formal verification and validation techniques such as model checking are not widely used in computer networks. These methods are very useful to identify configuration errors, identify design problems and predict network behaviours under different network conditions. This paper describes the two main components of the formal verification process, formal modelling and the analysis process. For formal modelling, computer networks configured with dynamic routing protocols such as RIP, OSFP or EIGRP are considered. For the analysis, reachability and security properties are evaluated as the behavioural properties in the case of device or link failures. Graph Theory is used to implement the model and predict the network behaviours. The process of building the model, grouping the network states which have common behaviours and predicting behaviours are the core work of this paper. Furthermore this paper details a method to reduce the state space and hence eliminate the state space explosion.

Published in:

Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), 2010 International Congress on

Date of Conference:

18-20 Oct. 2010