For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Extended Algorithm for Calculating Routes with Include Route Constraint in IP Networks
Rie HAYASHI Eiji OKI Kohei SHIOMOTO
IEICE TRANSACTIONS on Communications
Publication Date: 2007/12/01
Online ISSN: 1745-1345
Print ISSN: 0916-8516
Type of Manuscript: LETTER
include route, algorithm, cost,
Full Text: PDF(1.1MB)
>>Buy this Article
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.