检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China
出 处:《Tsinghua Science and Technology》2004年第1期9-16,共8页清华大学学报(自然科学版(英文版)
基 金:the National Natural Science Foundation of China (No. 60102009; No. 90104002) and the National High-Tech Research and Development Program of China (No. 2001AA112061)
摘 要: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.
关 键 词:routing protocol testing open shortest path first (OSPF) distributed and concurrent systems
分 类 号:TP393.07[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49