JPS59139745A - Repeated call control system of message - Google Patents

Abstract

PURPOSE:To simplify the control and to reduce the memory capacity for the titled control system by connecting a transmission request at which the transmission has failed to the tail end of a queue to which the factor of the transmission failure belongs as a repeated call request, and transmitting the head queue repeated call request every time the waiting time reaches the highest- order queue. CONSTITUTION:A transmission failure is detected at a transmission failure detecting part 1 when the trasmission is carried out to a telex terminal from a center. In such a case, the detected transmission failure is sent to a repeated call request part 2. Then a repeated call request is applied to a repeated call terminal deciding part 3 from the part 2. A repeated call terminal Q corresponding to the factor of the transmission failure is decided at the part 3, and the repeated call request is connected to the end of the queue through a repeated call request connecting part 4. A waiting time detecting part 5 works every time the waiting time elapses for the highest queue among those produced every factor of the transmission failure. Then the detected waiting time is processed through a head repeated call cancelling part 6, a high-order queue connecting part 7 and a highest-order queue deciding part 8 respectively. Then the data on the head repeated call request of the highest-order queue is transmitted from a transmission control part 9. Thus the system control is simplified.

Description

DETAILED DESCRIPTION OF THE INVENTION (1) Technical Field of the Invention The present invention relates to a recall control method in a message switching system that improves recall processing in the event of a transmission failure.

(2) Background of the technology In a message exchange system using telex, if for some reason the delivery is not completed when the center sends a message to start the telex terminal, depending on the cause, it may be possible to restart the message by sending it again. Since there are cases where processing is completed, methods for performing such processing have been developed and put into practical use in the past. However, the hardware could not be avoided from becoming complicated.

For this reason, there is a strong demand for technical improvements in this type of means.

(3) Conventional technology and problems Conventionally, when the above-mentioned incomplete distribution occurs,
Decide the time interval for re-delivery for each cause of incomplete delivery,
Only one time queue for re-calling is created and controlled, but if a new delivery failure occurs after that queue is created, the process is not 5 first-in-first-out. The current situation is that the hardware used for the processing has also become complicated, and the memory capacity required to store the processed data must also be increased.

(4) Purpose of the Invention The present invention was devised in view of the above-mentioned technical problems, and its purpose is to simplify the control in the case of transmission failure, simplify the recall control logic circuit, and reduce the memory usage. An object of the present invention is to provide a recall control method in a message exchange system that can reduce capacity.

(5) Structure of the invention And its purpose is to create a plurality of queues by ranking each cause of transmission failure, and when a transmission request call is not allowed due to the cause of transmission failure, a queue for the cause of transmission failure is created. While connecting the transmission request call as a re-call request to the end of the queue, each time the waiting time of the highest queue among the plurality of queues elapses, the head re-call request is accepted as a transmission request and the This is achieved by transmitting data and connecting the head recall request of a queue other than the top queue to the tail of the next higher queue each time the waiting time of the queue elapses. .

(6) Embodiments of the Invention Hereinafter, one embodiment of the present invention will be described in detail with reference to the accompanying drawings.

Figures 1 and 2 are block diagrams of the main parts of the logic for implementing the present invention in a message exchange system using telex. Figure 1 is the logic for connection, and Figure 2 is the logic for recall. This is the logic. In FIG. 1, 1 is a transmission failure detection section, 2 is a re-call request section, 3 is a re-call terminal determination section, and 4 is a re-call request connection section.

In FIG. 2, 5 is a waiting time detection section, 6 is a head recall request extraction section, and 7 is a connection section to an upper queue.

Reference numeral 8 represents a top-level queue determination unit, and reference numeral 9 represents a transmission control unit.

Next, the operation of the embodiment of the present invention having the above configuration will be explained.

When a transmission request is sent from a center (not shown) to a telex terminal and the transmission request is accepted by that terminal, data transmission is immediately performed.

However, when the above-mentioned distribution is started from the center to the telex terminal, the distribution may not be completed due to the telex terminal being busy or due to an operator error at that terminal.

That is, when a transmission failure is detected by the transmission failure detection section 1, a recall request is issued from the recall requesting section 2.

In the recall terminal determination section 3, a recall terminal QNn is determined according to the cause of the transmission failure (see Table 1).

Table 1 is created for the determined recall terminal QNn,
The transmission request 2 whose transmission failed is placed at the end of the queue.
For example, connect the message as a recall request n (see Figure 3)
. This process is performed by the recall request connection section 4.

Such processing occurs every time a transmission failure occurs.

On the other hand, a recall request placed in a queue created for each cause of transmission failure as described above is processed as follows.

A predetermined waiting time arrives for the queue ranked as the highest among the plurality of queues as described above (the determination is made by the highest queue determining unit 8).
Each time, in response, the data is transmitted from the transmission control section 9 using a recall request at the head of the highest queue as a transmission request.

At the same time or in parallel with this, the elapsed waiting time for each recall terminal is detected in the waiting time detection unit 5, and in response to this, the head recall request extraction unit 6 detects the elapsed waiting time for each recall terminal QNn. Recall request 2 For example, take out the first message.

The retrieved message n is sent to a recall terminal Q that is one level higher than the recall terminal QNn in the queue to which the retrieved recall request belonged in the connection section 7 to the higher queue.
It is connected to the end of the Nn-1 queue.

The reconnection of such a head recall request to the end of the next higher queue is performed when a predetermined time period predetermined for each recall terminal has elapsed.

While such connection switching is being performed, transmission from the top queue as described above is performed.

(7) Effects of the invention As is clear from the above description, a queue is created for each cause of transmission failure, and a transmission request that has failed in transmission is connected as a recall request to the end of the queue to which the cause of transmission failure belongs. At the same time, each time the waiting time reaches the top queue, the head recall request is sent as a transmission request, and at the same time or in parallel, the head recall request is sent every time the waiting time comes to each queue. Since the call request is connected to the end of the next higher queue, the queue control is simplified, the recall control logic is also simplified, and the memory capacity used can be reduced. .

[Brief explanation of the drawing]

1 and 2 show an embodiment of the present invention, FIG. 1 is a diagram showing the logic for connection, FIG. 2 is a diagram showing the logic for recall, and FIG. 3 is a diagram showing the logic for each queue. FIG. In the figure, 1 is a transmission failure detection unit, and 2 is a recall request unit. 3 is a re-call terminal determining unit, and 4 is a re-call request connecting unit. 5 is a waiting time detection unit, and 6 is a head recall request removal unit. 7 is a connection part to the upper queue, 8 is a top queue determination part,
9 is a transmission control section. Patent applicant Fujitsu Ltd. Figure 1 Figure 2 Figure 3

Claims (1)

[Claims] Multiple queues are created by ranking each transmission failure cause, and if the transmission request call is not allowed due to the transmission failure cause, the transmission request call is placed at the end of the queue for that transmission failure cause and a re-call request is made. While connected as A recall control method in a message switching system, characterized in that each time the waiting time of a queue elapses, a recall request at the head of the queue is connected to the end of a queue one level higher.