A distributed routing protocol for finding two node-disjoint paths in computer networks

IEICE Transactions on Communications

Volumn E82-B, Issue 6, 1999, Pages 851-858

  Ishida, Kenji ^a   Kakuda, Yoshiaki ^a   Kikuno, Tohru ^b   Amano, Kitsutaro ^a  

^a HIROSHIMA CITY UNIVERSITY   (Japan)

^b OSAKA UNIVERSITY   (Japan)

Author keywords

Kernel construction; Node disjoint paths; Routing protocol

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); ELECTRIC NETWORK TOPOLOGY; NETWORK PROTOCOLS; TREES (MATHEMATICS);

DISTRIBUTED ROUTING PROTOCOL; KERNEL CONSTRUCTION; NODE-DISJOINT PATHS;

COMPUTER NETWORKS;

EID: 0032653275     PISSN: 09168516     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. R. Attar, "A distributed adaptive multi-path routing-consistent and conflicting decision making," Proc. 5th Berkeley Workshop on Distributed Data Management & Computer Networks, pp.217-236, 1981.
2. K.M. Chandy and J. Misra, "Distributed computation on graphs: Shortest path algorithms," Commun. ACM, vol.25, no.11, pp.833-837, 1982.
3. C. Dovrolis and P. Ramanathan, "Resource aggregation for fault tolerance in Integrated Service Networks," Computer Communication Review, vol.28, no.2, pp.39-53, 1998.
4. K. Ishida, Y. Kakuda, and T. Kikuno, "A routing protocol for finding two node-disjoint paths in computer networks," Proc. 1995 International Conference on Network Protocols (ICNP'95), pp.340-347, 1995.
5. J.M. Jaffe, "Distributed multi-destination routing: The constraints of local information," IBM Research Report RC9247, 1982.
6. F.H. Moss and P.M. Merlin, "Some theoretical results in multiple path destination in networks," Networks, vol.11, pp.401-411, 1981.
7. E. Oki and N. Yamanaka, "A recursive matrix-calculation method for disjoint path search with hop link number constraints," IEICE Trans, Commun., vol.E78-B, no.5, pp.769-774, May 1995.
8. E. Oki, N. Yamanaka, and F. Pitcho, "Multiple-availability-level ATM network architecture," IEEE Commun. Mag., vol.33, no.9, pp.80-88, 1995.
9. A. Segall, "Distributed network protocols," IEEE Trans. Inf. Theory, vol.IT-29, no.1, pp.23-35, 1983.
10. J. Suurballe, "Disjoint paths in a network," Networks, vol.4, pp.125-145, 1974.
11. J. Suurballe and R.E. Tarjan, "A quick method for finding shortest pairs of disjoint paths," Networks, vol.14, pp.325-336, 1984.
12. M.R. Wilson, "The quantitative impact of survivable network architectures on service availability," IEEE Commun. Mag., vol.36, no.5, pp.122-126, 1998.