JP2000244552A - File transferring device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To satisfy the requesting condition of a file transmitting person and to transfer a file without receiving influence of congestion in a network by deciding a file transferring time in accordance with a prescribed request condition to transmit a file transfer executing instruction to a file transferring means to execute file transfer at the designated time. SOLUTION: A scheduling means (e) retrieves a transmitting-person nearest file transferring means and a receiving-person nearest file transferring means from a user table. Next, a line existing between both of these transferring means is retrieved from a route table. Next, a time required for transferring is calculated by the capacity and line speed of the group of the transmission files of the transmitting-person. Then, a time band in which all the lines can be used for the transferring time is retrieved before the time of completing transfer desired by the transmitting-person by referring to a line reservation situation table and a line capacity table. When such a time band exists, using of the line in the time band is reserved for the transmitting-person (a) and written in a data base D10.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention is used for communication for transmitting and receiving files via a communication network. The present invention is suitable for use in a communication network in which a band is shared by a plurality of communications.

[0002]

2. Description of the Related Art A communication network used in a conventional file transfer technique is a best-effort communication network in which a plurality of communications share a band at the same time, or a connection is established between terminals when communication is performed and communication is completed. There is a circuit switching network to be disconnected or a dedicated line.

[0003] The file transfer method is a method such as FTP which transfers a file directly from a sender terminal to a receiver terminal, or via a plurality of relay servers existing on a path from a sender terminal to a receiver terminal. E-mai while transferring
1 is used.

[0004]

In file transfer using a best-effort communication network, it is not possible to specify a file arrival time limit due to the influence of congestion in the communication network.

On the other hand, in file transfer using a dedicated line type communication network, the line cost is constant irrespective of the size of the file to be transferred, so that it becomes expensive when the transfer capacity is small and the transfer frequency is small.

In the case of circuit-switched file transfer, connection may not be established due to congestion in the network.

[0007] Even when such a conventional technique is combined to realize a file transfer method in which a plurality of mail servers are connected by a dedicated line, the load on the mail server increases as the file transfer amount increases. There's a problem. Further, in the conventional file transfer method, advance reservation for transfer cannot be performed.

SUMMARY OF THE INVENTION The present invention has been made in view of such a background, and a file which satisfies the requirements of a file sender and can perform low-cost file transfer without being affected by congestion in a network. It is an object to provide a transfer device.

[0009]

SUMMARY OF THE INVENTION The present invention relates to a file transfer apparatus having file transfer means for mutually transmitting and receiving files between a plurality of points via a communication network capable of sharing a transmission path among a plurality of users. It is.

Here, the features of the present invention include a file receiving means for receiving a file from a user having a file to be transmitted, a request receiving means for receiving a request condition relating to a file transfer to be performed from the user, File transfer means for transferring a file addressed to the user to a user, and scheduling means for determining an execution time of the file transfer, wherein the scheduling means comprises:
Means for determining a file transfer time according to the request condition obtained by the request receiving means and transmitting a file transfer execution instruction to the file transfer means, wherein the file transfer means transfers the file at a time designated by the scheduling means. Is included.

[0011] Thus, the scheduling means compares a plurality of file transfers, and executes the one whose arrival deadline is approaching first, or selects the one to be executed based on advance reservation, so that a plurality of users can be transferred. Thus, it is possible to satisfy user requests such as an arrival deadline and advance reservation while sharing a transmission path.

That is, as in the conventional file transfer using a best-effort network, the transmission path is shared by a plurality of users to perform the file transfer. Designation of an arrival deadline and advance reservation which are impossible by transfer are realized.

As described above, the transmission path is shared by a plurality of users while satisfying the user's request by the scheduling means, so that the transmission is performed at a lower cost as compared with the conventional file transfer using a dedicated line. File transfer that satisfies the requirements of the user is realized.

[0014] The file receiving means may include means for receiving a file via a communication network, and the file transfer means may include means for transmitting the file via a communication network.

[0015] The request accepting means is means for receiving information on a delivery destination arrival deadline of a file from a user, means for inquiring to the scheduling means whether or not the received delivery destination arrival deadline can be achieved. Means for notifying the user of the answer to the inquiry.

Thus, the request accepting means inquires of the scheduling means whether or not the delivery destination arrival deadline can be attained, and notifies the user in advance of the answer, whereby the user changes the arrival deadline. And file transfer using another means such as physical transportation.

Preferably, the request receiving means includes means for receiving a request condition relating to file transfer from the user at another time before the file receiving means receives a file from the user.

Thus, at another time before the file receiving means receives the file, the request receiving means receives the request condition relating to the file transfer from the user.
The user can make an advance reservation for the transfer of a file that is determined to be transmitted in advance.

The file accepting means includes means for dividing the received file into a plurality of parts, and the scheduling means includes means for individually determining a transfer time for each of the divided file parts. It is preferable that the transfer means includes means for reintegrating the divided files.

That is, as a result of allocating the line use time to a plurality of file transfers by the scheduling means, there is a possibility that a divided idle time may occur between the end of one transfer and the start of the next transfer. . In the present invention, such a vacant time can be effectively used by dividing a large file and transferring each part individually.

[0021]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment of the present invention will be described with reference to FIGS. FIG. 1 is a diagram showing a first system configuration example of the present invention. FIG. 2 is a diagram showing a second system configuration example of the present invention. FIG. 3 is a diagram showing a third system configuration example of the present invention. 1 and 2, the server S
1 and S2 are connected to the line connection device 1 via the lines 1 and 2.
0, and the scheduling means e
10 is provided. In FIG. 3, servers S1 to S4 are connected by a line connection device 20 via lines 1 to 4,
The scheduling means e is provided in the server S10. Here, the sender a (t abe) is the receiver h (kawasima)
An example in which a file is transferred to a server will be described.

According to the present invention, a sender nearest file transfer means d for transmitting and receiving a file between two points via a best-effort communication network N which allows a plurality of users to share a transmission path, and a receiver This is a file transfer device provided with the latest file transfer means f in the servers S1 and S2.

Here, the feature of the present invention is that the server S1 receives a file from a user having a file to be transmitted and receives a file from the user, and a request from the user to receive a request condition relating to file transfer to be performed. The receiving means b, the server S2 includes a file transfer means g for transferring a file addressed to the user to the user, and the server S10 includes a scheduling means e for determining an execution time of the file transfer. Determines the file transfer time according to the request condition obtained by the request receiving means b, and transmits a file transfer execution instruction to the sender's latest file transfer means d. The sender's latest file transfer means d is designated by the scheduling means e. File transfer at the specified time.

As shown in FIG. 2, file receiving means c
Receives a file via the communication network N1, and the file transfer means g can also transmit the file via the communication network N2.

[0025]

An embodiment of the present invention will be described with reference to FIG. FIG. 4 is a sequence diagram showing the operation of the file transfer device of the present invention. The sequence shown in FIG. 4 can be applied to any of the system configuration examples shown in FIGS. 1, 2, and 3. As shown in FIG. 4, the sender “a” notifies the request receiving means “b” of the server S1 of file transfer requirements such as file destination and file arrival time designation (ST).
1). At the same time, the file is transferred to the file receiving means c of the server S1 (ST1). At this time, separately from the file itself, only the required conditions can be notified in advance. In this case, the upper limit of the capacity of the file group to be transferred is also one of the required conditions. In addition, the user can set a deadline for the arrival of the file in the requirement. In addition, it is possible to set a required condition that the idle time of the line is used. Multiple files can be associated with one requirement. In the case of the system configuration example shown in FIG. 2, the request receiving means b may receive a request via the communication network N1. Further, the file receiving means c is also the communication network N
1 may be received.

The request receiving means b notifies the scheduling means e of the server S10 of the request condition (ST2). FIG. 5 shows an example of the message at that time. As shown in FIG.
In the message, destination: recipient h, desired transfer time: 1999
On January 1, the file size is described as 1 GB.
FIG. 6 shows an example of information stored in the database D10 of the server S10 having the scheduling means e. As shown in FIG. 6A, the database D10 describes a user ID, a corresponding password, a group, a mail address, and a nearest server as a user table. As shown in FIG. 6B, a line ID and a corresponding number of simultaneous communicables are described as a line capacity table. As shown in FIG. 6C, a server serving as a start point, a corresponding server serving as an end point, and a line to be used are described as a route table. As shown in FIG. 6D, a reservation ID, a corresponding sender, receiver, transfer start date and time, transfer end date and time, and file size are described as a reservation table. As shown in FIG.
A reservation number, a corresponding line ID, a use start date and time, and a use end date and time are described as a line reservation status table.

The scheduling means e searches the user table for the nearest file transfer means d and the nearest file transfer means f, which are the nearest file transfer means for the sender a and the receiver h. Next, a line existing between the sender latest file transfer means d and the receiver latest file transfer means f is searched from the route table. Next, the time required for transfer is calculated from the capacity of the transmission file group of the sender and the line speed. Next, by referring to the line reservation status table and the line capacity table, a time zone in which all the lines can be used for the transfer time is searched before the transfer completion time desired by the sender (ST3). If such a time zone exists, the use of the line in the time zone is reserved for the sender a and written into the database D10 (ST4).

FIG. 7 is a diagram showing an example in which the divided free time is utilized by dividing a file. When it is not possible to reserve the calculated time period continuously, as shown in FIG.
A search is made as to whether the file can be divided and transferred intermittently during the reserved free time. First, the line use right is assigned preferentially to the file transfer with the specified arrival time, then the file transfer with the specified arrival time limit is assigned, and finally the file transfer using the free time is assigned. Can be scheduled so that there is no waste in the usage rate.

In the example of FIG. 7, after allocating files A, B, C, D, and E for which the arrival time or the arrival time limit is specified, the file is divided using the divided free time generated there. File F is being transferred.

When the reservation is completed, the scheduling means e notifies the sender nearest file transfer means d of the file to be transmitted, the transmission destination, and the transmission start time (S
T5), the completion of the reservation is notified by also notifying the request receiving means b of the transmission start time (ST6). If the reservation is not possible, the scheduling means e notifies the request receiving means b that the reservation could not be made. The request receiving means b notifies the sender a of the availability of the reservation (ST7).

The sender latest file transfer means d transfers the file to the recipient latest file transfer means f as planned by the scheduling means e (ST8).

The file transfer means g instructs the nearest file transfer means f, and the nearest file transfer means f transfers the file addressed to the recipient to the recipient h of the file (ST9). At that time, in the case of the system configuration example shown in FIG. 2, the file is transferred via the communication network N2.

When the file is divided and transferred, the file accepting means c can divide the file and the file transferring means g can reintegrate the file.

[0034]

As described above, according to the present invention,
It is possible to perform a low-cost file transfer that satisfies the requirements of the file sender and is not affected by congestion in the network.

[Brief description of the drawings]

FIG. 1 is a diagram showing a first system configuration example of the present invention.

FIG. 2 is a diagram showing a second system configuration example of the present invention.

FIG. 3 is a diagram showing a third system configuration example of the present invention.

FIG. 4 is a sequence diagram showing the operation of the file transfer device of the present invention.

FIG. 5 is a diagram showing an example of a message.

FIG. 6 is a diagram showing an example of information stored in a database.

FIG. 7 is a diagram showing an example in which a divided free time is utilized by file division.

[Explanation of symbols]

 1 to 4 lines S1 to S4, S10 Server N, N1, N2 Communication network D1, D2, D10 Database 10, 20 Line connection device

 ────────────────────────────────────────────────── ─── Continued on the front page (72) Inventor Junichi Oka 3-19-2 Nishi-Shinjuku, Shinjuku-ku, Tokyo F-term in Nippon Telegraph and Telephone Corporation (reference) 5B082 HA05 5B089 GA11 GA21 GB04 HA01 JA32 JB18 KA13 KB11 KB14 KE01 5K030 GA19 HA05 KA06 KA07 KA21 LD11 LD18 LE14

Claims (5)

[Claims] 1. A file transfer device having a file transfer means for mutually transmitting and receiving a file between a plurality of points via a communication network capable of sharing a transmission path among a plurality of users. File receiving means for receiving a file from a user, request receiving means for receiving a request condition relating to file transfer to be performed from the user, file transferring means for transferring a file addressed to the user to the user, and execution time of the file transfer Scheduling means for determining a file transfer time according to the request condition obtained by the request receiving means, and transmitting a file transfer execution instruction to the file transfer means. The transfer means transfers the file at the time designated by the scheduling means. A file transfer device comprising means for executing a file transfer. 2. The file transfer device according to claim 1, wherein the file receiving unit includes a unit that receives a file via a communication network, and the file passing unit includes a unit that transmits the file via a communication network. . 3. The request receiving means includes: means for receiving information about a delivery destination arrival deadline of a file from a user; and means for inquiring the scheduling means whether the received delivery destination arrival deadline can be achieved. 2. The file transfer device according to claim 1, further comprising: means for notifying a user of an answer to the inquiry. 4. The file transfer apparatus according to claim 3, wherein said request receiving means includes means for receiving a request condition relating to file transfer from a user at another time before said file receiving means receives a file from a user. 5. The file receiving unit includes a unit that divides a received file into a plurality of parts, the scheduling unit includes a unit that individually determines a transfer time for each of the divided file parts, 2. The file transfer apparatus according to claim 1, wherein the means for transferring the file includes means for integrating the divided files again.