This paper presents a novel trust model based on multiple decision factor theory （MDFT） and a trust routing algorithm based on MDFT to exactly evaluate routing node trust and establish a trustworthy routing path. MD...This paper presents a novel trust model based on multiple decision factor theory （MDFT） and a trust routing algorithm based on MDFT to exactly evaluate routing node trust and establish a trustworthy routing path. MDFT integrates four dimensional trust decision factors including behavior, state, recommend and node liveness to realize an exactly finer-grained trust evaluation. On the basis of MDFT, a trust routing algorithm is presented and validated in open shortest path first （OSPF） protocol. Simulation resuRs show that the algorithm can reflect the routing node trust accurately and has better dynamic response ability. Under the circumstance of existing deceptive nodes, the algorithm has better anti-deception performance and higher attack node detection rate than conventional algorithm.展开更多
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 s...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.展开更多
基金supported by the National Natural Science Foundation of China (61121061, 61161140320)The National Key Technology R&D Program (2012BAH38B02)
文摘This paper presents a novel trust model based on multiple decision factor theory （MDFT） and a trust routing algorithm based on MDFT to exactly evaluate routing node trust and establish a trustworthy routing path. MDFT integrates four dimensional trust decision factors including behavior, state, recommend and node liveness to realize an exactly finer-grained trust evaluation. On the basis of MDFT, a trust routing algorithm is presented and validated in open shortest path first （OSPF） protocol. Simulation resuRs show that the algorithm can reflect the routing node trust accurately and has better dynamic response ability. Under the circumstance of existing deceptive nodes, the algorithm has better anti-deception performance and higher attack node detection rate than conventional algorithm.
基金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.
