摘要
Protocol formalization is one of a class of hard problems in testing routing protocols and characterized by dynamic, concurrent and distributed behavior. For the purpose of performing conformance testing of the open shortest path first protocol link-state database (LSDB) synchronization process, the authors propose a formal model called global behavior tree, which describes global interactions among routers. The model is capable of representing distributed and concurrent behavior and allows for easy test derivation. The corresponding test notation and test derivation algorithm are studied. A simple test method is developed and a software tester is implemented. The results show that this model easily facilitates the testing process and allows a good test coverage.
Protocol formalization is one of a class of hard problems in testing routing protocols and characterized by dynamic, concurrent and distributed behavior. For the purpose of performing conformance testing of the open shortest path first protocol link-state database (LSDB) synchronization process, the authors propose a formal model called global behavior tree, which describes global interactions among routers. The model is capable of representing distributed and concurrent behavior and allows for easy test derivation. The corresponding test notation and test derivation algorithm are studied. A simple test method is developed and a software tester is implemented. The results show that this model easily facilitates the testing process and allows a good test coverage.
基金
the National Natural Science Foundation of China (No. 60102009
No. 90104002) and the National High-Tech Research and Development Program of China (No. 2001AA112061)
