A Study of Parallel Date Transmission in Double-Loop Computer Networks with Multi-Node Failures

Hiroshi MASUYAMA

A Study of Parallel Date Transmission in Double-Loop Computer Networks with Multi-Node Failures

Hiroshi MASUYAMA

Full Text Views

0

Share
Cite this

Summary :

Reliability of single-loop networks can be improved using double loops: forward loops advancing to the neighboring node and backward loops skipping by a certain distance. In this type of double loop networks, when some nodes break down, there exist possibilities that a message can not be transmitted to some nodes and many messages concentrate on some specific nodes to take a roundabout route. Then, the delay may happen in date transmission. These phenomena depend on the situation of faulty nodes. This paper, first, presents a routing algorithm to find a route where a message can be transmitted to the destination node when a multi-node failure arises. Next, the upper bound of transmission steps required to transmit n packets in parallel from respective starting nodes to respective destination nodes is investigated.

Publication: IEICE TRANSACTIONS on transactions Vol.E71-E No.4 pp.394-405

Publication Date: 1988/04/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Reliability and Mentenability

Authors

Hiroshi MASUYAMA

Keyword

Cite this

Copy

Hiroshi MASUYAMA, "A Study of Parallel Date Transmission in Double-Loop Computer Networks with Multi-Node Failures" in IEICE TRANSACTIONS on transactions, vol. E71-E, no. 4, pp. 394-405, April 1988, doi: .
Abstract: Reliability of single-loop networks can be improved using double loops: forward loops advancing to the neighboring node and backward loops skipping by a certain distance. In this type of double loop networks, when some nodes break down, there exist possibilities that a message can not be transmitted to some nodes and many messages concentrate on some specific nodes to take a roundabout route. Then, the delay may happen in date transmission. These phenomena depend on the situation of faulty nodes. This paper, first, presents a routing algorithm to find a route where a message can be transmitted to the destination node when a multi-node failure arises. Next, the upper bound of transmission steps required to transmit n packets in parallel from respective starting nodes to respective destination nodes is investigated.
URL: https://globals.ieice.org/en_transactions/transactions/10.1587/e71-e_4_394/_p

Copy

@ARTICLE{e71-e_4_394,
author={Hiroshi MASUYAMA, },
journal={IEICE TRANSACTIONS on transactions},
title={A Study of Parallel Date Transmission in Double-Loop Computer Networks with Multi-Node Failures},
year={1988},
volume={E71-E},
number={4},
pages={394-405},
abstract={Reliability of single-loop networks can be improved using double loops: forward loops advancing to the neighboring node and backward loops skipping by a certain distance. In this type of double loop networks, when some nodes break down, there exist possibilities that a message can not be transmitted to some nodes and many messages concentrate on some specific nodes to take a roundabout route. Then, the delay may happen in date transmission. These phenomena depend on the situation of faulty nodes. This paper, first, presents a routing algorithm to find a route where a message can be transmitted to the destination node when a multi-node failure arises. Next, the upper bound of transmission steps required to transmit n packets in parallel from respective starting nodes to respective destination nodes is investigated.},
keywords={},
doi={},
ISSN={},
month={April},}

Copy

TY - JOUR
TI - A Study of Parallel Date Transmission in Double-Loop Computer Networks with Multi-Node Failures
T2 - IEICE TRANSACTIONS on transactions
SP - 394
EP - 405
AU - Hiroshi MASUYAMA
PY - 1988
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E71-E
IS - 4
JA - IEICE TRANSACTIONS on transactions
Y1 - April 1988
AB - Reliability of single-loop networks can be improved using double loops: forward loops advancing to the neighboring node and backward loops skipping by a certain distance. In this type of double loop networks, when some nodes break down, there exist possibilities that a message can not be transmitted to some nodes and many messages concentrate on some specific nodes to take a roundabout route. Then, the delay may happen in date transmission. These phenomena depend on the situation of faulty nodes. This paper, first, presents a routing algorithm to find a route where a message can be transmitted to the destination node when a multi-node failure arises. Next, the upper bound of transmission steps required to transmit n packets in parallel from respective starting nodes to respective destination nodes is investigated.
ER -