论文部分内容阅读
客户端贡献的不公平性严重影响系统的服务质量和提供服务的能力,本文提出了一个基于距离汇聚的结盟算法,在动态业务量环境中通过实现可收敛反馈网络,有效消除了随机结盟、内容相似驱动结盟和带宽相似驱动结盟中存在的业务量不合理问题。实现了基于公网IP的静态距离算法和基于探测包的距离动态测量法的混合节点间距离评估机制,较好地解决了探测包测距受业务量波动影响较大、客户端感知测距实时性较差以及IP包测距误差较大的问题。引入了一个具有位置意识的基于Polling的均匀流周期请求协同机制,在保持推—拉周期请求机制开销小优点的同时,提高对抗Serving Peer传输劣化和失败的弹性。仿真结果表明:该机制可以减少业务量不合理和用户不贡献恶意行为的概率,当节点较多时,其能够提供比其他结盟算法更好的时延、丢包率和到达率性能。
The unfairness of client’s contribution seriously affects the system’s service quality and the ability to provide services. In this paper, an alliance algorithm based on distance aggregation is proposed in this paper. By implementing convergent feedback network in dynamic traffic environment, the random association and content Similar Driven Alliances and Bandwidth-Driven Alliances There is an unreasonable amount of traffic in the alliance. The static distance algorithm based on public IP and the distance evaluation method based on distance dynamic measurement of probe packets are implemented to solve the problem that the distance between probe packets and the real-time Poor sex and IP packet ranging error larger problem. A location aware Polling-based uniform flow periodic request collaboration mechanism is introduced to improve the resilience against degradation and failure of Serving Peer transmission while maintaining the small overhead of push-pull periodic request mechanism. The simulation results show that this mechanism can reduce the unreasonable traffic and the probability that users do not contribute malicious behaviors. When the number of nodes is large, it can provide better delay, packet loss rate and arrival rate performance than other alliance algorithms.