JPS61163757A - High speed slot ring system - Google Patents

Abstract

PURPOSE:To generate no overflow in each node by providing plural display areas for showing that a communication node can receive data, in each idle channel, so that each node executes a data receivable display in a display area over plural different idle channels up to the maximum number of channels which can be received by the own node. CONSTITUTION:A transmission line 16 has a prescribed time period frame and the frame is further constituted of plural pieces of fixed length channels. At present, a node being in a state that a node is receivable from other node derives the number N of channels which have executed a receivable display already, and executes a data receivable display onto a loop-shaped transmission line. In case when the number of receivable channels by the own node has all been displayed already, nothing is executed in the present frame. In this way, each node executes a data receivable display in a display area over plural different idle channels up to the maximum number of channels which can be received by the own node.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention is directed to communication throttling.
ing), and particularly relates to a throttling method with high data transmission speed.

[Prior art and its problems]

Conventionally, in the throttling method, each communication node in the throttling system freely inserts data destined for other communication nodes into an empty channel by means of an empty/used status indication bit added to each channel, and each communication The node is
It was configured to communicate by extracting data from a channel addressed to its own node. Therefore, if the data communication speed of throttling is faster than the data reception and processing speed of a communication node, the data reception buffer of that communication node may overflow when data destined for a specific communication node continues. However, there was a drawback that overflow data could not be received correctly.

On the other hand, when the data reception and processing speed of the communication node and the data transmission speed of communication throttling are set equal, the throughput of communication throttling becomes small and the capability of the communication throttling method cannot be fully utilized. There were drawbacks.

Therefore, conventionally, Idle is used as the mode for each channel.
(this channel is not used), Busy (data transfer in progress), and Re5erve (displaying the node number that can receive data) modes.
The data displayed in a channel in e-mode is not transfer data, but is defined as a node number that can receive one channel's worth of data using that channel, and the sending node uses this node number and the currently transmitted data. There is a method of changing this channel to Busy mode and sending data only when the data matches the destination node number to which the data is being sent.

According to this method, since the receiving node only displays the Re5erve indication for the number of channels that can be received, it is possible to prevent data from arriving in excess of the receiving capacity of the node and overflowing the receiving buffer. However, in this method, if there is a node that can receive a large amount of data, that node will occupy many idle channels on one frame as Re5erve channels, and as a result, there will be fewer idle channels on the frame ( ! node was unable to secure a sufficient Re5erve channel, and a situation occurred in which sufficient data transfer was not possible even though the node was able to receive data.

[Purpose of the invention]

An object of the present invention is to provide a plurality of display areas in each vacant channel to indicate that a communication node is capable of receiving data;
Each node solves the above drawback by displaying data receivable in the display area across multiple different free channels up to the maximum number of channels that the node can receive. The object of the present invention is to provide a high-speed throttling method that prevents overflow from occurring at nodes.

[Structure of the invention]

The present invention provides a high-speed throttling method in which a plurality of communication nodes are connected via a high-speed transmission path having frames of a fixed time period, and each frame has a plurality of fixed-length channels as a frame format on the high-speed transmission path. A plurality of display areas are provided in an empty channel to indicate that a specific communication node can receive data using the empty channel, and each node can display multiple different display areas up to the maximum number of channels that it can receive. The present invention is characterized in that a data receivable indication is displayed in the display area over vacant channels.

Note that the maximum number of channels that the own node can receive (1) is the maximum number of channels that the own node can store receive data in the receive buffer, or the maximum number of channels that the own node can receive data from the receive buffer within one frame time. It means the maximum number of channels that can be retrieved and processed.

〔Example〕

Next, embodiments of the present invention will be described with reference to the drawings.

FIG. 1 shows a ring configuration consisting of a plurality of communication nodes to, ii, 12, 13, 14, 15 and a transmission line 16 connecting these communication nodes for detailed explanation of the present invention. Communication node 10.11.12,1 in FIG.
3.14 and 15 each represent a large number of subscriber terminals 17.1
By accommodating 8°19, transmitting and receiving call signals coming from those subscriber terminals between arbitrary communication nodes, and then sending those call signals again to arbitrary subscriber terminals, a large number of calls can be made as a whole. (or calls) arbitrarily and simultaneously. As shown in FIG. 2, the transmission line 16 has a frame with a fixed time period (for example, 125 μs), and each frame is further composed of a plurality of fixed-length channels. One channel is further composed of a plurality of fields, such as channel state information CI, destination node number DA, originating node number SA, transfer information I, and frame check sequence FC5. The channel state information CI is the state of each channel, that is, the idle state Idle.

Busy during data transfer (hereinafter referred to as BSY), Receivable node indication fiReserve (hereinafter referred to as R3V)
Indicates each state.

When the channel is in the Idle state, the destination node number DA
, originating node number SA, and forwarding information ■ have no meaning. In the BSY state, the DA field indicates the destination node number, the SA field indicates the originating node number,
■The field indicates the data being transferred. When the channel state information CI is R3v, the channel has the field format shown in FIG. All fields other than CI and Fe2 are display areas in which the destination node number DA can be displayed. The number displayed therein indicates the node number that is in a state where it is possible to receive data for one channel from the loop-shaped transmission path using that channel.

Next, using the flowcharts shown in FIGS. 4 and 5, we will explain the procedure by which a node capable of receiving data enters its own node number in the field of DA shown in FIG. 3 to display data receivable. .

A node that has free space in its receive buffer and is currently in a state where it can receive data from another node will use the procedure shown in Figure 4 to display how many channels it is currently capable of receiving. Open the dolphin. When this number of channels is N, in order to find N, first set it to N-0 as an initial value at the beginning of the frame (step 2). Next, check the channel status information CI (Step ■)
, if it is not R3V, check the next channel (jump to step ■). When CI=R3VO, check each DA field in that channel and check whether the own node number is already displayed therein (step ■).
, if there is no own node number, jump to step ■. When the own node number exists, 1 is added to N (step ■). 1
When the channel check is completed, proceed to the next channel and check whether all channels of one frame have been completed (step ■).

By the above procedure, the number N of channels for which the receivable indication has already been made is determined, and then by the procedure shown in FIG. 5, the data receivable indication is made on the loop-shaped transmission path.

The number of free channels in the data reception buffer at that time is M
, M and N are compared (step ■).

When M=N, that is, when all the channels that can be received by the own node are already displayed, no more receivable indications should be made, so do nothing in the current frame (jump to end) . When M>N, a new receivable indication is added according to the following procedure. Check the channel state information CI (Step ■). When CI = Idle, the destination node number DA in the display area shown in Figure 3,
Display the own node number at the position (step ■), rewrite CI to R3V (step ■), and proceed to the next channel (step ■). CI≠Idle in step ■
If so, please check whether CI = R3V or not.
), if CI#R3V, proceed to the next channel (step ■). If CI=R3■, each destination node number DA shown in FIG. 3 is checked to see if the own node number is already displayed (step ■). If the own node number is displayed, proceed to the next channel without doing anything for that channel (step ■
), if your own node number is not displayed, check whether there is space in the display area or not.
), if all DA fields in Figure 3 are in use by other nodes, proceed to the next channel without doing anything (
(Jump to step ■), if there is an empty display area,
Display the own node number there (step ■), and add 1 to N (step ■). After the addition, the number N of channels that have already been indicated as receivable is compared with the number M of free channels in the data reception buffer, and when M=N is reached, the process ends. When MAN, check step (2) to see if processing has been completed for all channels of one frame; if not, jump to step (2) and continue processing the next channel. Through the above procedure, each node can display data receivable in the display area across a plurality of different vacant channels up to the maximum number of channels that the node can receive.

Next, the procedure for transmitting data from the communication node to the loop will be explained using the flowchart shown in FIG. A node that has transmission data checks the channel state information CI and checks whether CI=R5V (step
). If CI≠R3V, do nothing and jump to step ■ to check the next channel. If CI=R3V, each DA field shown in FIG. 3 is checked to see if the destination node number to which the own node is about to transmit is displayed therein (step 2). If the destination node number is not displayed, do nothing and jump to step ■. If the destination node number is displayed, the data is sent to the first field of this channel (step (2)), and the channel status information CI is rewritten to BSY (step (2)). Thereafter, check whether all transmission data has been transmitted (step (2)); if not, jump to step (2) and continue the next data transmission process.

Exit when transmission is complete.

The above explanation is about the case where the own node displays the receivable status for up to the maximum number of channels that can store received data in the receive buffer, but it is possible to take out the received data from the receive buffer and process it within one frame time. If the number of channels is guaranteed, it is also possible to display that up to this number of channels can be received even if the reception buffer is not empty. Furthermore, it is also possible to improve throughput by combining both methods.

Next, a second embodiment of the present invention will be described.

In the second embodiment, when the channel state information CI is R5V, the channel has the field format shown in FIG. Other fields except CI and Fe2 are each composed of 1-bit Ro, R,, R2...Rn (n is the number of nodes), and Ri=1 (0≦i≦n) indicates the i-th node. indicates that data can be received, and R1-0(
0≦i≦n) is a display area indicating that the i-th node cannot receive data. When the number of nodes is n,
Since the field occupied by RO, R1...Rn requires n bits, in this embodiment, the length of one channel is CI.
This is applicable when the remaining field portion excluding Fe2 and Fe2 has n bits or more. The data receivable display procedure and data transmission procedure in this embodiment are almost the same as those in the first embodiment, and if the operation of the node number in the first embodiment is replaced with the operation on the bit corresponding to the node number. good.

Note that Id in the description of the first and second embodiments above
The le channel can also be regarded as an empty Re5erve channel, and there is no need to distinguish between the two. However, by distinguishing between the two, it becomes possible to perform the processing shown in FIG. 4.5.6 more quickly.

〔Effect of the invention〕

As explained above, according to the present invention, a plurality of display areas indicating that the communication node is ready to receive data is provided in each free channel, and each node can display up to the maximum number of channels that it can currently receive. By displaying data receivable status across multiple different free channels, it is possible to make the most of the node's reception capacity, while also preventing data from arriving in excess of the node's reception capacity, thereby preventing the reception buffer from overflowing. This effect can be obtained.

Therefore, by increasing the number of R3V nodes that can be displayed on one frame by allowing multiple R3V displays for each channel, even when there are nodes that can receive a large amount of data, many IDs on one frame can be displayed.
The conventional drawback is that the idle channel is monopolized by that node as R3V, and even though there are other nodes that can receive data, sufficient data transfer is not possible because there are not enough idle channels on the frame. can be solved.

[Brief explanation of the drawing]

FIG. 1 is a diagram showing the structure of a loop-shaped transmission line according to an embodiment of the present invention, FIG. 2 is a diagram showing a frame structure of a first embodiment of the present invention, and FIG. A diagram showing the channel configuration during receivable display in the first embodiment. FIG. 4 shows how many channels the own node is currently displaying receivable on the loop in the first embodiment of the present invention. FIG. 5 is a flowchart showing a procedure for indicating that data can be received on a loop-shaped transmission path in the first embodiment of the present invention. FIG. Flowchart showing a procedure for transmitting data on a loop-shaped transmission path in an embodiment. FIG. 7 is a diagram showing a data receivable display channel configuration in a second embodiment of the present invention. 10.11, 12.13, 14.15... Communication node 16... Transmission path 17.18.19, Subscriber terminal CI... Channel status information DA...・・・
...Destination node number SA...... Originating node number ■... Transfer information Fe2... Frame check sequence DAo-DAn... Receivable node number R□- Rn...Receivable information CI Ninayan 81 and 77ak small stomach! , DAσ~DAT
+: Destination Node 1 FC5: Frame Neck Sequence C ■: +Yannel 4'' 3 horizontal city L Ra-R Ga: Day 7 Zubi wealth;S So;Ding confirmation FC5
:Frame 100-300cm Figure 7 Figure 4 Figure 5

Claims (1)

[Claims] (1) In a high-speed throttling method in which multiple communication nodes are connected via a high-speed transmission path having frames with a fixed time period, each free slot is A plurality of display areas are provided within the channel to indicate that a specific communication node is able to receive data using the available channel, and each node displays multiple different display areas of the free channel up to the maximum number of channels that it can receive. A high-speed throttling method characterized in that a data receivable indication is displayed in the display area across channels.