Extended Algorithm for Calculating Routes with Include Route Constraint in IP Networks

Rie HAYASHI  Eiji OKI  Kohei SHIOMOTO  

Publication
IEICE TRANSACTIONS on Communications   Vol.E90-B   No.12   pp.3677-3679
Publication Date: 2007/12/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e90-b.12.3677
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Network
Keyword: 
include route,  algorithm,  cost,  

Full Text: PDF(1.1MB)>>
Buy this Article




Summary: 
This paper proposes an algorithm for calculating routes that considers the include route constraint while minimizing cost. A route with include route constraint has to traverse a group of assigned nodes. The trouble when calculating a route that satisfies an include route constraint is that routes set in different sections may traverse the same link. In order to prevent this violation (overlap), we introduce an alternate route selection policy. Numerical results show that the probability of finding appropriate routes (no overlap) is more than 95% with the proposed algorithm while only 35% with the conventional algorithm.