Affiliation:
1. University of Tripoli, Libya
Abstract
Even though it is an essential requirement of any computer system, there is not yet a standard method to measure data security, especially when sending information over a network. However, the most common technique used to achieve the three goals of security is encryption. Three security metrics are derived from important issues of network security in this chapter. Each metric demonstrates the level of achievement in preserving one of the security goals. Routing algorithms based on these metrics are implemented to test the proposed solution. Computational effort and blocking probability are used to assess the behavior and the performance of these routing algorithms. Results show that the algorithms are able to find feasible paths between communicating parties and make reasonable savings in the computational effort needed to find an acceptable path. Consequently, higher blocking probabilities are encountered, which is the price to be paid for such savings.
Reference29 articles.
1. Alfawaz, M. M., & Woodward, M. E. (2002). QoS routing with multiple-constraints. Delson Group Inc. World Wireless Congress.
2. Alghannam, A., Woodward, M. E., & Melor, J. (2001). Security as a QoS routing issue. In Proceedings of the 2nd Annual Postgraduate Symposium (PGNet'01). Liverpool John Moores University.
3. Alkahtani, A. M., Woodward, M. E., & Al-Begain, K. (2003). The analytic hierarchy process applied to best effort QoS routing with multiple metrics: a comparative evaluation. Personal Mobile Communications Conference 5th European. Conf. Publ., 492, 539-544.
4. Almerhag, I. A., & Woodward, M. E. (2005a). Security as a Quality of Service Routing Problem. In Proceedings of the 2005 ACM conference on Emerging network experiment and technology. ACM.
5. Almerhag, I. A., & Woodward, M. E. (2005b). Quality of service routing metrics based on selected aspects of network security. Paper presented at Fourth HET-NET's05. Ilkley, UK.