Fallback Based k-Hop Backtracking Trustworthy Rerouting Mechanism

Abstract:

When some links or nodes on the path break down, a rerouting path should be found in trustworthy network. In this paper, a fallback based k-hop backtracking trustworthy QoS (Quality of Service) rerouting mechanism is proposed. First,the network model and user trust evaluation model are constructed. Then the description of users requirements, the calculation methods of users satisfaction and the criterion of path judgments are presented. Considering users QoS requirements, trustworthy requirements and decrease of the algorithm cost, fallback is used for backtracking rerouting at the previous node of the failure node (or link) in the proposed mechanism. It reuses original links of the path as much as possible to reduce the time of rerouting. The simulation results show that the proposed mechanism is both feasible and effective. In contrast to existing mechanisms, both the rerouting success rate and user satisfaction degree are increased and the rerouting time is reduced under uses requirements.

• Periodical: Applied Mechanics and Materials (Volumes 427-429)
• Pages: 2229-2236
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.427-429.2229
• Online since: September 2013
• Authors: Lei Yang*, Xing Wei Wang, Min Huang
• Keywords: Fallback, K-Hop Backtracking, Quality of Service (QoS), Rerouting, Trustworthy Network, User Trust Evaluation

References

[1] Lin Chuang, Peng Xue-hai. Research on Trustworthy Networks. Chinese Journal of Computers, 2005, 28(5), 751-758.

[2] Wang Xing-wei, Cheng Hui, Huang Min. Multi-robot Navigation Based QoS Routing in Self-organizing Networks. Engineering Applications of Artificial Intelligence, 2013, 26(1): 262-272.

DOI: 10.1016/j.engappai.2012.01.008

[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. Journal of Parallel and Distributed Computing, 2013, 7(6): 807-822.

DOI: 10.1016/j.jpdc.2013.02.010

[4] Ammar Metnani, Brigitte Jaumard. Connection Rerouting in GRWA Networks. 2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN), Chapel Hill, NC, 2011: 1-6.

DOI: 10.1109/lanman.2011.6076925

[5] Naama Amdouni, Mohamed Koubàa, Taoufik Aguili. Lightpath Rerouting Scheme for Dynamic Traffic in WDM All-Optical Networks. 2012 International Conference on Computer Systems and Industrial Informatics (ICCSII), Sharjah, 2012: 1-6.

DOI: 10.1109/iccsii.2012.6454324

[6] Li Xin, Qin Zhen, Yu Tao. Optimizing the QoS Performance of Fast Rerouting. 2009 Ninth International Conference on Hybrid Intelligent Systems, Shenyang, 2009: 313-318.

DOI: 10.1109/his.2009.277

[7] Hu Hong-chao, Guo Yun-fei, Yi Peng, et al. Achieve Load Balancing with A Dynamic Re-routing CICQ Switching Scheme. Scientia Sinica Informationis, 2011, 41(12): 1450-1462.

DOI: 10.1007/s11432-011-4286-8

[8] Whay C. Lee, Michael G. Hluchyi, Pierre A. Humblet. Routing Subject to Quality of Service Constraints in Integrated Communication Networks. IEEE Network, 1995, 9(4): 46-55.

DOI: 10.1109/65.397043

[9] Tian Li-qin, Lin Chuang, Ni Yang. Behavior Value Analysis and Application in Evaluating Network Entity Behavior Trust [A]. ICCET2010, Chengdu, China, 313-318.

DOI: 10.1109/iccet.2010.5486133

[10] Wang Xue-jun, Guo Ya-jun. Analyzing the Consistency of Comparison Matrix Based on G1 Method. Chinese Journal of Management Science, 2006, 14(3): 65-70.

[11] Wang Xing-wei, Wang Jun-wei, Huang Min. Hunting Search Based Trustworthy QoS Routing Algorithm. Journal of Northeastern University (Natural Science), 2012，33(10): 1385-1389.

[12] Du Wen-feng, Jia Wei-jia, Wang Guo-jun, et al. k-Hop Backtracking Based Rerouting Algorithm for Handoff Processing. Journal of Chinese Computer System, 2006, 27(10): 1850-1855.