Abstract
As communications networks are expanding to larger areas the control and maintenance of routing information are becoming a formidable task. To cope with its size and complexity and to make the network reliable and scalable hierarchical network has been proposed with new features to support the information infrastructure. However, the network hierarchy adds more complications to the network design and implementations and that hampers the network reliability and quality of services. Conformance testing is known to be a powerful tool for network fault detection yet most of the works in the published literature are on networks without hierarchy. We present probabilistic algorithms for testing hierarchical networks along with the added features. Based on a formal model of the networks, we provide a formal analysis that shows that our probabilistic algorithms guarantee a high fault coverage with a feasible number of tests. To further reduce the number of tests we identify test equivalence classes and that enables us to significantly reduce the number of tests yet without losing the fault coverage. Experimental results on Internet OSPF protocol are reported.
Chapter PDF
Similar content being viewed by others
References
Agilent Technologies, http://advanced.comms.agilent.com/routertester/
ATM Forum: Private Network-Network Interface Specification Version 1.1 (PNNI 1.1) (2002)
van Bochmann, G., Petrenko, A.: Protocol Testing: Review of Methods and Relevance for Software Testing. In: International Symposium on Software Testing and Analysis, Seattle, Washington, USA (August 1994)
En-Nouaary, A., Khendek, F., Dssouli, R.: Fault Coverage in Testing Real-Time Systems. In: Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications (1999)
Khoumsi, A., Akalay, M., Dssouli, R., En-Nouaary, A., Granger, L.: An Approach for Testing Real Time Protocol Entities. In: Proceedings of the IFIP TC6/WG6.1 13th International Conference on Testing Communicating Systems: Tools and Techniques (2000)
En-Nouaary, A., Dssouli, R., Khendek, F.: Timed Wp-Method: Testing Real-Time Systems. IEEE Transactions on Software Engineering 28(11) (November 2002)
Gupta, R., Smolka, S.A., Bhaskar, S.: On Randomization in Sequential and Distributed Algorithms. ACM Computing Surveys 26(1) (1994)
Hao, R., Lee, D., Sinha, R., Vlah, D.: Testing IP Routing Protocols - From Probabilistic Algorithms to Software Tool. In: FORTE/PSTV (2000)
Ixia, http://www.ixiacom.com/products/conformance_applications/
Kleinrock, L., Kamoun, F.: Hierarchical Routing for Large networks Performance Evaluation and Optimization. Computer Networks 1(3), 155–174 (1977)
Lee, D., Sabnani, K.K., Kristol, D.M., Paul, S.: Conformance Testing of Protocols Specified as Communicating Finite State Machines - a Guided Random Walk Based Approach. IEEE Trans. on Communications 44(5), 631–640 (1996)
Lee, D., Yannakakis, M.: Principles and Methods of Testing Finite State Machines - a Survey. Proceedings of the IEEE 84, 1090–1123 (1996)
Motwani, R., Rafhavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)
Motwani, R., Raghavan, P.: Randomized Algorithms. ACM Computing Surveys 28(1) (1996)
Moy, J.: OSPF - Anatomy of an Internet Routing Protocol. Addison-Wesley, Reading (1997)
Moy, J.: OSPF Version 2. Internet RFC 2328
Petrenko, A.: Fault Model-Driven Test Derivation from Finite State Models: Annotated Bibliography. In: The Proceedings of Modelling and Verification of Parallel Processes (MOVEP’2k), Nantes, France, June 19-23 (2000)
Schwartz, M.: Telecommunication Networks: Protocol, Modeling and Analysis. Addison-Wesley, Reading (1987)
Spirent Communications, http://www.spirentcom.com/
Zebra, http://www.zebra.org/
Zhao, Y., Yin, X., Han, B., Wu, J.: OnLine Test System Applied in Routing Protocol Test. In: International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, MASCOTS (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
Li, K., Lee, D. (2005). Fault Detection of Hierarchical Networks with Probabilistic Testing Algorithms. In: Khendek, F., Dssouli, R. (eds) Testing of Communicating Systems. TestCom 2005. Lecture Notes in Computer Science, vol 3502. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11430230_18
Download citation
DOI: https://doi.org/10.1007/11430230_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26054-7
Online ISBN: 978-3-540-32076-0
eBook Packages: Computer ScienceComputer Science (R0)