Extended Algorithm for Calculating Routes with Include Route Constraint in IP Networks
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E90-B No.12 pp.3677-3679
- Publication Date
- 2007/12/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e90-b.12.3677
- Type of Manuscript
- LETTER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Rie HAYASHI, Eiji OKI, Kohei SHIOMOTO, "Extended Algorithm for Calculating Routes with Include Route Constraint in IP Networks" in IEICE TRANSACTIONS on Communications,
vol. E90-B, no. 12, pp. 3677-3679, December 2007, doi: 10.1093/ietcom/e90-b.12.3677.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.12.3677/_p
Copy
@ARTICLE{e90-b_12_3677,
author={Rie HAYASHI, Eiji OKI, Kohei SHIOMOTO, },
journal={IEICE TRANSACTIONS on Communications},
title={Extended Algorithm for Calculating Routes with Include Route Constraint in IP Networks},
year={2007},
volume={E90-B},
number={12},
pages={3677-3679},
abstract={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.},
keywords={},
doi={10.1093/ietcom/e90-b.12.3677},
ISSN={1745-1345},
month={December},}
Copy
TY - JOUR
TI - Extended Algorithm for Calculating Routes with Include Route Constraint in IP Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3677
EP - 3679
AU - Rie HAYASHI
AU - Eiji OKI
AU - Kohei SHIOMOTO
PY - 2007
DO - 10.1093/ietcom/e90-b.12.3677
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2007
AB - 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.
ER -
English
