Dong Yuxin

The self-organizing trust model of the Internetware based on evolutionary game

In order to explore the dynamic process of the trust mechanism of the Internetware entities, this paper proposes a self-organizing trust model of the Internetware by means of the replicated dynamic equation based on the Wright-Fisher process, and analyzes the evolutionary direction and the stability of the Internetware system by establishing the incentive and punitive mechanism. This kind of self-organizing trust model has the function of providing a referenced model for the optimization and stability of the Internetware system, improving the credibility of the Internetware system, and making the system run in a long and stable state.

A trust evaluation and recommendation algorithm based on Internetware

Internetware is endowed with more flexibility in the dynamic, open network. However, it is facing a big challenge in trust evaluation on interaction between two components. This paper proposes an effective way of trust evaluation based on the punishment mechanism and proved its function to resist malicious attack. As trust relationships can be obtained by the recommendations of other Internetwares, thus a virtual trust information network naturally formed. In this way, the trust relationship of an Internetware can be derived without direct interaction. However, the problem lies in we might get malicious information and be led to misjudgment in such a complex and changeable network. Therefore, we put forward an algorithm based on the idea of RIP routing algorithm. The algorithm is proved to be efficient and reliable through experiment.

A New Link Prediction Algorithm: Node Link Strength Algorithm

Link prediction is an important content in the related fields of social networks. Nowadays, the link prediction algorithm based on node similarity is the research hotspot. Node similarity is usually calculated by common neighbours, however, the impact of each common neighbour on the link is different, and how to distinguish the different roles of common neighbours needs to be further studied. The paper proposes the concept of node link strength and redefines the calculation method of node similarity. The new algorithm takes into account the link strength between the common neighbour nodes and the predicted nodes, better to reflect the effect of each common neighbour node. The algorithm is carried out experiments on five real social network datasets, the prediction results show that the algorithms prediction accuracy is more effective than the existing mainstream algorithms based on node similarity and maintains low time complexity.

Research on Game strategy of online maintenance for Internetware

The paper explores the methods on decision of optimal strategy for online maintenance for Internetware through static Game Theory. An Online Maintenance Game Model (OMGM) is put forward, which simulating the trend of consuming resource and involving the dependent relationship and characteristics of the procedure maintenance among fault Internetwares. In the case of single fault Internetware and double dependent fault Internetwares, we studies calculation methods for comprehensive payoff of various maintenance strategies and extends methods to adopt online maintenance strategy decision for multiple fault Internetwares, thereby, technology and theoretical support are provided to guarantee the scalability and stability of Internetware.