Precondition of a Routing Algorithm Dealing with Multiple Security Metrics

Katsuichi NAKAMURA
Yoshiaki HORI

IEICE TRANSACTIONS on Communications   Vol.E94-B    No.6    pp.1625-1629
Publication Date: 2011/06/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E94.B.1625
Print ISSN: 0916-8516
Type of Manuscript: Special Section LETTER (Special Section on New Generation Mobile and Sensor Networking and Future Networks)
routing,  security metric,  policy routing,  

Full Text: PDF>>
Buy this Article

In routing, we usually use OSPF with Dijkstra or RIP with Bellman-Ford, but they can only treat single metric routing problem. With multiple metrics, we would use the weighted average of the metrics or techniques from operations research, but they are not suitable for routing because they lack validity and simplicity. Here, we propose a routing algorithm to deal with the three security metrics proposed by I. A. Almerhag and M. E. Woodward, and show an example routing policy. Besides, we make a study on the constraints of the metrics and the routing policies, and come to the precondition of the proposed routing algorithm.