计算机科学 ›› 2014, Vol. 41 ›› Issue (5): 78-81.doi: 10.11896/j.issn.1002-137X.2014.05.017

• 网络与通信 • 上一篇    下一篇

一种k跳回溯可信QoS重路由机制

杨蕾,王兴伟,黄敏   

  1. 东北大学信息科学与工程学院 沈阳110819;东北大学信息科学与工程学院 沈阳110819;东北大学信息科学与工程学院 沈阳110819
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家杰出青年科学基金资助

k-Hop Backtracking Trusted QoS Rerouting Mechanism

YANG Lei,WANG Xing-wei and HUANG Min   

  • Online:2018-11-14 Published:2018-11-14

摘要: 在可信网络中,由于存在链路或节点失效,需要进行重路由。考虑到用户的服务质量QoS (Quality of Ser-vice)和可信需求且为了减少算法开销,提出了一种k跳回溯可信QoS重路由机制。该机制以k作为最大回溯跳数,从失效节点(或链路)的前一节点开始逐跳进行回溯选路,同时尽可能复用路径的原有链路。构建了网络模型和用户信任评估模型,并给出了用户需求描述、满意度计算方法和路径评判标准。仿真结果表明,该机制是可行和有效的,同现有机制相比,在满足用户需求的同时,提高了重路由成功率和用户满意度,并减少了重路由时间。

关键词: 可信网络,重路由,服务质量,k跳回溯,用户信任评估

Abstract: 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.

Key words: Trusted network,Rerouting,Quality of service(QoS),k-hop backtracking,User trust evaluation

[1] Wang Fu-xiong,Xiao Zi-qian,Chen Jing-you.Research on Secu-rity of Trusted Network and Its Prospects [C]∥20102nd International Workshop on Education Technology and Computer Science.Wuhan,China,2010:256-259 (下转第96页)(上接第81页)
[2] Wang Xing-wei,Cheng Hui,Huang Min.Multi-robot Navigation Based QoS Routing in Self-organizing Networks [J].Enginee-ring Applications of Artificial Intelligence,2013,26(1):262-272
[3] Wang Xing-wei,Cheng Hui,Li Ke-qin,et al.A Cross-layer Optimization Based Integrated Routing and Grooming Algorithm for Green Multi-granularity Transport Networks [J].Journal of Parallel and Distributed Computing,2013,7(6):807-822
[4] Lee S S W,Tseng P-k,Li Kuang-yi,et al.Interface Specific Fast Failure Rerouting for Load Balanced IP Networks [C]∥2011IEEE Symposium on Computers and Communications (ISCC).Kerkyra,2011:316-319
[5] Metnani A,Jaumard B.Connection Rerouting in GRWA Net-works [C]∥201118th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN).Chapel Hill,NC,2011:1-6
[6] Xu Ming-wei,Yang Yuan,Li Qi.Selecting Shorter AlternatePaths for Tunnel-based IP Fast ReRoute in Linear Time [J].Computer Networks,2011,56(2):845-957
[7] Amdouni N,Koubàa M,Aguili T.Lightpath Rerouting Schemefor Dynamic Traffic in WDM All-Optical Networks [C]∥2012International Conference on Computer Systems and Industrial Informatics (ICCSII).Sharjah,2012:1-6
[8] Ma Wen-chao,Fang Yu-guang.Dynamic hierarchical mobilitymanagement strategy for mobile IP networks [J].IEEE Journal on Select Areas Commun,2004,22(4):664-676
[9] Li Xin,Qin Zhen,Yu Tao.Optimizing the QoS Performance of Fast Rerouting [C]∥2009Ninth International Conference on Hybrid Intelligent Systems.Shenyang,2009:313-318
[10] Tian Li-qin,Lin Chuang,Ni Yang.Behavior Value Analysis and Application in Evaluating Network Entity Behavior Trust [C]∥20102nd International Conference on Computer Engineering and Technology (ICCET).Chengdu,2010:313-318
[11] 王学军,郭亚军.基于G1法的判断矩阵的一致性分析[J].中国管理科学,2006,14(3):65-70
[12] 王兴伟,王军伟,黄敏.基于狩猎搜索的可信QoS路由算法[J].东北大学学报:自然科学版,2012,33(10):1385-1389
[13] 杜文峰,贾维嘉,王国军,等.基于k跳回溯机制的服务切换路由重建算法[J].小型微型计算机系统,2006,27(10):1850-1855

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!