论文部分内容阅读
为了激励自私网络中的中间节点参与业务的转发,实现带宽和路由的联合分配,首先利用拍卖理论分析了自私网络中节点的理性行为,并将带宽与路由联合分配建模为拍卖模型.然后进行机制设计,并对其最优性和策略一致性进行理论分析.最后针对此模型提出了2种带宽与路由联合分配方案,一个较复杂,基于凸优化的分配方案;另一个计算速度较快,基于最小代价路径(LCP)的分配方案.理论分析证明,本文机制解决了节点如何参与合作的问题,仿真结果表明,本文机制能有效促进节点参与合作.
In order to motivate the intermediate nodes in selfish networks to participate in the forwarding of services and realize the joint allocation of bandwidth and routing, the rational behavior of nodes in selfish networks is first analyzed using auction theory, and the joint allocation of bandwidth and routing is modeled as an auction model. Mechanism design and theoretical analysis of its optimality and strategy consistency.Finally, two kinds of bandwidth and routing joint allocation schemes are proposed for this model, a more complex and convex optimization based allocation scheme, the other one is faster in computation speed, Based on the LCP, the theoretical analysis proves that the mechanism of this paper solves the problem of how the nodes participate in the cooperation, and the simulation results show that this mechanism can effectively promote the participation and cooperation of the nodes.