An Enhanced Secure Heuristic-Stochastic Routing Arithmetic in MPLS Network

HTML  Download Download as PDF (Size: 779KB)  PP. 225-228  
DOI: 10.4236/cn.2011.34026    5,940 Downloads   9,006 Views  
Author(s)

Affiliation(s)

.

ABSTRACT

To improve routing security in MPLS network, base on the stochastic routing algorithm, we propose a proactive mechanism we call enhanced secure heuristic-stochastic routing (ESHSR) , which brings to bear Bayesian principle, explores the existence of multiple routes and forces packets to take alternate paths probabilistically. In this paper, we investigate game theoretic techniques to develop routing policies which make interception and eavesdropping maximally difficult. Through simulations, we validate our theoretical results and show how the resulting routing algorithms perform in terms of the security/delay/drop-rate, and we contrast them with the mechanism, secure stochastic routing (SSR). We observed that our scheme makes routing more secure than traditional secure stochastic routing, as they make use of the information of detecting the other side’s behavior.

Share and Cite:

Y. Zheng, "An Enhanced Secure Heuristic-Stochastic Routing Arithmetic in MPLS Network," Communications and Network, Vol. 3 No. 4, 2011, pp. 225-228. doi: 10.4236/cn.2011.34026.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.