Trust Analysis of Link State Network Routing
Dijiang Huang, Deep Medhi, Cory C. Beard, Lein Harn
Abstract
Dijiang Huang, Deep Medhi, Cory C. Beard, Lein Harn
Abstract
Abstract: Network routing security has received more attention recently. But there are no good design guidelines on how to construct secure network routing domains. There are also no proper evaluation methods to validate the many proposed secure routing frameworks. We analyze network routing security issues via a new approach: trust relations among network routers. Based on the presented trust models for link state routing, we analyze network routing survivability issues. Then we outline the research directions to build secure network routing.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract: Network routing security has received more attention recently. But there are no good design guidelines on how to construct secure network routing domains. There are also no proper evaluation methods to validate the many proposed secure routing frameworks. We analyze network routing security issues via a new approach: trust relations among network routers. Based on the presented trust models for link state routing, we analyze network routing survivability issues. Then we outline the research directions to build secure network routing.
Key concepts: Computer network, Policy-based routing, Static routing, Computer science, Link-state routing protocol, Routing domain, Routing table, Hierarchical routing