JPH05268227A - System for transmitting electronic data - Google Patents

Abstract

PURPOSE:To facilitate the correction of transmission route at every electronic data such as a slip, etc., to set a proxy receiver, to fasilitate the designation of the transmission route at every electronic data and to reduce a transmission message. CONSTITUTION:The electronic data transmitting system is the system where a processing node is divided into local areas 24, a group node 3 where the processing node is divided into a global electronic data processing node 1 and a local electronic data processing node 2 and also a parallel processing is executed and a hierarchical node 4 where the local areas 24 are made into a hierarchy are introduced, priority control mechanism and time control mechanism are introduced to a slip control mechanism and absence detecting mechanism is also introduced.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION This invention is mainly applied to in-house slips,
The present invention relates to an electronic data delivery system for transmitting and receiving documents and the like by electronic mail and the like.

[0002]

2. Description of the Related Art FIG.
It is a block diagram which shows the structure of the conventional electronic data processing node shown by the 7th publication etc. In FIG. 25, reference numeral 251 is an attribute addition type slip processing node, 5 is a slip, 6 is a slip transmission / reception processing, 9 is a stored slip, 8 is slip processing, 10 is a transmission mechanism, 11 is a reception mechanism, and 12 is automatic delivery. Decision mechanism,
Reference numeral 14 is a slip management mechanism, 15 is a slip processing mechanism, and 19 is an attribute.

Next, the operation will be described. Receiver 11
Receives slip 5 and saves it as slip 9. Voucher processing 8
Processes the slip 9. The automatic delivery determination mechanism 12 delivers the slip 9 to the transmission mechanism 10 according to the attribute 19 of the slip 9. The transmission mechanism 10 transmits the slip 5. FIG. 26 shows a configuration example of the slip 5. In FIG. 26, 19 is an attribute of destination, push-in process, approval process, and the like, and 5 is a slip.

FIG. 27 is a block diagram showing the configuration of a conventional electronic data processing node disclosed in, for example, Japanese Patent Application Laid-Open Nos. 62-25373 and 63-141176. In FIG. 27, reference numeral 272 denotes a table reference type slip processing node.

The operation characteristic of this conventional example is that the automatic delivery determining mechanism 12 operates the slip 5 according to the delivery information table 13a.
The transmission destination of is sent to the transmission mechanism 10 by the transmission instruction 17.

FIG. 28 shows the structure of a conventional group transmission system. When the slips 5 are processed in parallel, the same slip 5 is sent to a plurality of slip processing nodes 2a.

FIG. 29 shows the configuration of another conventional group reception system. When the slips 5 are processed and transmitted by the plurality of slip processing nodes 2a, the plurality of slips 5 arrive at the slip processing node 292.

[0008]

Since the conventional electronic data delivery system is configured as described above, the table reference system cannot specify the delivery route for each slip.
I had to shut down the entire system when I made a delivery fix.

In addition, in the attribute addition system, the slip creator must send the slip in consideration of all the destinations, the sent message becomes large when there are many attributes, and the recipient is absent. There was a problem that the substitute recipient could not be specified by and the recipient could not be changed due to the change of organization.

Also, in both methods, it is not possible to check whether reception has been completed from a plurality of delivery destinations.

Further, although the sender can set the priority of the slip to be delivered and the delivery date, the receiver cannot set the priority of the slip, which is inconvenient.

Further, when the recipient is absent, the sender cannot know that the delivery will be delayed, and it is sent that the voucher once sent is delayed due to the busyness of the recipient. There was a problem that the person could not know.

The present invention has been made to solve the above problems, and it is possible to easily specify a delivery route for each electronic data such as a slip, easily modify the delivery route, reduce a transmission message, An object of the present invention is to obtain an electronic data delivery method that enables setting of proxy recipients, confirmation of reception from multiple delivery destinations, priority setting of incoming messages by the recipients, and automatic notification of late delivery to the sender.

[0014]

According to another aspect of the present invention, there is provided an electronic data delivery system having a delivery information table indicating destinations of electronic data for each of a plurality of electronic data processing nodes for delivering and processing electronic data. The plurality of electronic data processing nodes are divided into local areas 24, and the plurality of electronic data processing nodes are the global electronic data processing nodes 1 in the local area 24 for delivering and processing electronic data between the local areas 24. , A local area 24 for delivering and processing electronic data with other local electronic data processing nodes 2 in the local area 24.
The electronic data is distributed to the local electronic data processing node 2 within the electronic data processing node 2.

In the electronic data delivery system according to the second aspect of the present invention, a delivery information table indicating destinations of electronic data is provided for each of a plurality of electronic data processing nodes that deliver and process electronic data, and the plurality of electronic data delivery nodes are provided. The data processing node is divided into local areas 24, and the plurality of electronic data processing nodes are used to distribute and process electronic data between the local areas 24. It is divided into a local electronic data processing node 2 in the local area 24 for delivering and processing electronic data to and from another local electronic data processing node 2, and a group node 3 and a local area 24 for performing parallel delivery processing. It has a structure in which a hierarchical node 4 for hierarchical structure is introduced, and the type of electronic data The priority management means (priority management mechanism 44) that determines and manages the priority of incoming electronic data is compared with the delivery date specified by the recipient and the current date and time, and when the delivery date exceeds the current date and time, the sender is notified. If the time management means (time management mechanism 71) that sends a delivery delay message is compared with the absence period set by the recipient and the delivery date of the received electronic data, the recipient processes if the delivery date is within the absence period. At least one means of an absence detection means (absence detection mechanism 69) for transmitting a message to the effect that it is impossible to the sender is provided, and electronic data is delivered.

[0016]

In the invention of claim 1, the local area 24
The global electronic data processing node 1 in FIG. 1 delivers electronic data between the local areas 24 according to the contents of the delivery information table, and the local electronic data processing node 2 follows other local electronic data in the local area 24 according to the contents of the delivery information table. Electronic data is delivered to and from the processing node 2.

In the second aspect of the invention, the global electronic data processing node 1 in the local area 24 delivers electronic data between the local areas 24 according to the contents of the delivery information table, and the local electronic data processing node 2
Is the local area 24 according to the contents of the delivery information table.
Electronic data is delivered to and from another local electronic data processing node 2 in the inside. The group node 3 performs parallel processing of delivery. The hierarchization node 4 hierarchizes the local area 24. The priority management means determines and manages the priority of incoming electronic data according to the type of electronic data. The time management means compares the delivery date designated by the recipient with the current date and time, and sends a late delivery message to the sender when the delivery date has passed the current date and time. The absence detecting means compares the absence period set by the receiver with the delivery date of the received electronic data, and when the delivery date is within the absence period, sends a message indicating that the recipient cannot process to the sender.

[0018]

EXAMPLES Example 1. FIG. 1 is a block diagram showing the configuration of an electronic data delivery system according to an embodiment of the present invention. In FIG. 1, 1 is a global electronic data processing node in the local area 24 for delivering and processing electronic data between the local areas 24, and 2 is electronic data with other local electronic data processing nodes in the local area 24. Is a local electronic data processing node in the local area 24 for carrying out delivery and processing of 3; 3 is a group node for carrying out parallel delivery processing; 4 is a hierarchizing node for hierarchizing the local area 24; 5 is a slip. As described above, in this embodiment, the plurality of electronic data processing nodes are divided into the local area 24, and are divided into the global electronic data processing node 1 and the local electronic data processing node 2.

Next, the operation will be described. The slip 5 generated at the global electronic data processing node 1 is subjected to a process such as a stamp at a necessary department (local electronic data processing node 2). The slip 5 takes the form of an attributed slip according to the conventional method shown in FIG. However, the destination of the attribute information 19 is only the one corresponding to the global electronic data processing node 1. The global electronic data processing node 1 that has received the processing request transmits the slip 5 to the local electronic data processing node 2 in its own local area 24. The local electronic data processing node 2 sends the slip 5 to the local electronic data processing node 2 or the global electronic data processing node 1 in the local area 24. When the processing in the local area 24 is completed, the local electronic data processing node 1 delivers the slip 5 to the local electronic data processing node 1 in another local area 24. Similar processing is performed in another local area 24, and the slip 5 is delivered to the next local area 24. In this way, the slips are sequentially sent and necessary processing is performed.

FIG. 2 is a block diagram showing the arrangement of the slip processing node in this embodiment. The operation of the local slip processing node (local electronic data processing node) will be described with reference to FIG. Since the local slip processing node corresponds to the local electronic data processing node, the same reference numeral 2 is used. The slip 5 is received by the slip transmission / reception processing 6 and stored in the slip 9. The slip processing 8 processes the slip 9. Slip 9
Is sent, the type 16 is read by the automatic delivery determination mechanism 12. Next, the destination, order and processing are read from the record corresponding to the type 16 of the delivery information table 13b. The automatic delivery determination mechanism 12 sends a transmission instruction 17 to the transmission mechanism 10, and the slip 5 is transmitted.

FIG. 3 shows a delivery system of the global slip processing node (global electronic data processing node) 1. Since the global slip processing node corresponds to the global electronic data processing node, the same reference numeral 1 is used.
Automatic delivery determination mechanism 1 in the global slip processing node 1
When the slip comes from another global slip processing node 1, the slip 2 refers to the slip type information 16 and the local delivery information table 13b, and passes the slip to the local slip processing node 2. When the slip comes from the local slip processing node 2,
It refers to the global attribute information 19 and passes it to another global slip processing node 2.

FIG. 4 shows a flowchart of the automatic delivery determining mechanism of the global slip processing node. Step two
In step 6, the slip is received, and in step 27, it is determined whether the slip is received from the lower layer. If it is received from the lower layer, the process branches to step 28, and if not, the process branches to step 30. When branching to step 28, the attribute information of the slip received in step 26 is referred to, the destination of the peer layer node is determined in step 29, and the destination node is transmitted in step 32. When branching to step 30, the local delivery information table is referred to in step 30, the destination to the lower layer node is determined in step 31, and the destination node is transmitted in step 32.

A block diagram of the electronic data delivery system in this embodiment is shown in FIG. In FIG. 5, 20 is a control device, 21 is a storage device, 22 is an information processing device, 23 is a terminal device, 24 is a local area, and 25 is a global area.

The global area 25 comprises a plurality of local areas 24. The local area 24 includes a control device 20, a storage device 21, a plurality of terminal devices 23, and an information processing device 22. Global electronic data processing node 1
Is the control device 20, and the local electronic data processing node 2
Can be configured as the information processing device 22 and the terminal device 23.

In the above embodiment, the electronic data to be delivered are handled as slips, but documents, drawings, spreadsheets,
Other electronic data such as CAD data may be used, and in this case, the same effect as that of the above-described embodiment is obtained.

Example 2. In the above embodiment, the attribute addition method is used for the delivery between the local areas 24, but the table reference method may be used.

FIG. 6 shows a block diagram of the delivery system of the global slip processing node in this embodiment. The automatic delivery determination mechanism 12 in the global slip processing node 1 refers to the global delivery information table 13c for delivery of slips between local areas, and the local delivery information table 13d for delivery of slips in the local area. refer. In this case, the table is distributed according to the conventional table reference method, and the same effect as that of the above-described embodiment is obtained.

Example 3. In the first embodiment, the local slip processing node 2 uses the table reference method, but the attribute addition method may be used. FIG. 7 shows a configuration diagram of the delivery system of the global slip processing node 1 in this case. In FIG. 7, the automatic delivery determination mechanism 12 refers to the local delivery information table 13d and refers to the local attribute addition mechanism 3
In step 3, attributes are added to the slip.

In this case, the slip 5 flowing between the local areas 24 is the same as that in the first embodiment, and the same effect is obtained.

Example 4. As an extension of the first embodiment, by introducing the hierarchical node 4 into the local area 24,
The local area 24 as a subset can be set in the local area 24.

FIG. 8 shows the structure of the processing system of the hierarchical node. The local area 24 can be constructed by installing the global slip processing node 1 (1a) between the global slip processing node 1 and the local slip processing node 2 group.
FIG. 9 shows a flowchart of the automatic delivery determination mechanism when the global processing of the global processing node 1 (1a) is the table reference method.

In FIG. 9, the slip is received in step 26, and it is determined in step 27 whether it is received from the lower layer. If it is received from the lower layer, the process branches to step 34, and if not, the process branches to step 30. When branching to step 34, the global delivery information table of step 34 is referred to, the destination of the upper layer node is determined in step 29, and the destination node is transmitted in step 32. When branching to step 30, the local delivery information table is referred to in step 30, the destination to the lower layer node is determined in step 31, and the destination node is transmitted in step 32.

For example, a four-digit number is used to hierarchically express the delivery destination, and the first two digits of the four-digit number are made to correspond to the global area, and the third and fourth digits are made to the local area. Correspond. For details of the concrete expression, in order to express the delivery destination as shown in FIG. 24, place name = 1 in the first digit for the head office, 1 in the second digit for the a part, and 3 for the two groups. The representation is layered by assigning 2 to the digit and 2 to the machine 3 for the fourth digit. Further, the global area and the local area are set as shown in the second line of FIG. For example, if the delivery destination of the slip is the head office / a department / two groups / machines 3 as a result, the delivery destinations are represented by the global area 11 and the local area 22. Further, in the delivery system according to the present invention, the attribute information of the slip is two digits of global information designating the delivery destination. Then, the third and fourth digits of the delivery destination expression are set in the processing table attached to the local delivery program on the receiving side. That is, in the same example as above, the global delivery information 11 is designated as an attribute of the slip, and the local information 22 is written in the processing table attached to the program by referring to the document type of the slip attribute information in the local delivery program. It is decided based on the existing information. Next, the delivery route will be described. When a voucher is shipped, it will be delivered directly from the sending machine to the global node of that machine, and will be delivered to the global node higher in the hierarchy according to the global shipping program prepared there and the global node information written in the voucher. It is decided whether to deliver to the level global, and it is sent to the global node which has the local processing table of the destination. Once the voucher arrives directly at the delivery destination global node, the local delivery program prepared there delivers the voucher to the delivery destination machine using the local processing table and the document type information written as the voucher attribute. For example, when a voucher is delivered from a 1111 machine to a 1211 machine, the route is 1111
→ 11 global node → 12 global node
e → 1211. If there are multiple delivery destinations,
Multiple delivery destinations are specified in the global information, and the delivery described above is repeated multiple times. Also, when the number of layers is increased, each layer is added with a function similar to that of the global node 11 described above.

Example 5. Figure 1 shows the configuration of the group reception system.
Shown in 1. When receiving from a plurality of delivery sources, the slip processing node 2b that waits for reception from the slip processing group node 3
When all the slip processing nodes 2a in the slip processing group node 3 have completed the transmission, it is assumed that the transmission from the slip processing node 3 is completed.

The processing of the slip processing node 2b is shown in FIG. FIG. 12 shows a flowchart of the group reception system. In step 35, the slip is received, and if it is received, the delivery information table is read in step 36. In step 37, it is determined whether the reception is from the group. If it is received from the group, the process branches to step 38, and if not, the process branches to step 39. When the process branches to step 39, the receipt of the slip is completed. When branching to step 38, it is determined in step 38 whether all the slips in the group have been received,
When all the slips have been received, the process branches to step 39,
Otherwise, it branches to step 35. When the process branches to step 39, the group reception of the slip is completed.
When the process branches to step 35, the slip is newly received.

FIG. 13 shows the delivery information table 13b for realizing the grouping node. In FIG. 13, group E is composed of members A, Z, Q and others.

As shown in FIG. 14, a plurality of grouping nodes 3 can be arranged in parallel. In this case, after the processing of all the processing nodes 2 in the preceding group node 3a is completed, the slip is automatically transmitted to the subsequent group node 3b.

Example 6. FIG. 15 shows a configuration diagram of the priority management mechanism in this embodiment. 15A, 40 is a slip receiving process, 41 is a priority determination mechanism, 42 is a rearrangement operation, 43 is slip information, 44 is a priority management mechanism, 45 is priority information, 4
6 is a priority table, and 47 is a priority setting mechanism.

Next, the operation will be described. The slip 5 received by the slip reception processing 40 is processed by the slip reception processing 40 and the slip information is extracted. The slip information taken out is read by the priority determination mechanism 41. The priority determining mechanism 41 determines and creates priority information 45 from the slip information 43 and the priority table 46. Created priority information 45
Is read by the priority management mechanism 44,
The priority management mechanism 44 uses the stored slip 9
The rearrangement operation 42 is performed for.

As a result of the rearrangement operation 42 of the stored slips 9, the result is as shown in FIG.

FIG. 16 shows a flowchart of the receiver-specified priority determining mechanism. The slip is received in step 48, the priority of the slip received by the receiver is designated in step 49, the priority of the slip received is determined in step 50, and priority information is created in step 51.

FIG. 17 shows a flowchart of the priority management mechanism in this embodiment. The priority information is read from the received slips in step 52, the priority order of the slips is determined from the priority information in step 53, and the priority order of the slips is rearranged in step 54.

FIG. 18 shows an example of the screen structure of the slip with the recipient-specified priority in this embodiment. FIG. 18A is an example of a screen configuration when various slips are received. FIG. 18B is an example of a screen configuration when the recipient specifies the priority on the various slips in FIG. 18A using an input means such as a mouse. FIG. 18C is an example of a screen configuration when the priority of various slips is determined.

Further, in the above embodiment, the priority is represented by high, medium and low, but it may be expressed by an integer value, and in this case, the same effect as that of the above embodiment can be obtained.

Example 7. FIG. 19 shows a flowchart of the priority determining mechanism according to the type of slip. In step 48, the slip is received, in step 55, the slip information is read from the received slip, in step 56 the priority is determined according to the slip type, and in step 51 the priority is created.

Further, in the above embodiment, the rearrangement operation 42 of the processing waiting queue is performed when a new slip arrives. This timing can be changed, for example, the rearrangement operation 42.
Since the daemon of is always running, it is possible to rearrange at regular intervals. With this method, it is possible to prioritize processing deadlines more efficiently.

Example 8. In the seventh embodiment, the priority is determined by the type of slip in step 56, but the priority may be determined by the sender's affiliation (same section, same section, same department, same branch), and the same effect is obtained. ..

Further, in the above embodiment, the rearrangement operation 42 of the processing waiting queue is performed when a new slip arrives. This timing can be changed, for example, the rearrangement operation 42.
Since the daemon of is always running, it is possible to rearrange at regular intervals. With this method, it is possible to prioritize processing deadlines more efficiently.

Example 9. In the seventh embodiment, the priority is determined according to the type of slip in step 56, but the priority may be determined according to the class of the sender, and the same effect can be obtained.

Further, in the above embodiment, the rearrangement operation 42 of the processing waiting queue is performed when a new slip arrives. This timing can be changed, for example, the rearrangement operation 42.
Since the daemon of is always running, it is possible to rearrange at regular intervals. In this method, it is possible to prioritize processing deadlines more efficiently.

Example 10. FIG. 20 shows a flowchart of the receiver setting priority determining mechanism. In step 48, the slip is received, in step 55, the slip information is read from the received slip, in step 57, the priority table is read, and in step 5
In step 8, the priority of the received slip is determined, and in step 51 priority information is created.

Example 11. FIG. 21 shows a flowchart of the weighting priority determining mechanism. At step 48, the slip is received, at step 55, the slip information is read from the received slip, and at step 59, the priority is determined by the method of Embodiment 6, Embodiment 7, Embodiment 8, Embodiment 9 or the like. Then, the priority determined in step 60 is weighted, and in step 51 priority information is created.

Example 12 In FIG. 2, the absence detection mechanism 69 determines whether the recipient is absent by the absence setting mechanism 70.
Information 72 from the receiving mechanism 11
The response deadline information 71 of the slip 5 from the return date and the return date information 72 from the absence setting mechanism 70 compares the response deadline of the slip 5 with the return date and time of the recipient. To the transmission mechanism 10. The requested transmission mechanism sends the absence notification to the sender of the slip 5.

FIG. 22 shows a flowchart of the absence of the receiver by the absence detecting mechanism. In step 48, the slip is received. In step 61, it is determined whether or not the recipient is absent. If not, the process branches to step 63, and if not, the process branches to step 62. In the case of branching to step 63, the reply deadline is compared with the recipient return date and time in step 63, and if the return date or time is earlier than the response period, step 62
Branch to. Otherwise, it branches to step 64.
When the process branches to step 64, the absence notification is transmitted to the caller in step 64. If the process branches to step 62, it is saved in the slip file in step 62.

In the above embodiment, a dedicated mechanism is provided as the absence setting mechanism 70, but a personal schedule may be used, and in this case, the same effect is obtained.

Example 13 In FIG. 2, the time management mechanism 7
When the delivery deadline of the slip 9 is earlier than the current time, 1 requests the transmission mechanism 10 to send the expired message to the sender of the slip 9. The requested sending mechanism 10 sends the expired message to the sender.

FIG. 23 shows a flowchart regarding the delivery deadline of the time management mechanism. In step 65, the delivery deadline is read from the delivery deadline table 66. In step 67, the current time is compared with the delivery deadline, and if the delivery deadline is early, the process branches to step 68. At step 68, the expired message is sent to the sender.

As described above, the features of this embodiment are as follows. This electronic data delivery system consists of a local area obtained by dividing all data processing nodes, a global electronic data processing node for delivering electronic data between the local areas, a global electronic data processing node in the local area, and other internal areas. And a local electronic data processing node for delivering electronic data to and from the local electronic data processing node.

In this electronic data delivery system, a local area in which all data processing nodes are divided and data delivery between local areas are processed by a global data delivery table and a local area automatic delivery mechanism and data in the local area. In the local area that processes the delivery of data in the local area using the data delivery table in the local area, and in the local area that processes the delivery of data in the local area using the data delivery table in the local area It has an automatic delivery mechanism.

In this electronic data delivery system, a local area in which all data processing nodes are divided, an automatic delivery mechanism between local areas that processes delivery of data between local areas with an attribute attached to the data, and a local area An automatic delivery mechanism within a local area is provided for processing delivery of data using a data delivery table within the local area.

In this electronic data delivery system, a local area in which all data processing nodes are divided, and the delivery of data between local areas is processed by the inter-local area automatic delivery mechanism which processes the delivery of data between the local areas and the data in the local area. Is provided with a global electronic data processing node that adds an attribute based on a data delivery table in the local area, and a local electronic data processing node that processes delivery of data in the local area with the attribute of the data.

In this electronic data delivery system, the delivery destination of electronic data is expressed hierarchically according to the systematic diagram of the organization.

The present electronic data delivery system is a global electronic data processing node for delivering electronic data between a local area formed by dividing all data processing nodes, a local area including a group of data processing nodes in the local area, and local areas. And a local electronic data processing node for delivering electronic data between the global electronic data processing node in the local area and another local electronic data processing node in the local area.

The present electronic data delivery system is provided with an electronic data processing node which detects all incoming calls of slips processed in parallel, and a group node which is a group of data processing nodes processed in parallel. ..

This electronic data delivery system is provided with a priority determining mechanism for weighting various kinds of information to determine the priority and a priority managing mechanism for changing the display order according to the priority.

This electronic data delivery system is provided with a priority determining mechanism in which a user adds a processing priority of electronic data at the time of an incoming call, and a priority managing mechanism for changing the display order according to the priority.

The present electronic data delivery system is provided with a priority determining mechanism for determining the priority according to the type of electronic data and a priority managing mechanism for changing the display order according to the priority.

In the present electronic data delivery system, a priority table setting mechanism in which the recipient determines the priority for each content of the specific information of the electronic data transmitted, and the priority from the content of the specific information of the electronic data transmitted And a priority management mechanism that changes the display order according to the priority.

The present electronic data delivery system has a time management mechanism for automatically sending a late delivery message to the sender by comparing the delivery date designated by the sender with the current date and time.

This electronic data delivery system compares the absence period setting mechanism in which the receiver sets the absence period with the delivery period of the received electronic data and sends a message indicating that the recipient cannot process. It has an absence detection function.

This electronic data delivery system is a priority determining mechanism for determining the priority depending on the affiliation (same section, same section, same department, same branch) of the sender of electronic data, and a priority managing mechanism for changing the display order according to the priority. It has and.

This electronic data delivery system is provided with a priority determining mechanism for determining the priority according to the rank of the sender of the electronic data, and a priority managing mechanism for changing the display order according to the priority.

As described above, according to this embodiment, the local area is introduced, the table reference method is used in the local area, and the attribute addition method is used between the local areas. Compared with the system that only uses the attribute addition method, the slip creator can send the slip without paying attention to the destinations in each local area, and the whole slip can be sent. Can reduce the size of outgoing messages.

Further, by having the delivery mechanism tables in a distributed manner, the local delivery information table can be modified without stopping the entire slip system.

Since the delivery information table is placed in the local area, the agent for slip processing can be easily changed in the local area.

If the delivery information table is made to correspond to the hierarchical constituent elements of the organization, the data delivery can be mechanically changed due to the change of the organization.

When the delivery information table is made to correspond to the hierarchical components of the organization, when the organization is partially changed, it can be dealt with by a partial change.

When receiving from a plurality of delivery sources,
The group node allows the receiver to know that all the slips have been received without checking the individual slips.

Further, by using the priority determining mechanism, it is possible to process the slips with the highest priority.

Further, the time management mechanism can automatically notify the sender that the delivery date of the slip processing is delayed.

The absence detection mechanism allows the sender to know that the slip is not processed due to the absence of the recipient.

Further, the priority table setting mechanism can be set so that the slip from a specific sender is processed with the highest priority.

[0083]

According to the first aspect of the present invention, a delivery information table indicating destinations of electronic data is provided for each of a plurality of electronic data processing nodes for delivering electronic data, and the plurality of electronic data processing nodes are provided. Between the global electronic data processing node in the local area, which divides the plurality of electronic data processing nodes into local areas, and distributes electronic data between the local areas, and between other local electronic data processing nodes in the local area. Since the electronic data is delivered by dividing it into the local electronic data processing node in the local area that delivers electronic data, it is easy to specify the delivery route for each electronic data such as a slip, and to easily specify the delivery route. It is possible to obtain various effects such as various corrections and reduction of transmitted messages.

According to the second aspect of the present invention, a delivery information table indicating destinations of electronic data is provided for each of a plurality of electronic data processing nodes for delivering electronic data, and the plurality of electronic data processing nodes are provided in a local area. Electronic data between the global electronic data processing node in the local area for distributing electronic data between the local areas and other local electronic data processing nodes in the local area. It is divided into a local electronic data processing node in the local area for delivering the data, a group node for performing parallel processing of delivery and a hierarchical node for hierarchizing the local area are introduced, and further, according to the type of electronic data. With priority management means for determining and managing the priority of incoming electronic data The time management means that compares the delivery date specified by the sender with the current date and time, and sends a late delivery message to the sender when the delivery date exceeds the current date and time, and the absent period set by the recipient and the received electronic mail. At least one means of absence detection means for transmitting a message indicating that the recipient cannot process to the sender when the delivery date is within the absence period by comparing with the delivery date of the data is provided. Since delivery is performed, in addition to the above effects, setting of proxy recipients, confirmation of receipt from multiple delivery destinations, priority setting of incoming messages by recipients, automatic notification of late delivery to senders, etc. Therefore, there is an effect that the electronic data processing can be made efficient.

[Brief description of drawings]

FIG. 1 is an overall configuration diagram of an electronic data delivery system according to an embodiment of the present invention.

FIG. 2 is a configuration diagram of a local slip processing node in the present embodiment.

FIG. 3 is a configuration diagram of a delivery system of a global slip processing node in this embodiment.

FIG. 4 is a flowchart of an automatic delivery determination mechanism of a global slip processing node in this embodiment.

FIG. 5 is a configuration diagram of an electronic data delivery system in the present embodiment.

FIG. 6 is a configuration diagram of a delivery system of a global slip processing node in the present embodiment.

FIG. 7 is a configuration diagram of a delivery system of a global slip processing node in the present embodiment.

FIG. 8 is a configuration diagram of a processing method of a hierarchical node according to the present exemplary embodiment.

FIG. 9 is a flowchart of an automatic delivery determination mechanism of a global slip processing node in this embodiment.

FIG. 10 is a diagram showing an example of a logical delivery information table in the present embodiment.

FIG. 11 is a configuration diagram of a group reception system in the present embodiment.

FIG. 12 is a flowchart of a group reception system in this embodiment.

FIG. 13 is a diagram showing an example of a delivery information table of a grouping system in this embodiment.

FIG. 14 is a diagram showing a group transmission / reception application example in the present embodiment.

FIG. 15 is a configuration diagram of a priority management mechanism in the present embodiment.

FIG. 16 is a flowchart of a receiver-specified priority determination mechanism in this embodiment.

FIG. 17 is a flowchart of a priority management mechanism in this embodiment.

FIG. 18 is a diagram showing a screen configuration example of a slip with a recipient-specified priority in the present embodiment.

FIG. 19 is a flowchart of a priority determining mechanism according to a slip type in the present embodiment.

FIG. 20 is a flowchart of a receiver setting priority determining mechanism in this embodiment.

FIG. 21 is a flowchart of a weighting priority determining mechanism in this embodiment.

FIG. 22 is a flowchart of the absence of the receiver of the absence detecting mechanism in the present embodiment.

FIG. 23 is a flowchart of a delivery deadline of the time management mechanism in the present embodiment.

FIG. 24 is a diagram showing a system configuration table in the present embodiment.

FIG. 25 is a configuration diagram of a slip processing node according to a conventional attribute addition method.

FIG. 26 is a diagram showing a configuration example of a conventional attributed slip.

FIG. 27 is a configuration diagram of a slip processing node according to a conventional table reference method.

FIG. 28 is a configuration diagram of a conventional group transmission method.

FIG. 29 is a configuration diagram of a conventional group reception system.

[Explanation of symbols]

1 Global Electronic Data Processing Node 2 Local Electronic Data Processing Node 3 Group Node 4 Hierarchical Node 44 Priority Management Mechanism (Priority Management Means) 69 Absence Detection Mechanism (Absence Detection Means) 71 Time Management Mechanism (Time Management Means)

─────────────────────────────────────────────────── ───

[Procedure amendment]

[Submission date] September 24, 1992

[Procedure Amendment 1]

[Document name to be amended] Statement

[Name of item to be amended] Claims

[Correction method] Change

[Correction content]

[Claims]

[Procedure Amendment 2]

[Document name to be amended] Statement

[Correction target item name] 0014

[Correction method] Change

[Correction content]

[0014]

Means for Solving the Problems An electronic data delivery method according to the invention of claim 1, row delivery and processing of electronic data
Cormorant electronic data processing multiple nodes is divided into a local area 24, the global electronic data processing node 1 in the local area 24 in which the plurality of electronic data processing node performing the delivery and processing of the electronic data between the local area 24
And the local electronic data processing node 2 in the local area 24 for delivering and processing electronic data to and from other local electronic data processing nodes 2 in the local area 24. Addressed to
Attributes added to the delivery information table or slip that indicates the destination etc.
Based on the
Delivery information table showing the destination of electronic data in area 24
Area based on the attributes added to the table or slip
The electronic data is delivered in the same manner as the delivery within 24 .

[Procedure 3]

[Document name to be amended] Statement

[Correction target item name] 0015

[Correction method] Change

[Correction content]

An electronic data delivery system according to the invention of claim 2
Local area of the delivery and processing of electronic data by dividing the rows of cormorants plurality of electronic data processing node in a local area 24 to shipping and processing of the electronic data between the local area 24 of the plurality of electronic data processing nodes A local area 24 for delivering and processing electronic data between the global electronic data processing node 1 in 24 and another local electronic data processing node 2 in the local area 24.
Divided into a local electronic data processing node 2 of the, local
Delivery information indicating the destination of electronic data between the two areas 24
Based on the attributes added to the table or slip, local error
(A) Delivery between 24 and delivery of electricity within the local area 24
Attached to the delivery information table or slip indicating the destination etc. of the child data
Based on the added attributes, deliver within the local area 24.
In addition to the above , a group node 3 that performs parallel processing of delivery and a hierarchical node 4 that performs hierarchical processing of the local area 24 are introduced, and the priority of incoming electronic data is determined according to the type of electronic data. Priority management means (priority management mechanism 4
4) and the delivery date designated by the recipient and the current date and time, and when the delivery date has passed the current date and time, a time management means (time management mechanism 7) for transmitting a late delivery message to the sender.
1) and the absence period set by the recipient and the delivery date of the received electronic data are compared, and when the delivery date is within the absence period, a message indicating that the recipient cannot process is sent to the sender. At least one of the means (absence detection mechanism 69) is provided to deliver electronic data.

[Procedure amendment 4]

[Document name to be amended] Statement

[Name of item to be corrected] 0019

[Correction method] Change

[Correction content]

Next, the operation will be described. The slip 5 generated at the global electronic data processing node 1 is subjected to a process such as a stamp at a necessary department (local electronic data processing node 2). The slip 5 takes the form of an attributed slip according to the conventional method shown in FIG. However, the destination of the attribute information 19 is only the one corresponding to the global electronic data processing node 1. The global electronic data processing node 1 that has received the processing request transmits the slip 5 to the local electronic data processing node 2 in its own local area 24. The local electronic data processing node 2 sends the slip 5 to the local electronic data processing node 2 or the global electronic data processing node 1 in the local area 24. When the processing in the local area 24 is completed, the global electronic data processing node 1 passes the slip 5 to the global electronic data processing node 1 in another local area 24. Similar processing is performed in another local area 24, and the slip 5 is delivered to the next local area 24. In this way, the slips are sequentially sent and necessary processing is performed.

[Procedure Amendment 5]

[Document name to be amended] Statement

[Correction target item name] 0046

[Correction method] Change

[Correction content]

Further, in the above embodiment, the rearrangement operation 42 of the processing waiting queue is performed when a new slip arrives. This timing can be changed, for example, the rearrangement operation 42.
Since the processing of (1) is constantly moving, the sorting can be performed at regular time intervals. With this method, it is possible to prioritize processing deadlines more efficiently.

[Procedure Amendment 6]

[Document name to be amended] Statement

[Correction target item name] 0048

[Correction method] Change

[Correction content]

Further, in the above embodiment, the rearrangement operation 42 of the processing waiting queue is performed when a new slip arrives. This timing can be changed, for example, the rearrangement operation 42.
Since the processing of (1) is constantly moving, the sorting can be performed at regular time intervals. With this method, it is possible to prioritize processing deadlines more efficiently.

[Procedure Amendment 7]

[Document name to be amended] Statement

[Correction target item name] 0050

[Correction method] Change

[Correction content]

Further, in the above embodiment, the rearrangement operation 42 of the processing waiting queue is performed when a new slip arrives. This timing can be changed, for example, the rearrangement operation 42.
Since the processing of (1) is constantly moving, the sorting can be performed at regular time intervals. In this method, it is possible to prioritize processing deadlines more efficiently.

[Procedure Amendment 8]

[Document name to be amended] Statement

[Correction target item name] 0083

[Correction method] Change

[Correction content]

[0083]

Effects of the Invention According to the present invention, electronic delivery of data by dividing the electronic data processing node line of the Hare multiple local area, electrons between the local area and the plurality of electronic data processing nodes It is divided into a global electronic data processing node in the local area for delivering data and a local electronic data processing node in the local area for delivering electronic data between other local electronic data processing nodes in the local area, Power between local areas
Attached to the delivery information table or slip indicating the destination etc. of the child data
Based on the added attributes, we will deliver between local areas,
Delivery information indicating the destination of electronic data in the local area
Based on the attributes added to the report table or slip, local error
Since electronic data is delivered in the same way as in-rear delivery, it is possible to easily specify the delivery route for each electronic data such as slips, easily modify the delivery route, reduce the transmission message, etc. The effect is obtained.

[Procedure Amendment 9]

[Document name to be amended] Statement

[Correction target item name] 0084

[Correction method] Change

[Correction content]

[0084] claimed according to the invention of claim 2, electrostatic delivery of child data divides the electronic data processing node line of the Hare multiple local area, the plurality of electronic data processing node of the electronic data between the local area It is divided into a local electronic data processing node in the local area for delivering electronic data and a local electronic data processing node in the local area for delivering electronic data between other local electronic data processing nodes in the local area. Electron between
Add to the delivery information table or slip that indicates the destination of data
Based on the specified attributes, delivery between local areas is performed,
-Delivery information indicating the destination of electronic data in the local area
Based on the attributes added to the table or slip, local error
In addition to the internal delivery, a group node that performs parallel processing of delivery and a hierarchical node that hierarchizes the local area are introduced, and the priority of incoming electronic data is determined by the type of electronic data. Priority management means to decide and manage, time management means to compare the delivery date specified by the sender and the current date and time and send a late delivery message to the sender when the delivery date has passed the current date and time, and receive The absentee detection means that compares the absence period set by the person with the delivery date of the received electronic data, and when the delivery date is within the absence period, sends a message indicating that the recipient cannot process to the sender. Since at least one means is provided to deliver electronic data, in addition to the above effects, setting of a substitute recipient, confirmation of reception from a plurality of delivery destinations, recipient Prioritization of incoming messages by, can automatically notification etc. of late delivery of the caller, therefore, the electronic data processing there is an advantage that it more efficient.

[Procedure Amendment 11]

[Document name to be corrected] Drawing

[Name of item to be corrected] Figure 2

[Correction method] Change

[Correction content]

[Fig. 2]

─────────────────────────────────────────────────── ─── Continuation of the front page (51) Int.Cl. ⁵ Identification number Reference number within the agency FI Technical display location H04L 12/58 (72) Inventor Hideaki Kanekata 5-1-1 Ofuna, Kamakura-shi Mitsubishi Electric Corporation Information Electronics Laboratory (72) Inventor Hiroshi Horikawa 5-1-1, Ofuna, Kamakura-shi Mitsubishi Electric Corporation Information Electronics Laboratory (72) Inventor Hironao Ozu 5-1-1, Ofuna, Kamakura-Mitsubishi Electric Corporation Information Electronics In-house (72) Inventor Yasutada Nagano 5-1-1, Ofuna, Kamakura-shi In Mitsubishi Electric Co., Ltd. Information Electronics Laboratory (72) Inventor Toshiro Uchiyama 5-1-1, Ofuna, Kamakura-shi In-house Electronics & Electronics Laboratory (72) Inventor Koji Okamura 5-1-1, Ofuna, Kamakura-shi Mitsubishi Electric Corporation Stock Electronics Research Laboratory (72) Inventor Hatsumi Nakano Cang City Ofuna Chome No. 1 No. 1 Mitsubishi Electric stock company information in an electronic Institute (72) inventor Yokosato Junichi Kamakura Ofuna Chome No. 1 No. 1 Mitsubishi Electric Co., Ltd. Information and Electronics Research Institute in

Claims (2)

[Claims] 1. In an electronic data delivery system for delivering electronic data such as electronic mail between local areas, a delivery information table indicating a destination etc. of electronic data is provided for each of a plurality of electronic data processing nodes for delivering and processing electronic data. And the plurality of electronic data processing nodes are divided into local areas, and the plurality of data processing nodes are provided in the local area for distributing and processing electronic data between the local areas, and a local area. An electronic data delivery system characterized in that the electronic data is delivered separately to a local electronic data processing node in a local area for delivering and processing electronic data to and from other local electronic data processing nodes in the inside. 2. In an electronic data delivery system for delivering electronic data such as electronic mail between local areas, a delivery information table indicating destinations of electronic data is provided for each of a plurality of electronic data processing nodes for delivering and processing electronic data. And the plurality of electronic data processing nodes are divided into local areas, and the plurality of data processing nodes are provided in the local area for distributing and processing electronic data between the local areas, and a local area. In addition to the local electronic data processing node in the local area for delivering and processing electronic data with other local electronic data processing node in the
A group node that performs parallel processing of delivery and a hierarchical node that hierarchizes the local area are introduced, and a priority management means that determines and manages the priority of incoming electronic data based on the type of electronic data, and transmission. The time management means to compare the delivery date specified by the person with the current date and time, and send a late delivery message to the sender when the delivery date has passed the current date and time, and the absent period set by the recipient and the received electronic data. The delivery date of the electronic data is provided by comparing at least one of the absentee detection means for transmitting a message indicating that the recipient cannot process to the sender when the delivery date is within the absent period by comparing An electronic data delivery system characterized by carrying out.