A Secure Network Admission and Routing Model Based on Trust Theory

Abstract

This paper presents a trust-based model for secure network admission and trustworthy routing. Firstly, a dynamic routing trust model based on trust relationship and routing behaviors is brought forward. The model not only supports trust network connection, but also gives a comprehensive assessment to the network security and efficiency affected by router access according to routers' interactive behaviors. Secondly, the trust degree between any two routers can be notified to all by a dependable flooding algorithm. Finally, a new routing strategy called by "minimal trust routing entropy" is proposed, which is good at avoiding nodes with low trust while taking into account the routing efficiency. This model can be used for the next-generation connection-oriented Internet which is controllable and trustworthy.