基于成本效用的CAN网络搜索激励模型

An Incentive Search Model Based on Utility in CAN Network

该文在对CAN协议进行分析的基础上,提出了一种采用由上、下行效率和成本效益函数导出的实际应用层组播链路速率作为衡量标准,对原始CAN协议进行优化的分布式算法——DFO。该算法通过在公平约束下,利用节点输入效率向量评价P2P网络的整体转发压力,为节点转发搜索请求与接受搜索请求分别定义了成本和效用函数,通过优化全局成本效用降低了平均延迟和总带宽消耗。仿真结果表明:DFO算法改进了CAN中局部转发压力过高的不足,达到整体时延最低和节点压力最大平衡的目的。

Based on analyses of CAN（Content-Addressable Network） protocol, DFO （Distributed Fairly Optimal） arithmetic is proposed, which use peer＇s up/down bandwidth usage and overlay multicast link efficiency defined by utility function as standard. DFO define request/response utility function respective and evaluate global transmit overload based on peer input efficiency vector to conform a fire restrict. DFO can reduce average query latency and global bandwidth cost by optimizing global utility. Simulative results and analysis has shown that DFO improved on hot spot problem in CAN, can achieve the purpose of minimum global query latency and maximal transmit overload balance.