JP2597519B2 - Transmission data management method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Summary] The present invention relates to a facsimile apparatus having a communication program reservation function such as a relay request, a broadcast transmission, and a multi-polling reception reservation. It is intended to provide a facsimile machine that can be restored by simple operation, and has a memory for storing reservation information including destinations and contents such as relay requests, broadcast transmissions, multi-polling receptions, and is connected to a reservation queue terminal. A facsimile apparatus for sequentially displaying the contents of the buffer and executing the communication, after the execution of the contents of the reservation queue buffer is completed, a buffer connected to a reserve queue terminal for chaining and storing the contents is provided. When there is a return request, the reservation cue terminal changes to the reservation cue terminal. The Ffa content configured to run Chiein.

[Industrial applications]

The present invention relates to a facsimile apparatus having a communication program function such as a relay request, broadcast transmission, and multi-polling reception reservation.

2. Description of the Related Art Conventionally, when a communication program such as a relay request, a broadcast transmission, and a multi-polling reception reservation is input to a facsimile apparatus, for example, a method such as memory transmission is used to send a predetermined time to each transmission destination. Since the operator sets and inputs a program for transmitting predetermined document data in advance,
The input operation is generally complicated.

FIGS. 5A and 5B are explanatory diagrams of an example of this type of facsimile machine.

As shown in the diagram of FIG. (A), with respect to the facsimile apparatus 1 having a normal memory transmission function, provided a communication program buffer 18, the buffer, the address information such as buffer 18 ₁ outside pool cue terminal (QT) buffer 18 _2, including a reservation for the queue terminal (QT) buffer 18 _3. To explain the outline of the configuration, an operation control unit 11 having a panel 11-1 and a display 11-2 is provided under the control of a main control unit (CPU) 10. And so on. On the other hand, the corresponding original is input to the reading unit 12 and optically scanned and read, and the compression / decompression unit 14 performs code compression by, for example, the MH (Modified Huffman) method, temporarily assigns an address, and assigns an address to the memory 15.
To be stored. When the destination information is read out directly from the panel 11-1 or by the communication program of the present invention to make a call, the other party is connected with a line having an automatic reception function, and when the pre-procedure is started, the call is made in accordance with the other party function. The modem 16 is set. Then, the contents of the memory 15 are read out and sent to the compression / decompression unit 14, and after decompression, compressed according to the partner function, sent to the modem 16 and modulated into a carrier wave, and sent out to the line via the line control unit 17.
Conversely, receiving the carrier from the line, via the line control unit 17,
The signal is demodulated by the modem 16 and temporarily stored in the memory 15, or is decompressed by the compression / decompression unit 14 and printed out by the recording unit 13.

FIG. 2B shows a detailed view of the communication program buffer 18. That is, pre-destination information buffer 18 ₁ input by the operator, pool QT (queue terminal) buffer 18 _2, comprised of the reservation QT (queue Terminal) buffer 18 ₃ from the panel 11-1. Destination information buffer 1
8 ₁ includes a plurality of address areas (buffers 1 to n), each of which has a terminal for chain, communication type, identification code area, dial
NO. Save area is stored. The operator, in advance,
The buffer 18 Similar information QT buffer pool entered the numeric keys in which have been or panel 11-1 stored in ₁ 18 ₂
Are queued (# 1 to #n), and are copied to n unused buffers connected thereto. For example, in the case of broadcast transmission, the relevant branch number is registered for the time being,
The actual reservation time queue the pool QT in QT buffer 18 ₃ for Hunt reserved (# 1~ # n) is, it is Chiein to the corresponding reservation buffer. In this way, Q.
According to the order of T, a call is made to the destination, and predetermined document data is transmitted from the memory 15.

[Problem to be Solved by the Invention] In the above-mentioned conventional configuration, particularly in the configuration of the main part of FIG. 5, it is true that at the time of reservation, a call is easily made according to the pre-input reservation information and communication is executed early. In the case of a middle person or absence of a partner, a case where a reservation is deleted without communication even once often occurs.

Then, once the reservation is deleted, it must be queued again at the reservation queue terminal in the same procedure as when the reservation was first made by the operator.

SUMMARY OF THE INVENTION It is an object of the present invention to provide a facsimile apparatus in which a communication program is reserved once and a reservation deleted thereafter can be restored by a relatively simple operation.

[Means for solving the problem]

In order to achieve the above object, the present invention manages a queue of a plurality of data stored in a memory associated with destination information and sequentially transmits the data in a reception order, and when the transmission is not completed normally, Without erasing from memory,
A configuration is adopted in which the queue is removed from the queue management in a state where it can be incorporated into the transmission queue again.

(Operation)

By adopting such a configuration, if the transmission data specifying the destination is sequentially registered, the data is queued and transmitted in the order of reception, and the data that has not been finally transmitted by the processing such as redial is transmitted in the transmission queue. However, since it is removed from the memory but remains on the memory without being erased, the process of returning to the transmission queue again can be performed very easily.

〔Example〕

 FIG. 2 is an explanatory view of the configuration of the embodiment.

The difference between the facsimile machine 1 'of FIG. 5 and the facsimile machine 1 of FIG.
This is the addition of a reserve queue terminal (QT) buffer 21 in which the content of item 20 is double-framed.

FIG. 3 shows a communication program buffer which is a main part of the embodiment.
FIG. 4 is a detailed explanatory diagram of FIG. 4, and FIG. 4 is a flowchart showing the operation thereof.

Configuration of Figure 3, compared reserved for Q.T18 ₃ in the conventional example of FIG. 5 (b), is obtained by further Chiein a reserve for Q.T21. Thus, as shown in the principle diagram of Fig. 1, a result of the call by the reservation Q.T18 _3, when the busy or absent, the appropriate destination information reserved by Chiein previously reserved for Q.T21 When a return request is issued, the call is queued in a reservation buffer by a chain and a call is made.

4 (a) to 4 (c) show the operation based on the configuration of FIG.
The flow is shown separately for reservation, execution, and return.

The flow of the reservation operation 4 (a), the operator is registered by extracting from the destination information buffer 18 ₁ associated with advance business Q.T18 ₂ (these pool that Chiein buffer unused if there is a buffer to be reserved from there things) to hunt, the reservation information is set in the buffer by Chiein to Chiein a reservation Q.T18 _3. Q.T1 for pool
8 Without _second buffer to be reserved to hunt a buffer from the reserve Q.T21, to Chiein and sets reservation information in the buffer reservation Q.T18 ₃ by Chiein. Thus, the reservation can be restored in a simple procedure.

The flow of the reservation execution of FIG (b), and hunt the appropriate buffers from the reservation Q.T18 _3, analyzes the contents of the appropriate buffer to perform the communication. If the communication is terminated run, to Chiein the contents of the corresponding buffer from the reservation for Q.T18 ₃ to reserve Q.T21. Thus, preparations are made for redialing.

In the flow of restoring the reservation shown in FIG. 11C, when the operator requests to restore the previously executed communication reservation, the designated buffer to be restored is hunted from the reserve Q.T21 and the buffer is restored. to Q.T18 ₃ and Chiein for reserved by Chiein. As a result, it is possible to omit the procedure of once canceling the reservation and then re-booking the reservation as in the related art.

Here, since the number of buffers is limited, if a new communication reservation is to be made, all buffers are chained to the reservation QT or the reserve QT, and none of the pool QTs has a buffer. If not chained, the oldest buffer among the buffers chained to the reserve QT is hunted from the reserve QT, the contents are cleared, and the buffer is used.

When a new reservation is to be made in a situation where no buffer is available for use in the reserve QT or the pool QT at all, the reservation limit is displayed to the operator.

〔The invention's effect〕

As is apparent from the above description, the present invention manages a plurality of data stored in the memory in association with the destination information and sequentially transmits the data in the order of reception, and when the transmission is not completed normally, , Without being deleted from the memory, without being subject to the queue management in a state where it can be incorporated into the transmission queue again. With this configuration, it is accepted if transmission data specifying destinations is sequentially registered. Data that is queued in order and transmitted, and data that is not finally transmitted even by redialing or other processing is removed from the transmission queue but remains in memory without being deleted. This has the effect that the returning process can be performed very easily.

[Brief description of the drawings]

FIG. 1 is a diagram illustrating the principle of the present invention, FIG. 2 is a diagram illustrating the configuration of an embodiment, FIG. 3 is a detailed diagram of a communication program buffer of the embodiment, FIG. 4 is a flowchart showing the operation of the embodiment, FIG. FIGS. 1A and 1B are explanatory views of a conventional example, in which 1, 1 '
Is a facsimile machine, 10 is a main control unit, 11 is an operation control unit,
11-1 is a panel, 11-2 is a display, 12 is a reading unit, 13 is a recording unit, 14 is a compression / decompression unit, 15 is a memory, 16 is a modem, 17
The line control unit, 18 and 20 show communication program buffer, 18 ₁ destination information buffer, 18 ₂ Pool QT (queue terminal) buffer, 18 ₃ QT buffer reservation, 21 a QT buffer reserve.

Claims (1)

(57) [Claims] A plurality of data stored in a memory in association with destination information are queue-managed and sequentially transmitted in the order of reception. If the transmission is not completed normally, the data is not deleted from the memory. A transmission data management method, wherein the transmission data is removed from the queue management target in a state where it can be incorporated into the transmission queue again.