IEICE TRANSACTIONS on Communications
A Distributed Routing Protocol for Finding Two Node-Disjoint Paths in Computer Networks
Summary :
In this paper we present a distributed routing protocol for finding two node-disjoint paths between each pair of nodes in a computer network. In the proposed protocol, each node in the network has the same procedure, which is driven by local information with respect to the network topology, such as adjacent nodes on a spanning tree in the network. Thus, the execution of the protocol can continue after changes of the network topology and load. Then, a spanning tree-based kernel construction is introduced to synchronize procedures under the distributed control of the protocol. Additionally, the routing scheme based on the protocol possesses the enhanced capabilities of alternate routes and load splitting, which cope with failures and load variations in the network. Thus, even if topology changes damage the obtained disjoint paths, the paths themselves can be updated efficiently.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E82-B No.6 pp.851-858
- Publication Date
- 1999/06/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Distributed Processing for Controlling Telecommunications Systems)
- Category
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
Kenji ISHIDA, Yoshiaki KAKUDA, Tohru KIKUNO, Kitsutaro AMANO, "A Distributed Routing Protocol for Finding Two Node-Disjoint Paths in Computer Networks" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 6, pp. 851-858, June 1999, doi: .
Abstract: In this paper we present a distributed routing protocol for finding two node-disjoint paths between each pair of nodes in a computer network. In the proposed protocol, each node in the network has the same procedure, which is driven by local information with respect to the network topology, such as adjacent nodes on a spanning tree in the network. Thus, the execution of the protocol can continue after changes of the network topology and load. Then, a spanning tree-based kernel construction is introduced to synchronize procedures under the distributed control of the protocol. Additionally, the routing scheme based on the protocol possesses the enhanced capabilities of alternate routes and load splitting, which cope with failures and load variations in the network. Thus, even if topology changes damage the obtained disjoint paths, the paths themselves can be updated efficiently.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_6_851/_p
Copy
@ARTICLE{e82-b_6_851,
author={Kenji ISHIDA, Yoshiaki KAKUDA, Tohru KIKUNO, Kitsutaro AMANO, },
journal={IEICE TRANSACTIONS on Communications},
title={A Distributed Routing Protocol for Finding Two Node-Disjoint Paths in Computer Networks},
year={1999},
volume={E82-B},
number={6},
pages={851-858},
abstract={In this paper we present a distributed routing protocol for finding two node-disjoint paths between each pair of nodes in a computer network. In the proposed protocol, each node in the network has the same procedure, which is driven by local information with respect to the network topology, such as adjacent nodes on a spanning tree in the network. Thus, the execution of the protocol can continue after changes of the network topology and load. Then, a spanning tree-based kernel construction is introduced to synchronize procedures under the distributed control of the protocol. Additionally, the routing scheme based on the protocol possesses the enhanced capabilities of alternate routes and load splitting, which cope with failures and load variations in the network. Thus, even if topology changes damage the obtained disjoint paths, the paths themselves can be updated efficiently.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - A Distributed Routing Protocol for Finding Two Node-Disjoint Paths in Computer Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 851
EP - 858
AU - Kenji ISHIDA
AU - Yoshiaki KAKUDA
AU - Tohru KIKUNO
AU - Kitsutaro AMANO
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 1999
AB - In this paper we present a distributed routing protocol for finding two node-disjoint paths between each pair of nodes in a computer network. In the proposed protocol, each node in the network has the same procedure, which is driven by local information with respect to the network topology, such as adjacent nodes on a spanning tree in the network. Thus, the execution of the protocol can continue after changes of the network topology and load. Then, a spanning tree-based kernel construction is introduced to synchronize procedures under the distributed control of the protocol. Additionally, the routing scheme based on the protocol possesses the enhanced capabilities of alternate routes and load splitting, which cope with failures and load variations in the network. Thus, even if topology changes damage the obtained disjoint paths, the paths themselves can be updated efficiently.
ER -
English
