JPH0487433A - Communication network control system - Google Patents

Abstract

PURPOSE:To enhance the operation rate of nodes in the network by adding the priority to channels of each node and selecting the channel of a data sending-out destination. CONSTITUTION:Each node has plural (four) channels to which the priority is added, and for instance, the node 10 has four channels 11a-11d in order of higher priority. In such a communication network, in accordance with the priority added to the channels of each node, the channel for sending out data in the next time is selected, and also, a sendingout destination of the data is determined by information before and after one time point which each node has, and an effective data transmitting path is selected.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to a communication network control system that increases the operating rate of nodes within the network.

[Conventional technology]

FIG. 3 schematically shows the configuration of this type of conventional communication network control system, and shows a ring type network configuration called a token ring. In the figure, 1 is the source node, 2 and 3.4 are relay station nodes, 5 is the destination node, and 6.7 is the two transmission media connecting these nodes 1 to 5. be.

Next, the operation will be explained.

In a communication network such as the one shown in F, normally packets called tokens are sent around one transmission medium 6 in a fixed direction. Then, the sender who has acquired the token obtains the transmission right, adds the source address and destination address to the data, and sends the data to the transmission medium 6F.

That is, the transmission source node 1 grabs the token, acquires the transmission right, and transmits the data to the transmission medium 6. This data is subjected to an address check (address conveyor check) at the nodes 2 to 4 of the relay station on the transmission medium 6.

If the address matches the local address, the data is taken into the destination node 5 and the token is released.

Note that the transmission medium 7 is used for folding back when a part of the transmission medium 6 is cut off for some reason.

[Problem to be solved by the invention]

Conventional communication network control systems are configured as described above, so that only the node that has acquired the token can obtain the transmission right, and when a node other than the node that is transmitting and receiving data transmits data. It is necessary to wait for the token to be released, and since the token only rotates in one direction, it may take some time depending on the sending and receiving location.
There was a problem with the node operating rate being low.

This invention was made to solve these problems, and it allows data to be transmitted from a node other than the two nodes that are transmitting and receiving data, and also allows each node to transmit data using the shortest route. The purpose of the present invention is to provide a communication network control method that increases the operating rate of nodes within the network.

[Means to solve the problem]

The communication network control method according to the present invention is configured such that a priority is assigned to each channel of each node connected by a transmission medium, and a channel for transmitting data next time is selected according to the priority. .

[Effect]

In the communication network control system of the present invention, a priority is added to each node's channel, and the next channel for transmitting data is selected according to the priority.

〔Example〕

FIG. 1 is a block diagram showing an embodiment of the present invention. In the figure, 10, 12, 14, 16.18 are nodes connected by transmission media, and node 10 is the transmission source (n-f
, n-1) node, and node 12 becomes a relay station (n, n
-1) Node, node 14 becomes a relay station (n+1.n
-1) Node, node 16 becomes a relay station (fi+t,
n) node, node 18 becomes the destination (fi+1゜n
+1) It is a node.

Each of the above nodes has a plurality of (four) channels with assigned priorities; for example, node 10 has four channels tla to li in order of priority A.
A with d. Similarly, node 12 has 13a to 13
Node 14 has channels 15a to 15d, and channels 16 & 17a to 17d, and node 18 also has channels 19a to 19d. Furthermore, each node stores information on the state of each channel before and after a point in time.

In the above communication network, the next channel to send data is selected according to the priority attached to the channel of each node, and the data is also determined based on the information before and after the point in time that each node has. A destination is determined and a valid data transmission route is selected. for example,
(n, n) node is (n, n-1), (n-1゜n),
(n+1.n) The state of each channel before and after a point in time (n, n+1) is held for each channel as follows.

X (n, n-1) = (0° X (n-1, n) = (0° X (n+1.n) = (0° X (n, n+1) = (0° (However, 0: No communication state.

vinegar. ) 00.1) 0, O, O) 1, o, 0) 1, 1. O) 1: When transmitting data from the node 10 to the node 18 without changing the communication state, first, the channels 11a to lid of the node 10 are
, data is transmitted from a high priority channel in a non-communication state. In this case, when channel lla is in communication state in node 10, data is transmitted from channel llb. In addition, each channel lla~ of the node 10
If all channels 11d are in a non-communication state, channel ll
Data will be sent from a. However, since each node maintains state information before and after a point in time, for example, in node 12 of the relay station, channels 13a and 13
If it is known in advance that channels b and 13d are being used, the source node 10 changes to transmit data from the corresponding channel lie.

In this way, the selection of the data transmission destination at each node is determined based on the priority of each channel and the state of the node before or after a point in time. If all channels of each node are in a non-communication state, data transmission from the source node 10 to the destination node 18 is performed via the nodes 12, 14, and 16 of each relay station. .

FIG. 2 shows the flow of the above-mentioned destination determining operation.

When data is input (step s1), a destination channel is determined based on the above-mentioned channel priority order (step S2). Next, a destination is selected based on the state of the data destination node (step S3). If the destination is in a communication state, the process returns to step S2, but if the destination is in a non-communication state, data transmission is started (step S4).
.

By controlling in this way, it is possible to transmit from nodes other than the two nodes that are transmitting and receiving, and
Each node can transmit data through the shortest route, increasing the availability of nodes within the network. In addition, since each node maintains the state before and after a point in time, the destination of data can be determined based on the state information, and an effective transmission route is determined.

In addition, in the above embodiment, the case where the state of the data sending destination node is all three channels or the communication state has been explained.
If the data destination node is in a one-channel communication state and the priority of that channel is low (3 or 4), the data source channel may be changed.

Furthermore, although each node has been described as being divided into four channels, it may be expanded to include n channels (n=3 or more).

Furthermore, although the above embodiment has been described with fixed priorities, it is also possible to automatically prioritize each channel based on the relationship between the sending source node and the sending destination node. In this case, it is necessary to also add data regarding the priority to the transmitted data. For example, in Figure 1, the node! 8 as the source and node 10 as the destination node, the channels 19c, 19d, 19a, and 19b may be prioritized in this order.

〔Effect of the invention〕

As described above, according to the present invention, since the channel of the data transmission destination is selected by adding priorities to the channels of each node, data can also be transmitted from nodes other than the two nodes transmitting and receiving. In addition, each node can transmit data using the shortest route, which has the effect of increasing the operating rate of the nodes in the network.

[Brief explanation of drawings]

FIG. 1 is a block diagram showing an embodiment of the present invention, FIG. 2 is a flowchart showing the operation of determining the data destination of the node in FIG. 1, and FIG. 3 is a block diagram showing a conventional example. 10... Nodes 12 and 14 that serve as transmission sources. 16-----Node 1 serving as a relay station
8---One destination node

Claims (1)

[Claims] A communication network control method characterized by assigning a priority to each channel of each node connected by a transmission medium, and selecting a channel for transmitting data next time according to the priority.