检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东北大学信息科学与工程学院,沈阳110819
出 处:《计算机科学》2014年第5期78-81,96,共5页Computer Science
基 金:国家杰出青年科学基金资助项目(61225012);国家自然科学基金资助项目(61070162;71071028;70931001);高等学校博士学科点专项科研基金优先发展领域资助课题(20120042130003);高等学校博士学科点专项科研基金资助课题(20100042110025;20110042110024);工信部物联网发展专项资金资助项目;中央高校基本科研业务费专项资金资助项目(N110204003;N120104001)资助
摘 要:在可信网络中,由于存在链路或节点失效,需要进行重路由。考虑到用户的服务质量QoS(Quality of Service)和可信需求且为了减少算法开销,提出了一种k跳回溯可信QoS重路由机制。该机制以k作为最大回溯跳数,从失效节点(或链路)的前一节点开始逐跳进行回溯选路,同时尽可能复用路径的原有链路。构建了网络模型和用户信任评估模型,并给出了用户需求描述、满意度计算方法和路径评判标准。仿真结果表明,该机制是可行和有效的,同现有机制相比,在满足用户需求的同时,提高了重路由成功率和用户满意度,并减少了重路由时间。Because of link or node failures,rerouting is necessary in trusted network.Considering users' QoS (Quality of Service) requirements,trusted requirements and decrease of the algorithm cost,a k-hop backtracking trusted QoS rerouting mechanism was proposed.The mechanism backtracks hop by hop from the previous node of the failure node (or link) with k as the maximum hop count for the rerouting,and reuses original links of the path as much as possible.The network model and user trust evaluation model were constructed.Besides,the description of users' requirements,the calculation methods of users' satisfaction and the criterion of path judgments were given.The simulation results show that the proposed mechanism is both feasible and effective.In contrast to existing mechanisms,the rerouting success rate and user satisfaction degree are higher and the rerouting time is shorter with users' demands satisfied.
关 键 词:可信网络 重路由 服务质量 k跳回溯 用户信任评估
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249