检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]解放军理工大学指挥自动化学院,江苏南京210007
出 处:《软件学报》2013年第1期153-163,共11页Journal of Software
基 金:国家自然科学基金(61070173;61103225);国家重点基础研究发展计划(973)(2012CB315806);江苏省自然科学基金(BK2010133)
摘 要:为了减少容延网络的资源开销,研究者提出了单副本转发路由算法.研究发现,这些转发算法导致节点流量负载极度不均衡,使得那些连接度较大的节点产生了拥塞.针对该问题,提出了一种基于接收阈值的拥塞控制机制,可以有效降低节点拥塞.该机制使每个DTN(delay tolerant network)节点根据自身的拥塞状况动态调整自己的拥塞控制机制,而且该机制独立于节点所运行的转发路由算法,不影响路由算法对中继节点的选择,具有很好的普适性.为了验证所提出机制的有效性,将该拥塞控制机制与现有的SimBet路由算法加以结合,提出了具有拥塞控制功能的SimBetCC算法.实验结果表明,SimBetCC算法在取得很好的拥塞控制的前提下,其递交率和递交时延等性能方面均优于具有拥塞控制功能的FairRoute路由算法.In order to decrease the resource cost in delay tolerant networks, single-copy forwarding protocols have been proposed by researchers. However, recent research has pointed out that single-copy forwarding protocols lead to great unfairness of the nodes' traffic load and make the highly connected nodes suffer congestion. In order to bridge this gap, a congestion control mechanism based on accepting the threshold is put forward in this paper, which makes each DTN node dynamically adjust to its accepting threshold and accordingly to its congestion state. Moreover, the mechanism can be widely adopted, since it is independent of the forwarding protocols and does not affect the choice of the relay nodes made by the forwarding protocol. In order to validate the proposed mechanism, an algorithm named SimBetCC is proposed, which incorporates the congestion control mechanism with existing SimBet protocol. Experimental results show that SimBetCC can cope with congestion and also outperforms FairRoute with congestion control in many aspects, e.g., the message delivery ratio, the delivery delay.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.42