An Enhanced Secure Heuristic-Stochastic Routing Arithmetic in MPLS Network
- 1
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.
- V. Sbarma, B. Crane, K. Owens, et al. “Framework for MPLS-Based Recovery,” IETF RFC 3469, February 2003.
- D. O. Awduche, A. Chiu, A. Elwalid, et al. “A Framework for Internet Traffic Engineering,” Computer Physics Communications, Vol. 153, No. 3, 2003, pp. 52-58.
- I. Hussain, “Overview of MPLS Technology and Traffic Engineering Applications,” Networking and Communication, INCC204.
- R. Guerin, A. Orda and D. Williams, “QoS Routing Mechanisms and OSPF Extensions [EB/OL],” 2003, pp. 12-25.
- Z.-H. Zhao, Y.-T. Shu and L.-F. Zhang, “Flow-Level Multipath Load Balancing in MPLS Network, Communications,” IEEE International Conference, Vol. 2, 2004, pp. 1222-1226.
- F. Ricciato, U. Monaco and D. Ali, “Distributed Schemes for Diverse Path Computation in Multidomain MPLS Networks,” Communications Magazine, IEEE, Vol. 43, No. 6, June 2005, pp. 138-146. doi:10.1109/MCOM.2005.1452842
- N. M. Din and N. Fisal, “Dynamic Resource Allocation of IP Traffic for a DiffServ-MPLS Interface Using Fuzzy Logic, Communications, APCC 2003,” The 9th Asia-Pacific Conference, Vol. 1, 2003, pp. 339-343.
- M. Huerta and X. Hesselbach, “Application of the Theory of the Multicommodity for the Flows Distribution in MPLS Networks,” Local and Metropolitan Area Networks, 2004, pp. 119-124.
- Y. Zhang, V. Paxson and S. Shenker, “The Stationarity of Internet Path Properties: Routing, Loss and Throughput,” Technical Representative, ACIRI, May 2000.
- C. Hopps, “Analysis of an Equal-Cost Multi-Path Agorithmn,” RFC 2992, 2000.
- C. Villamizar, “Ospf Optimized Multipath (Ospf-Omp),” Draft-Ietf-Ospfomp-03, June 1999, p. 46.
- S. Bohacek, J. P. Hespanha, K. Obraczka, Lee Junsoo and L. Chansook, “Enhancing Security via Stochastic Routing, Computer Communications and Networks,” Proceedings of the 11th International Conference, 14-16 October 2002, pp. 58-62.
- J. P. Hespanha and S. Bohacek, “Preliminary Results in Routing Games,” Proceedings of the 2001 American Control Conference, June 2001.
- The VINT Project, a Collaboration between UC Berkeley, LBL, USC/ISI and Xerox PARC, “The ns Manual (Formerly ns Notes and Documentation),” October 2000. http://www.isi. edu/nsnam/ns/ns-documentation.html