JP2007200355A - Information processing system, information processor, access distribution method and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide an information processing system handling data transfer requests from clients to a server and transmitting data from the server to the clients according to the data transfer request, an information processor, an access distribution method, and a program, in which communication between the server and the clients can be efficiently performed. <P>SOLUTION: In the information processing system adapted to perform data transfer requests from the clients to the server and transmit data from the server to the clients according to the data transfer request, the server extracts a client who is to access the server, sets an access time for the extracted client so as not to compete with requests from other clients and reports the set access time to the client, and the client accesses the server at the access time reported from the server. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to an information processing system, an information processing apparatus, an access distribution method, and a program, and in particular, information processing for making a data transfer request from a client to a server and transmitting data from the server to the client in response to the data transfer request The present invention relates to a system, an information processing apparatus, an access distribution method, and a program.

  FIG. 1 shows a block diagram of a client-server system.

  In the client-server system 1, a plurality of clients 11-1 to 11-n can access the server 13 via the network 12 and acquire desired data. In such a system, there is a case where data and programs are collected by periodically accessing the server 13 from the clients 11-1 to 11-n in order to update data and programs. Conventionally, the access time from the clients 11-1 to 11-n to the server 13 can be set by the clients 11-1 to 11-n according to the operation time of the clients 11-1 to 11-n.

  FIG. 2 is a diagram for explaining the operation of a conventional client-server system. FIG. 2A shows a response between a client and a server in the case of a rejection response, and FIG. 2B shows a response in the case of a normal response.

  First, the operation at the time of rejection response will be described.

  When a data request is made from one of the clients 11-1 to 11-n to the server 13 in step S1-1, the server 13 sends a data request from the client 11-i in step S1-2. When received, it is determined whether or not data transfer is possible. If the server 13 is busy in step S1-2 and data transfer to the client 11-i cannot be performed, an NG (no good) response is notified from the server 13 to the client 11-i in step S1-3.

  When an NG response is notified from the server 13, the client 11-i counts a predetermined time in step S 1-4, and requests data again in step S 1-5 after the predetermined time has elapsed.

  Next, the operation at the time of normal response will be described.

  When a data request is made from one of the clients 11-1 to 11-n to the server 13 in step S1-11, the server 13 sends a data request from the client 11-i in step S1-12. When received, it is determined whether or not data transfer is possible. If the server 13 is ready for data transfer in step S1-12, an OK response is notified from the server 13 to the client 11-i in step S1-13, and the request data is transmitted to the client 11-i.

  When an OK response and request data are transmitted from the server 13, the client 11-i notifies the server 13 of a completion report in step S1-14.

  As described above, when the server 13 is busy, the client 11-i notifies the data request at regular intervals until the data transfer from the server 13 becomes possible.

  The clients 11-1 to 11-n are provided with a function that allows the administrator to set the access time to the server 13.

  However, when the administrator on the client side sets the access time, the work time is the same for all clients, so the time required for access is concentrated, the access to the server is concentrated, and the server temporarily limits its processing capacity. May be exceeded. Conversely, server resources may be vacant during times of no access. As described above, there is a problem that the resources of the server are not used efficiently.

  When access to the server is concentrated and the processing capacity limit is temporarily exceeded, the server sends a rejection response for retrying the client as shown in FIG. Conventionally, since this retry interval is performed at regular intervals, if a state where access is concentrated continues, when the data request is retried, there is a possibility of receiving a rejection response from the server again.

  In addition, a client who luckily retries at the moment when the server is free will receive a service before a client who has continued to retry. Therefore, there is a problem that a service bias such as data transfer occurs depending on the retry timing of the client.

  If there is a large amount of data to be transferred between the client and server and the Internet is used between them, the available bandwidth on the Internet is uncertain, so the processing time for each client is uncertain. There was a problem that it was difficult to predict the server load.

  When the next retry time or time is specified from the server to the client, the retry time or time cannot be simply notified from the server because it is not possible to retry at that time for convenience of the client.

  When data resources common to clients stored in the server are changed, the clients are expected to request data transfer all at once at the next access. In this case, the server load is conventionally predicted only from the number of clients. However, because the processing capacity and communication bandwidth differ for each client, the end prediction is often uncertain, resulting in a load on the server. There was a problem that could not be controlled.

  The present invention has been made in view of the above points, and an object thereof is to provide an information processing system, an information processing apparatus, an access distribution method, and a program that can efficiently perform communication between a server and a client.

  The present invention relates to an information processing system that performs a data transfer request from a client to a server, and transmits data from the server to the client in response to the data transfer request. The server extracts a client to be accessed by the server, and the extracted client The access time is set so as not to conflict with requests from other clients, the set access time is notified to the client, and the client accesses the server at the access time notified from the server.

  The present invention also relates to an information processing system that makes a data transfer request from a client to a server, and transmits data from the server to the client in response to the data transfer request. The access time is set so that there is no rejection response, the set access time is notified to the client, and the client accesses the server at the access time notified from the server. The server is characterized in that the access time is compensated according to data attributes set in advance in data to be transmitted to the client.

  According to the present invention, in an information processing apparatus that transmits data to a client in response to a data transfer request from the client, the client that should perform data transfer is extracted, and the access time of the extracted client is set so that there is no rejection response. And an access management unit for notifying the client of the set access time. The access management unit is characterized in that the access time at which the client accesses the server is compensated according to data attributes set in advance in data transmitted from the server to the client.

  The present invention extracts a client to which data is to be transferred in an access distribution method of a system that makes a data transfer request from a client to a server and transmits data from the server to the client in response to the data transfer request. The access time is set so that there is no rejection response, the set access time is notified to the client, and the client is made to access the server at the access time notified from the server. Further, the access time at which the client accesses the server is compensated according to data attributes set in advance in data transmitted from the server to the client.

  Furthermore, the present invention is a program executed by a computer, wherein a client to which data transfer is to be performed is extracted, the access time of the extracted client is set so that there is no rejection response, and the set access time is set to the client To be notified. Further, it is characterized in that the access time at which the client accesses the server is compensated according to the data attribute preset in the data transmitted from the server to the client.

  As described above, according to the present invention, since the processing time of each client can be predicted even when a network such as the Internet is indeterminate between the client and the server, the optimum retry time can be set for the client. Can show. As a result, both the server and the client can communicate efficiently without applying an extra load.

  In addition, by prioritizing requests according to the number of retries from the client, it is possible to prevent a client having an extremely long service waiting from appearing.

  In addition, when data transfer requests are expected all at once from the access from the client, the end prediction is performed for each client, and the next access time of each client is changed by an instruction from the server, thereby reducing the load on the server. Control can be implemented reliably.

  FIG. 3 shows a system configuration diagram of the first embodiment of the present invention. In the figure, the same components as in FIG.

  In the system 100 of the present embodiment, the processing of the clients 101-1 to 101-n and the server 102 is different from the conventional one.

  FIG. 4 shows a block diagram of the client 101-i.

  The client 101-i is one of the clients 101-1 to 101-n, and includes an input unit 111, a CPU (central processing unit) 112, a ROM (read only memory) 113, a hard disk drive 114, a RAM (random). access memory) 115, CD-ROM drive 116, display unit 117, and communication unit 118. The input unit 111 includes a keyboard and a mouse, and is used for inputting data or commands. The CPU 112 executes various processes based on an OS (operating system), programs, and data stored in the ROM 113 and the hard disk drive 114. The hard disk drive 114 includes a program storage area 114a, a data storage area 114b, and an access information storage area 114c. The program storage area 114a stores an OS and a program. Various data are stored in the data storage area 114b. Access information such as the next access time is stored in the access information storage area 114c. The RAM 115 is used as a working storage area for the CPU 112. The CD-ROM drive 116 is a device that reads data from a removable recording medium such as a CD-ROM 119. For example, a program stored in the program storage area 114 a of the hard disk drive 114 is provided as storage data of the CD-ROM 119, read from the CD-ROM 119 by the CD-ROM drive 116, and stored in the program storage area 114 a of the hard disk drive 114. Installed. Note that the program stored in the program storage area 114 a of the hard disk drive 114 may be obtained from another server via the network 12 by the communication unit 118.

  The display unit 117 includes a cathode ray tube (CRT), a liquid crystal display (LCD), and the like, and displays processing data on the display screen. The communication unit 118 communicates with the server 102 via the network 12.

  Next, the configuration of the server 102 will be described.

  FIG. 5 shows a block diagram of the server 102.

  The server 102 includes an input unit 121, a CPU 122, a ROM 123, a hard disk drive 124, a RAM 125, a CD-ROM drive 126, a display unit 127, and a communication device 128.

  The input unit 121 includes a keyboard and a mouse, and is used for inputting data or commands. The CPU 122 executes various processes based on an OS (operating system), programs, and data stored in the ROM 123 and the hard disk drive 124. The hard disk drive 124 includes a program storage area 124a, a data storage area 124b, and an access information storage area 124c. In the program storage area 124a, a transfer program and access information for transferring data or a program from the data storage area 124b to the client 101 are created in response to a data request from the client 101, and an access information creation is stored in the access information storage area 124c. The program is stored. A management table created by the access information creation program is stored in the access information storage area 124c. The RAM 125 is used as a working storage area for the CPU 122. The CD-ROM drive 126 is a device that reads data from a removable recording medium such as a CD-ROM 129. For example, a program stored in the program storage area 124 a of the hard disk drive 124 is provided as storage data of the CD-ROM 129, read from the CD-ROM 129 by the CD-ROM drive 126, and stored in the program storage area 124 a of the hard disk drive 124. Installed. Note that the program stored in the program storage area 124 a of the hard disk drive 124 may be obtained from another server via the network 12 by the communication unit 128.

  The display unit 127 includes a cathode ray tube (CRT), a liquid crystal display (LCD), and the like, and displays processing data on a display screen. The communication unit 128 communicates with the client 102 via the network 12.

  In this embodiment, the server 102 determines the access start time, end time, data capacity, processing execution time, etc. according to the access from the clients 101-1 to 101-n by the program stored in the program storage area 124a. It is stored in the management table of the access information storage area 124c as access information, and the scheduled end time from the next access is predicted. The predicted end time is stored in the management table in the access information storage area 124c.

  6 and 7 show the configuration of the management table in the access information storage area 124c. FIG. 6 shows a state before a data transfer request from the clients 11-1 to 11-n, and FIG. 7 shows a state after a data transfer request from the clients 11-1 to 11-n.

  In the access information storage area 124c, information such as device information, start time information, end time information, data capacity information, execution time information, and transfer rate information can be stored for each client 11-1 to 11-n. The device information is information for identifying the clients 11-1 to 11-n. The start time information is a time when a data transfer request is made from the client 11-i. The end time information is the time when the data transfer to the client 11-i ends. The data capacity information is the capacity of data transferred to the client 11-i. The execution time information is a time taken for data transfer to the client 11-i. The transfer rate information indicates the data transfer rate to the client 11-i, and is determined by dividing the data capacity information by the execution time information.

  As shown in FIG. 7, each time there is a data transfer request from the clients 11-1 to 11-n, the above information is stored in the access information storage area 124c.

  Next, the end time prediction process executed by the CPU 122 of the server 102 will be described.

  FIG. 8 shows a flowchart of the end time prediction process.

  When there is an access to the server 102 from the client 101-i, the server 102 writes the transfer data capacity and start time requested for transfer in step S2-1 in the access information storage area 124c of the server 102. Subsequently, data transfer is started in step S2-2.

  In step S2-3, it is determined whether or not a data transfer request has been made in the past from the client 101-i. When there is a data transfer request from the client 101-i in the past in step S2-3, the transfer rate when the data was transferred in the past is stored as transfer rate information in the access information storage area 124c in step S2-4. Therefore, the end time is predicted from the transfer rate and the data transfer capacity stored in the access information storage area 124c in step S2-1. The end time is obtained by dividing the data transfer capacity by the transfer rate, and the end time is predicted by adding to the start time. If no data transfer request has been made in the past from the client 101-i in step S2-3, the end time is obtained by adding a preset end time default value to the start time in step S2-5.

  When the data transfer to the client 11-i is completed, in step S2-6, the server 102 writes the end time obtained in steps S2-4 and S2-5 in the access information storage area 124c. In step S2-7, the execution time is calculated, the transfer rate is obtained by dividing the data capacity by the real time, and the transfer rate in the access information storage area 124c is updated. This updated value is used next time.

  At this time, when the server 102 exceeds the number of clients that can be processed, the next retry time is obtained from the estimated end time of each of the clients 101-1 to 101-i obtained by the above method, and the client 11- Notify i. Thereby, load distribution in the server 102 can be achieved.

  FIG. 9 shows a sequence diagram at the time of rejection response of the first embodiment of the present invention.

  When there is a data request from the client 101-i to the server 102 in step S3-1, the server 102 determines whether or not data transfer is possible in step S3-2, and exceeds the number of clients that can be processed. When data transfer to i is impossible, the client 101-i is notified of the NG response and retry time information. The retry time information is the next data request time of the client 101-i and is obtained based on the access information storage area 124c. The method for obtaining the retry time information will be described in detail later.

  Upon receiving the NG response and retry time information from the server 102, the client 101-i waits until the retry time in step S3-3. When the retry time is reached, the server 102 is requested for data again.

  The server 102 determines whether or not data transfer is possible in step S3-5. At this time, since the retry time is set to a time at which data transfer is possible, request data from the client 101-i is transmitted to the client 101-i together with an OK response. When the client 101-i receives the request data and the OK response from the server 102, the client 101-i transmits a completion response to the server 102.

  Next, processing executed by the server 102 at the time of rejection response will be described in more detail.

  The server 102 manages the number of simultaneously connected clients and the estimated end time information based on the simultaneous connection management chain and the free client management chain.

  FIG. 10 is a diagram for explaining the operations of the simultaneous connection management chain and the empty client management chain. 10A is an initial state, FIG. 10B is a state in which the client 101-1 has accessed the server 102, and FIG. 10C is a state in which the number of client accesses has reached the number of clients that can be connected to the server 102 simultaneously. The states of the simultaneous connection management chain and the free client management chain are shown.

  In the initial state, that is, in the state where none of the clients 101-1 to 101-n is accessing the server 102, the start pointer of the simultaneous connection management chain is set to “none” as shown in FIG. . At this time, m free client management tables Te <b> 1 to Tem that can be connected to the server 102 are created in the server 102. The management tables Te1 to Tem are configured to include start time information, predicted end time information, device identification information, and pointer information.

  In the initial state, when there is a data request from the client 11-i at time “10:00”, the data request time is acquired as start time information of the client 11-i. Further, the predicted end time, for example, “10:08” is calculated based on the start time information, the data capacity information, and the transfer rate information. As a result, the simultaneous connection management table Tf1 as shown in FIG. 10B is created.

  At this time, the start pointer of the simultaneous connection management chain is set to point to the simultaneous connection management table Tf1. At this time, since no other clients are connected, the pointer of the simultaneous connection management table Tf1 is “none”. Since the empty client management table Te1 is used as the simultaneous connection management table Tf1, the number of empty client management tables is (m-1) from Te2 to Tem, and the start pointer of the empty client management table chain is the management table Te2. Is set to point to

  Next, when m clients are connected to the server 102 at the same time, a simultaneous connection management table chain composed of the management tables Tf1 to Tfm of the m clients connected as shown in FIG. Is done. At this time, since there is no empty client management table, the start pointer of the empty client management table chain is set to “none”.

  The server 102 manages the number of simultaneously connected clients and the estimated end time based on the simultaneous connection management table chain and the empty client management table chain as described above.

  FIG. 11 is a flowchart showing the operation of the server 102 at the time of a request from the client according to the first embodiment of this invention.

  When there is a request from the client 101-i in step S4-1, the start pointer of the empty client management table chain is read in step S4-2. In step S4-3, the server 102 determines whether or not the start pointer of the empty client management table chain is “none”. If the start pointer of the free client management table chain is not “None” in step S4-3, that is, if the free client management table still exists, the client 101-i can be connected. In S4-4, the free client management table Tei is reconnected to the simultaneous connection management table chain, and the start time information, the predicted end time information, and the identification information of the client 101-i are written into the reconnected simultaneous connection management table Tfi. Next, the server 102 transfers the request data to the client 101-i in step S4-5.

  When the server 102 finishes transferring the request data to the client 101-i, the server 102 sequentially searches the simultaneous connection management table chain from the start pointer in step S4-6 to obtain the management table Tfi of the client 101-i.

  In step S4-7, the management table Tfi of the client 101-i is replaced with an empty client management table chain, and the contents of the management table and the management tables before and after the management table are rewritten so that the chain continues.

  If the start pointer of the empty client management table chain is “None” in step S4-3, that is, if the client 101-i cannot connect to the server 102, then in step S4-8, the pointer of the simultaneous connection management table chain Is read out until the pointer of the management table becomes “none” in step S4-9. It is determined whether or not the pointer of the management table read in step S4-9 is “none”.

  If the pointer of the management table read in step S4-9 is not “none”, that is, if the management table is in the middle of the simultaneous connection management table chain, the end time information of the management table read in step S4-10 Is smaller than the earliest time area preset in the server 102. If the end time information of the management table read in step S4-10 is not smaller than the earliest time area preset in the server 102, then in step 4-13, from the current management table pointer to the next management table And returns to the process of step S4-9.

  If the end time information of the management table read in step S4-10 is smaller than the earliest time area set in the server 102, the final time of the management table is next larger than the next scheduled time in step S4-11. It is determined whether or not. If the end time of the management table is not greater than the scheduled retry time in step S4-11, the process proceeds to step S4-13. If the final time of the management table is larger than the scheduled retry time in step S4-11, the end time of the management table is written in the earliest time area in step S4-12, and the process proceeds to step S4-13.

  Steps S4-10 to S4-13 are repeated until the pointer of the simultaneous connection management table chain becomes “None”. When the pointer of the simultaneous connection management table chain becomes “None” in Step S4-9, in Step S4-14 The time in the earliest time area is returned as the retry time.

  FIG. 12 is a diagram for explaining the operation at the time of rejection response according to the first embodiment of the present invention. FIG. 12 shows an example in which the number of simultaneously connected clients is determined by setting, with the horizontal axis indicating time and the vertical axis indicating simultaneously connected clients. On the upper side of the vertical axis, the portion of “excess” indicates access exceeding the number of clients that can be connected simultaneously.

  When there is a data request from the client to the server 102, a search is made for a vacant place on the vertical axis in FIG. 12 at that time, and if it is vacant, the reserved time is reserved from there. In FIG. 12, shaded portions indicate reserved portions. The above operation is performed for the client that requested the connection. This is a case where the client 101-i is unable to connect to the server 102 at the time T0 when data is requested. From there, the client 101-i advances by unit time t0 and searches for an empty place on the vertical axis. Advance the time until there is a vacant place, and return a response with the found time as the next retry time. In this example, since there is a space in the portion indicated by the double line frame in FIG. 12, a response is returned with the time T0 as the next retry time.

  According to the present embodiment, since the connection to the server 102 is reserved, data can be reliably acquired when the client 101-i makes a data request again at the next retry time.

  In this embodiment, the server 102 manages the data transfer start time, end time, etc. of the client, but when the client makes a rejection notification at the time of data request, the number of retries is counted, and the server By determining the priority order of data requests from clients, service bias among clients may be reduced.

  An embodiment using a method in which the server determines the priority of data requests from clients based on the number of retries to reduce the service bias among clients will be described.

  The system configuration of this embodiment is the same as that of the first embodiment, and the configuration and processing of the clients 101-1 to 101-i and the configuration and processing of the server 102 are different from those of the first embodiment.

  FIG. 13 is a block diagram of a client according to the second embodiment of the present invention. In addition, the same code | symbol is attached | subjected to the same component as FIG. 4, and the description is abbreviate | omitted. The clients 101-1 to 101-n of this embodiment have a retry count management area 114d for managing the number of retries instead of the access information storage area 114c in the hard disk drive 114. The retry count management area 114d stores the retry count. The retry count stored in the retry count management area 114d is “0” in the initial state, and is incremented by 1 for each NG response.

  FIG. 14 shows a processing flowchart of the client according to the second embodiment of the present invention.

  First, when there is a data request to the server 102 in step S5-1, in step S5-2, the data request provided with the retry count information is transmitted to the server 102. In step S5-3, it is determined whether or not the response from the server 102 is an NG response. If the response from the server 102 is an NG response in step S5-3, the retry count of the retry count management unit is incremented by 1 in step S5-4. If the response from the server 102 is not an NG response in step S5-3, that is, if it is an OK response, the retry count of the retry count management unit is cleared to "0" in step S5-5.

  FIG. 15 is a block diagram of a server according to the second embodiment of the present invention.

  The server 102 of this embodiment has a client control area 201 in the hard disk drive 124 instead of the access information storage area 124c.

  The server 102 updates the setting of the client control area 201 based on the retry count information given to the data request from the clients 101-1 to 101-n. Further, the server 102 controls processing for data requests from the clients 101-1 to 101-n in accordance with settings from the client control area 201.

  FIG. 16 shows a data configuration diagram of the client control area 201.

  The client control area 201 includes a client number area 202 and a retry control area 203-0 to 203-n.

  The client number area 202 stores the number of clients currently processed. In the retry control area 203-0, the number of clients with a retry count of “0”, the retry control area 203-1, the number of clients with a retry count of “1”, and the retry control area 203-n with a retry count. “N” number of clients is stored. The server 102 performs the following process according to the client control unit 201.

  FIG. 17 shows a processing flowchart of the server according to the second embodiment of the present invention.

  When there is a data request by the nth retry from the client 101-i, the server 102 determines whether or not the number of clients that can be processed in step S6-1 is “0”. The client 101-i makes a data request to the server 102 by giving the number of retries when requesting the data. If the number of clients that can be processed in step S6-1 is “0”, the retry control area 201-n is incremented by 1 in step S6-2, and an NG response is returned to the client 101-i in step S6-3.

  If the number of clients that can be processed in step S6-1 is not “0”, the value obtained by subtracting the number of retries in the retry control area 202-n from the number of clients that can be processed in step S6-4 is greater than “0”. It is determined whether or not. That is, it is determined whether or not the server 102 can process. If the value obtained by subtracting the number of retries in the retry control area 202-i from the number of clients that can be processed in step S6-4 is not greater than “0”, steps S6-2 and S6-3 are executed.

  If the value obtained by subtracting the number of retries in the retry control area 202-i from the number of clients that can be processed in step S6-4 is greater than “0”, the number of clients stored in the client number area 202 in step S6-5. "-1".

  Next, in step S6-6, it is determined whether or not the client 101-i is accessing the retry count “0”. If the client 101-i does not access the retry count “0” in step S6-6, the retry count in the retry control area 203- (n−1) is set to “−1” in step S6-7. In step S6-8, the OK response and request data are transferred to the client 101-i. In step S6-9, the number of clients that can be processed in the client number area 202 is incremented by "+1".

  On the other hand, if the access is the retry count “0” in step S6-6, the process proceeds to step S6-8.

  18 and 19 are diagrams for explaining the specific operation of the second embodiment.

  At time t1, the server 102 performs processing based on access from the client 101-1. Next, at time t2, the server 102 performs processing based on access from the client 101-2.

  Next, there is an access from the client 101-3 at time t3. At this time, if the number of clients that can be simultaneously processed by the server 102 is “2”, two clients, the client 101-1 and the client 101-2, are already processing. return. The retry control area 203-0 is incremented by "+1". At this time, the retry control area 203-0 becomes “1”.

  When the processing of the client 101-1 is completed at time t <b> 4, the client number area 202 is decremented by 1 and becomes “1”. There is a non-retry access from the client 101-4 at time t5. At this time, since the retry control area 203-0 is “1” and there is a client 101-3 waiting for processing, the client 101-4 is not processed for access, and an error response is once returned. The retry control area 203-0 is incremented by "+1". Therefore, the retry control area 203-0 is “2”. When the processing of the client 101-2 is completed at time t6, the client number area 202 is decremented by 1, and becomes “2”.

  Next, when there is an access from the client 101-3 by the first retry at time t7, the retry control area 203-1 is "0", and there is no client waiting for a retry later. At this time, the number of clients area Since 202 is “2” and the number of clients capable of simultaneous connection processing is 2, the server 102 performs processing in accordance with access from the client 101-3. Since the processing of the client with the first retry count is performed, the retry control area 203-0 is decremented to "1".

  With the above operation, the retry access is accepted with priority over the access without retry.

  It should be noted that the time at which the request to the server 102 succeeds in each of the clients 101-1 to 101-n may be stored, and the load may be distributed by performing access at that time.

  Next, an embodiment will be described in which the time at which a request to the server 102 is succeeded by each of the clients 101-1 to 101-n is stored, and the load is distributed by accessing at that time.

  The system configuration is the same as that of the first embodiment, and the configuration and processing of the clients 101-1 to 101-n are different from those of the first embodiment. Further, the server 102 performs the same processing as the conventional server 13.

  FIG. 20 is a block diagram of the client 101-i according to the third embodiment of this invention. In the figure, the same components as those in FIG.

  The client 101-i of this embodiment has an access success time management area 114e.

  Next, processing of the client and 101-i will be described.

  FIG. 21 shows a flowchart of the client according to the third embodiment of the present invention.

  In step S7-1, it is determined whether the access success time has come. If it is determined in step S7-1 that the access success time stored in the access success management area 114e has come, the server 102 is accessed in step S7-2. In step S7-3, the client 101-i determines whether the response from the server 102 is an NG response. If the response from the client 101-i is not an NG response in step S7-3, that is, if it is an OK response, the processing is terminated as it is.

  When the response from the client 101-i is an NG response in step S7-3, a retry request for data request is performed on the server 102 after a predetermined time has elapsed in step S7-4. In step S7-5, it is determined whether the response from the server 102 is an NG response.

  When the response from the server 102 is an NG response in step S7-5, the process returns to step S7-4 and retry is performed again. If the response is OK in step S7-5, the retry time at that time is stored in the successful access management area 114e in step S7-6, and the process is terminated. Thus, at the next access, the server 102 is accessed at the access success time when the access is successful.

  Next, the operation of the third embodiment will be described using a specific example.

  22 and 23 are diagrams for operating a specific example of the third embodiment.

  At time t1, 10:02, there is a data transfer request from the client 101-i. At this time, the server 102 determines whether data transfer is possible. In this case, it is assumed that a rejection response is made.

  In response to the NG response from the server 102, the client 101-i performs a retry at times t2 and 10:04. At this time, the server 102 executes processing for the request from the client 101-i and sends an OK response to the client 101-i.

  After the transfer is completed, the client 101-i stores the times t3 and 10:04 at which the connection with the server 102 is successful in the access success management area 114e.

  Next, the client 101-i accesses the server 102 at time 10:04 stored in the access success management area 114e.

  According to this embodiment, the load on the server 102 can be distributed only by changing the processing on the client side.

  Note that when a retry is required beyond the time period during which the client can retry, a retry time may be set at random to avoid a retry request during an impossible time period.

  FIG. 24 shows a flowchart of a modification of the processing of the client according to the third embodiment of the present invention. In the figure, the same processing parts as those in FIG. 21 are denoted by the same reference numerals, and the description thereof is omitted.

  In this modified example, if the response is not an NG response in step S7-5, that is, if it is an OK response, it is determined in step S7-11 whether the access success time is an operation time zone. If the access success time is the operation time zone in step S7-11, the time when the retry was successful in step S7-6 is stored in the access success management area 124e as the access success time. If the access success time is not in the operation time zone in step S7-11, the access success time is randomly stored in the access success management area 124e in step S7-12.

  Next, the specific operation of this modification will be described with reference to the drawings.

  25 and 26 are diagrams for explaining the operation of a modification of the third embodiment of the present invention.

  First, at time t1, 16:57, there is a data transfer request from the client 101-i. At this time, the server 102 determines whether data transfer is possible and makes a rejection response.

  The client 101-i performs a retry at time t2, 16:59. The server 102 accepts a request at the time of retry.

  After the transfer is completed, the client 101-i determines whether or not the time t2, 16:59 when the connection with the server 102 is successful is in the operation time zone. The operation time zone is set, for example, one hour before the operating time range. If the time t2 is out of the operation time zone, the access time is selected at random, and the access success management area 124e is rewritten. For example, here, it is rewritten at time t3, 13:00.

  According to the present embodiment, processing can be performed at a time when access is successful within a preset operation time zone.

  When the server data is updated, the server schedules the request from the client in advance, and notifies the client side of the schedule so that the load can be distributed.

  An embodiment will be described in which when the server data is updated, the server schedules a request from the client in advance and notifies the client side of the request to distribute the load.

  Since the system configuration of this embodiment is the same as that of the first embodiment, the description thereof is omitted. The present embodiment has the same configuration as that of the conventional client 11, and the processing is different, and the configuration and processing of the server 102 are different from the first embodiment.

  In this embodiment, data resources common to the clients are placed on the server, and when the data resources are changed on the server side, the load is distributed when the clients make data transfer requests at the same time for the next access.

  First, the configuration of the server 102 will be described.

  FIG. 27 is a block diagram of a server according to the fourth embodiment of the present invention. In the figure, the same components as those in FIG.

  The server 102 of this embodiment has a data resource target management area 124f and a schedule table management area 124g instead of the access information storage area 124c.

  The data resource target management area 124f is a table in which the correspondence between the data resource and the target client is associated. The schedule table management area 124g stores an access schedule of a client that is a target of data resource change.

  FIG. 28 shows a data configuration diagram of the schedule table management area 124g.

  The schedule table management area 124g stores a processing schedule table of the server 102. As shown in FIG. 28, the processing schedule table has a configuration in which access times of the target clients 101-11 to 101-26 among the clients 101-1 to 101-i are set.

  First, the overall processing flow of the fourth embodiment will be described.

  FIG. 29 shows a process flowchart of the fourth embodiment of the present invention.

  If there is a data resource change in step S8-1, a client that is affected by the data resource change is extracted based on the data resource target management area 124f in step S8-2.

  In step S8-3, the client start and end times extracted in step S8-2 are calculated.

  FIG. 30 shows a process flowchart for calculating the start and end times of the client.

  When there is a request from the extraction of the client that is the target of the data resource change, the start pointer of the empty client management table chain is read in step S9-1. Next, in step S9-2, the server 102 determines whether or not the start pointer of the empty client management table chain is “none”. If the start pointer of the empty client management table chain is not “None” in step S9-2, that is, if there is an empty client management table, the extracted client 101-i can be connected. In step S9-3, the free client management table Tei is reconnected to the simultaneous connection management table chain, and the start time information, the predicted end time information, and the identification information of the client 101-i are written in the reconnected simultaneous connection management table Tfi. . Next, in step S9-4, the server 102 determines whether or not there is no target client. If there is a target client in step S9-4, the process returns to step S9-2 for the next client 101-i among the clients extracted in step S9-5, and the process is executed.

  If the start pointer of the empty client management table chain is not “None” in step S9-2, the server 102 sequentially searches the simultaneous connection management table chain from the start pointer and extracts sequentially in step S9-6. Acquire the management table of the client. Also, the number of acquired management tables, that is, the number of clients is counted.

  Next, the contents of the management table acquired in step S9-7 are read and a pointer is acquired. It is determined whether or not the pointer of the management table acquired in step S9-8 is “not present”.

  If the pointer read from the management table acquired in step S9-8 is not “none” indicating that the simultaneous connection management table chain does not have a management table, that is, if the simultaneous connection management table chain continues thereafter, In step S9-9, it is determined whether or not the end time stored in the management table is smaller than the earliest end time so far. If it is determined in step S9-9 that the end time of the management table is smaller than the earliest end time, the end time of the management table is set as the earliest end time in step S9-10.

  Next, in step S9-11, the next management table is read from the management table pointer, and the process returns to step S9-8 and the same processing is performed until the management table pointer becomes "none". When the management table pointer becomes “none” in step S9-8, the server 102 writes the earliest end time set in step S9-10 to the start time of the management table acquired in step S9-6 in step S9-12. .

  Next, in step S9-13, the end time of the management table acquired in step S9-6 is predicted from the data capacity, transfer rate, and start time. For example, the end time is obtained by adding the result obtained by dividing the data capacity by the transfer rate to the start time. Next, in step S9-14, the management table acquired in step S9-6 is reconnected to the simultaneous connection management chain, and the process returns to step S9-4 to continue processing.

  By repeating the above operation, a schedule table can be created in which there is no client to be rejected as shown in FIG.

  Here, it returns to FIG. 29 again and continues description.

  When a schedule table as shown in FIG. 28 is created in step S8-3, it waits for a request from the client 101-i. When there is a request from the client 101-i in step S8-11, the server 102 extracts the start time of the client 101-i from the schedule table already created in step S8-4, and creates a definition file. In step S8-5, the server 102 notifies the client 101-i of the rejection file and the definition file created in step S8-4.

  Next, in step S8-12, the client 101-i rewrites the next request time with the time defined in the definition file.

  FIG. 31 is a diagram showing the request times set for the clients 101-1 to 101-n.

  For example, the next request time defined by the server 102 is set in the access information storage area 114c of the clients 101-1 to 101-n as shown in FIG.

  When the requested time is reached, the client 101-i makes a data request to the server 102 in step S8-13.

  When the server 102 receives the data request from the client 101-i in step 8-6, the server 102 transfers the requested data to the client 101-i. At this time, the request from the client 101-i is as shown in the schedule table, and the server 102 is in a processable state, so that data can be transferred without a rejection response.

  When the client 101-i completes receiving the request data in step S8-14, it notifies the server 102 of the completion report, and the process ends.

  According to this embodiment, when the server 102 accepts a request from the clients 101-1 to 101-n according to a predetermined schedule table, the clients 101-1 to 101-n receive a rejection response many times. You can receive the necessary data without Further, the server 102 can efficiently perform the process by proceeding according to the schedule table.

  In step S8-3 of this embodiment, when the schedule table shown in FIG. 28 is created, the end time is predicted by taking into account the data attribute, for example, the time depending on the presence or absence of encryption. Also good.

  FIG. 32 is a data structure diagram of the management table, and FIG. 33 is a diagram showing a schedule table. In the figure, the same components as those in FIGS. 6 and 28 are denoted by the same reference numerals, and the description thereof is omitted.

  A data attribute 301 is assigned to the management table 300 of this embodiment. The data attribute 301 is, for example, an encryption time as shown in FIG. When the schedule table shown in FIG. 33 is created based on the management table 300 shown in FIG. 32, the time obtained by adding the encryption time ta of the data attribute 301 to the calculated end time is set as the end time on the schedule table. .

  Thereby, since the end time can be predicted including the time consumed based on the data attribute 301 such as the encryption time ta, the end time can be accurately predicted.

  The present embodiment includes the following supplementary notes.

(Appendix 1)
In an information processing system that performs a data transfer request from a client to a server and transmits data from the server to the client in response to the data transfer request, the server receives a data transfer request from the client based on the data transfer request from the client. An information processing system comprising: an access management unit that creates access information indicating an access state and manages access from the client to the server based on the access information.
(Appendix 2)
The information processing system according to claim 1, wherein the server includes an access information notification unit that creates access information next time based on the access information stored in the access management unit and notifies the client of the next access information.
(Appendix 3)
The information processing system according to claim 2, wherein the client accesses the server based on the next access information from the server.
(Appendix 4)
The information processing system according to claim 1, wherein the server manages the number of accesses as the access information, and controls access permission from the client based on the number of accesses.
(Appendix 5)
The information processing system according to any one of appendices 1 to 3, wherein the access information includes a start time when access to the server from the client is started, an end time when access is ended, and a processing time thereof. .
(Appendix 6)
In an information processing system that makes a data transfer request from a client to a server, and transmits data from the server to the client in response to the data transfer request, the client sets at least the next access time to the server An information processing system characterized in that the time is set.
(Appendix 7)
6. The information processing system according to appendix 5, wherein the client sets a next access time at random when access fails at the set access time.
(Appendix 8)
In an information processing system for performing a data transfer request from a client to a server and transmitting data from the server to the client in response to the data transfer request, the server extracts a client to be accessed, and the extracted client Information processing characterized in that an access time is set so that there is no rejection response, the set access time is notified to the client, and the client accesses the server at the access time notified from the server. system.
(Appendix 9)
The information processing system according to claim 8, wherein the server compensates the access time according to a data attribute preset in data to be transmitted to the client.
(Appendix 10)
An information processing apparatus that transmits data to a client in response to a data transfer request from a client causes access information indicating an access state from the client to be created based on the data transfer request from the client, and based on the access information And an access management unit that controls access from the client so as to distribute access from the client.
(Appendix 11)
11. The information processing apparatus according to appendix 10, wherein the access management unit creates a next access time of the client based on the access information and notifies the client of the next access time.
(Appendix 12)
In an information processing apparatus that makes a data transfer request to a server and transfers data corresponding to the data transfer request from the server, an access management unit that sets a time when the access to the server is successful as a next access time of the client An information processing apparatus comprising:
(Appendix 13)
13. The information processing apparatus according to appendix 12, wherein the access management unit causes the next access time to be set at random when access to the server fails at the access time.
(Appendix 14)
In the information processing apparatus that transmits data to the client in response to a data transfer request from the client, the client that should perform data transfer is extracted, and the access time of the extracted client is set so that there is no rejection response. An information processing apparatus comprising: an access management unit that notifies the client of the access time that has been sent.
(Appendix 15)
15. The information processing according to claim 14, wherein the access management unit compensates the access time at which the client accesses the server according to a data attribute preset in data transmitted from the server to the client. apparatus.
(Appendix 16)
In an access distribution method of a system for making a data transfer request from a client to a server and transmitting data from the server to the client in response to the data transfer request, an access state from the client based on the data transfer request from the client The access distribution method is characterized in that access information is generated and control is performed so that access from the client is distributed based on the access information.
(Appendix 17)
The access distribution method according to appendix 16, wherein the next access time of the client is created based on the access information and notified to the client.
(Appendix 18)
18. The access distribution method according to appendix 17, wherein the server is accessed from the client at the next access time.
(Appendix 19)
In an access distribution method of a system in which a data transfer request is made from a client to a server, and data is transmitted from the server to the client in response to the data transfer request, a time when the access to the server is successful is determined as the next access of the client An access distribution method characterized by setting the time.
(Appendix 20)
The access distribution method according to claim 19, wherein when the client fails to access at the access time, a next access time is set at random.
(Appendix 21)
In the access distribution method of the system for making a data transfer request from a client to a server and transmitting data from the server to the client in response to the data transfer request, a client to be transferred is extracted, and the extracted client An access distribution method characterized in that an access time is set so that there is no rejection response, the set access time is notified to the client, and the client is made to access the server at the access time notified from the server. .
(Appendix 22)
The access distribution method according to claim 21, wherein the access time at which the client accesses the server is compensated according to a data attribute preset in data transmitted from the server to the client.
(Appendix 23)
Causing a computer to create access information indicating an access state from the client based on a data transfer request from the client, and controlling access from the client to distribute access from the client based on the access information A program characterized by that.
(Appendix 24)
24. The program according to claim 23, wherein a next access time of the client is created based on the access information, and the client is notified of the next access time.
(Appendix 25)
A system for making a data transfer request from a client to a server, and transmitting data from the server to the client in response to the data transfer request, wherein a time when the access to the server is successful A program characterized by having an access time set.
(Appendix 26)
The program according to appendix 25, wherein if the access to the server fails at the access time, the next access time is set at random.
(Appendix 27)
A program for causing a computer to extract a client to which data is to be transferred, causing the access time of the extracted client to be set so that there is no rejection response, and notifying the client of the set access time.
(Appendix 28)
28. The program according to claim 27, wherein the access time at which the client accesses the server is compensated according to a data attribute preset in data transmitted from the server to the client.

  In addition, this invention is not limited to the said Example, It cannot be overemphasized that a various modified example can be considered in the range which does not deviate from the summary of this invention.

It is a block block diagram of a client-server system. It is operation | movement explanatory drawing of the conventional client-server system. It is a system configuration figure of one example of the present invention. It is a block block diagram of client 11-i. 2 is a block configuration diagram of a server 102. FIG. It is a block diagram of the management table of the access information storage area 124c. It is a block diagram of the management table of the access information storage area 124c. It is a flowchart of an end time prediction process. It is a sequence diagram at the time of rejection response of 1st Example of this invention. It is a figure for demonstrating operation | movement of a simultaneous connection management chain and a vacant client management chain. It is an operation | movement flowchart of the server 102 at the time of the request from the client of 1st Example of this invention. It is operation | movement explanatory drawing at the time of the rejection response of 1st Example of this invention. It is a block block diagram of the client of 2nd Example of this invention. It is a processing flowchart of the client of 2nd Example of this invention. The block block diagram of the server of 2nd Example of this invention is shown. 3 is a data configuration diagram of a client control area 201. FIG. It is a process flowchart of the server of 2nd Example of this invention. It is a figure for demonstrating the specific operation | movement of 2nd Example of this invention. It is a figure for demonstrating the specific operation | movement of 2nd Example of this invention. It is a block block diagram of client 101-i of 3rd Example of this invention. It is a flowchart of the client of 3rd Example of this invention. It is a figure for operating the specific example of 3rd Example. It is a figure for operating the specific example of 3rd Example. It is a flowchart of the modification of the process of the client of 3rd Example of this invention. It is a figure for demonstrating operation | movement of the modification of 3rd Example of this invention. It is a figure for demonstrating operation | movement of the modification of 3rd Example of this invention. It is a block block diagram of the server of 4th Example of this invention. It is a data block diagram of the schedule table management area | region 124g. It is a process flowchart of 4th Example of this invention. It is a processing flowchart for calculating the start time and end time of a client. It is a figure which shows the request | requirement time set to the clients 101-1 to 101-n. It is a data block diagram of a management table. It is a figure which shows a schedule table.

Explanation of symbols

12 Network 100 System 101-1 to 101-n Client 102 Server 111, 121 Input unit 112, 122 CPU
113, 123 ROM
114, 124 Hard disk drive 114a, 124a Program storage area 114b, 124b Data storage area 114c, 124c Access information storage area 115, 125 RAM
116, 126 CD-ROM drive 117, 127 Display unit 118, 128 Communication unit 119, 129 CD-ROM disc

Claims (9)

In an information processing system for performing a data transfer request from a client to a server and transmitting data from the server to the client in response to the data transfer request,
The server extracts a client accessed by the server, sets the access time of the extracted client so as not to conflict with a request from another client, and notifies the client of the set access time. The information processing system is characterized in that the client accesses the server at an access time notified from the server. In an information processing system for performing a data transfer request from a client to a server and transmitting data from the server to the client in response to the data transfer request,
The server extracts a client to be accessed, sets the access time of the extracted client so that there is no rejection response, notifies the client of the set access time, and the client receives information from the server. An information processing system for accessing the server at a notified access time. The information processing system according to claim 2, wherein the server compensates the access time according to a data attribute preset in data to be transmitted to the client. In an information processing apparatus that transmits data to a client in response to a data transfer request from the client,
An access management unit that extracts a client that should perform data transfer, sets the access time of the extracted client so that there is no rejection response, and notifies the client of the set access time Information processing device. The information according to claim 4, wherein the access management unit compensates the access time at which the client accesses the server according to a data attribute preset in data transmitted from the server to the client. Processing equipment. In an access distribution method of a system for performing a data transfer request from a client to a server and transmitting data from the server to the client in response to the data transfer request,
A client to which data transfer is to be performed is extracted, the access time of the extracted client is set so that there is no rejection response, the set access time is notified to the client, and the access time notified from the server An access distribution method comprising causing the client to access the server. The access distribution method according to claim 6, wherein the access time at which the client accesses the server is compensated according to a data attribute preset in data transmitted from the server to the client. On the computer,
A program for extracting a client to which data is to be transferred, causing the access time of the extracted client to be set so that there is no rejection response, and causing the client to be notified of the set access time. 9. The program according to claim 8, wherein the access time at which the client accesses the server is compensated according to a data attribute set in advance in data transmitted from the server to the client.

Images