关键词: 信誉, 节点, 推拉协议, 迭代

Abstract: In the existing reputation models, the accumulation of reputation of certain node requires so long a period even if that node provides good services, which influences the positivity of those newly added nodes. Besides, most models composite the global trust value by multiple iteration, and the huge amount of iteration will bring massive computational expense. On account of the above issue, this dissertation proposes a new reputation computing model by introducing the typical push-pull model in streaming media scheduling strategy. The push model can accelerate the trust value accumulation speed of those newly added nodes which provide good services, while the pull model reduces the network flows online and avoids the negative impacts of the iteration computation. Through analysis and simulation, this model can ensure the accuracy of reputation computation, meanwhile, the communication and computation expenses can get improved as well.

Key words: reputation, peer, push-pull protocol, iteration