Path Trustworthiness Range

Based on trustworthiness, defines a couple of concepts associated with trusted path, the most trusted path and the least trusted path. In order to look for the most trusted path and the least trusted path we propose two trusted path algorithms, which are proved to be really the most credible and the least credible; quantify the trustworthiness of the most trusted path and the least trusted path; and generates a path trustworthiness range. Analysis shows that the time and space complexities of the two algorithms are polynomial time. We differentiate clearly both direction of message forwarding and direction of trustworthiness evaluation. Through typical application, verifies the shortest path is not necessarily the most trusted path. Especially, in the large-scale distributed environment, the most trusted path algorithm assures us that we can obtain information from the most trusted path, and can confirm path trustworthiness range to obtain information.