JP4769775B2 - Program, information processing apparatus, access distribution method, system - Google Patents

Description

  The present invention mainly relates to a technique for reducing the amount of communication on a network when a computer connected to the network downloads installation candidates via the network.

Conventionally, a technique in which a computer connected to a network downloads installation candidates via the network is known in which a user individually designates a download target and downloads all the installation candidates (for example, non-patent). Reference 1).
http: // windowsupdated. Microsoft. com /

  However, if all of the installation candidates are downloaded, even a computer that does not conform to its own program execution environment is downloaded. This means that useless communication occurs, and this increases the amount of communication on the network. An object of the present invention is to provide a technique for downloading only a computer suitable for its own program execution environment.

  The present invention has been made to solve the above-described problems, and sends a request including execution environment specifying information for specifying a program execution environment of the computer to a computer connected to the network via the network. Transmitting to a predetermined server; receiving a list including installation candidates that can be installed under the program execution environment specified by the execution environment specifying information from the predetermined server via the network; A program for executing the step of selecting from the list and the step of installing the selected installation candidate is provided.

  According to the present invention, a list including installation candidates that can be installed in a program execution environment of a predetermined computer is received from a predetermined server, and the installation candidates selected from this list are installed. Therefore, since only a computer that is compatible with its own program execution environment can be downloaded for a certain computer, useless communication by downloading even those that are not compatible with its own program execution environment as in the past. Occurrence can be prevented.

  In the program, for example, the execution environment specifying information includes information for specifying the model name of the computer and information for specifying an operating system installed in the computer. This is an example of execution environment specifying information. Therefore, the execution environment specifying information of the present invention is not limited to this, and can be other program execution environment specifying information.

In the above program, the installation candidate is a driver program. This is an example of an installation candidate. Therefore, the installation candidates of the present invention are not limited to this, and can be other installation candidates.

  In the above program, the list includes download destination addresses of installation candidates, and the selected installation candidates are downloaded from the download destination addresses and installed. In this way, since only necessary installation candidates can be downloaded, useless communication can be further prevented.

The present invention can also be specified as follows.
Acquiring a date related to an installation candidate in a computer; comparing a date related to the acquired installation candidate with a predetermined date; determining whether to install an installation candidate based on a result of the comparison; A program for executing a step of installing installation candidates determined to be installed.

In this way, it is possible to improve the determination accuracy as compared with the case of determining whether to install based on version comparison.
The present invention can also be specified as follows.

  Causing the computer to input predetermined information; converting the input predetermined information into an invisible character string obtained by combining the first invisible character and the second invisible character according to a predetermined rule; A program for executing the step of adding the converted invisible character string to a predetermined file.

  In this way, it is possible to prevent a customer who has browsed a predetermined file (a customer browsing document such as a Read Me file) from showing unclear symbols or the like. In other words, it is possible to provide predetermined information in a form that the user is not aware of in the infrastructure that has been visually recognized by the user, and to provide completely different information from the document to the program user based on this information.

  In the above program, for example, a step of acquiring a predetermined file, a step of extracting an invisible character string including a first invisible character and a second invisible character from the acquired predetermined file, the extracted The method further includes the step of converting the invisible character string into the original predetermined information according to a predetermined rule.

  In this way, it is possible to prevent a customer who has browsed a predetermined file (a customer browsing document such as a Read Me file) from showing unclear symbols or the like. In other words, it is possible to provide predetermined information in a form that the user is not aware of in the infrastructure that has been visually recognized by the user, and to provide completely different information from the document to the program user based on this information.

  In the program, for example, the predetermined information is a control code. This is an example of the predetermined information. Therefore, the predetermined information of the present invention is not limited to this, and can be other predetermined information.

Further, the present invention can be specified as follows.
Each time the number of days elapsed from a reference date exceeds a predetermined threshold, the computer connected to the network sets a timing later than the previous access timing as the next access timing through the network, A program for executing the step of accessing via the network at a set timing.

In this way, it is possible to distribute access generated from a plurality of computers.
Further, the present invention can be specified as follows.

A program for causing a computer connected to a network to execute a step of acquiring a start time of the program, and a step of accessing a predetermined server via the network at a timing obtained according to the acquired start time.
(Formula) Time of base time + (minute of base time + second of base time x factor 1) minute + (second of base time + millisecond of base time x factor 2) second + millisecond of base time + The program for performing the step which calculates offset time, and the step which accesses a predetermined | prescribed server via a network in the hour and minute which the said calculation result shows.

In this way, it is possible to distribute accesses that occur from a plurality of computers in approximate time.
In addition, the present invention can be specified as an apparatus invention as follows.

  An information processing apparatus connected to a network, a means for transmitting a request including execution environment specifying information for specifying its own program execution environment to a predetermined server via the network, specified by the execution environment specifying information Means for receiving an installation candidate that can be installed under the program execution environment from the predetermined server via the network, means for selecting an installation candidate from the list according to a predetermined condition, and selecting the selected installation candidate An information processing apparatus comprising means for installing.

Moreover, this invention can be specified as follows as invention of a method.
A method of installing in a computer connected to a network, the step of transmitting a request including execution environment specifying information for specifying a program execution environment of the computer to a predetermined server via the network, the execution environment specifying Receiving a list including installation candidates that can be installed under the program execution environment specified by the information from the predetermined server via the network, selecting an installation candidate from the list according to a predetermined condition, the selected An installation method comprising: installing an installation candidate.

  Further, the present invention can be specified as the system invention as follows. A system including an information processing apparatus and a predetermined server connected to a network, wherein the information processing apparatus sends a request including execution environment specifying information for specifying its own program execution environment via the network. Means for transmitting to a predetermined server; means for receiving a list including installation candidates that can be installed under the program execution environment specified by the execution environment specifying information from the predetermined server via the network; A system comprising: means for selecting from the list; and means for installing the selected installation candidate.

A system including an information processing apparatus and a predetermined server connected to a network, wherein the information processing apparatus sends a request including execution environment specifying information for specifying its own program execution environment via the network. Means for transmitting to a predetermined server; means for receiving a list including installation candidates that can be installed under the program execution environment specified by the execution environment specifying information from the predetermined server via the network; Means for selecting from the list; means for installing the selected installation candidate; and the predetermined server is specified by means for receiving a request transmitted from the information processing apparatus, and by execution environment specifying information included in the request Under the program execution environment System with information about the installation can be installed candidates, means for retrieving from a predetermined data base, means for transmitting to the information processing apparatus the search results as a list including the installation candidates.

  The predetermined server here is, for example, an existing server provided with each of the above means. In this way, the construction and operation of an automatic program update system using a network can be realized at low cost. That is, for example, using an existing server constructed so that the user can search and download various programs (installation candidates) such as drivers corresponding to the computer, the computer (user personal computer) updates the program via the network. Is possible.

  According to the present invention, it is possible to download only a computer suitable for its own program execution environment.

Hereinafter, an embodiment of the present invention will be described with reference to the drawings. FIG. 1 is a diagram for explaining a schematic configuration of a network system in the present embodiment.
As shown in FIG. 1, the network system in the present embodiment includes a device (also referred to as a client) 100 and a server 200 connected to a network N such as the Internet. The device 100 is a general information processing device such as a personal computer. The computer 100 is connected to a computer main body, an input device such as a keyboard and a mouse, a display device such as a display, a storage device such as a hard disk device, and a network N. A connected communication device or the like is provided. The apparatus 100 is installed with a predetermined program for realizing various processes described later. Although only one device 100 is shown in FIG. 1, a plurality of devices 100 are connected to the network N.

  The server 200 is a general information processing apparatus such as a workstation, and includes a computer main body, a storage device such as a hard disk device connected thereto, a communication device connected to the network N, and the like. An input device such as a keyboard and a mouse and a display device such as a display may be provided. The server 200 is installed with a predetermined program for realizing various processes described later.

Next, the operation of the network system configured as described above will be described with reference to the drawings. Hereinafter, the operations in the apparatus 100 and the server 200 are realized by reading and executing respective predetermined programs in the apparatus 100 and the server 200.
(Driver update process)
FIG. 2 is a sequence diagram for explaining the driver update processing. This sequence will be described on the assumption that the predetermined program of the present invention is executed and the apparatus 100 is operated by the control based thereon.

  When the device 100 detects a predetermined event after the predetermined program of the present invention installed therein is executed, the device 100 sends a request including execution environment specifying information for specifying its own program execution environment to the network N. To the server 200 (S100). Examples of the predetermined event include a transmission instruction input from an input device connected to the device 100 and a preset timing. The execution environment specifying information includes information for specifying the model name of the device 100, information for specifying an operating system installed in the device 100, and the like. These may be used alone or in combination.

  The server 200 receives a request from the apparatus 100 (S101), and relates to a driver (corresponding to an installation candidate of the present invention) that can be installed under the program execution environment specified by the execution environment specifying information included in the request. Information is retrieved from a predetermined database (S102). The predetermined database stores a correspondence relationship between execution environment specifying information (for example, information for specifying a model name and information for specifying an operating system) and information about a driver (driver name or the like). Therefore, the server 200 searches the information (driver name, etc.) related to the driver corresponding to the execution environment specifying information by collating the execution environment specifying information included in the request from the apparatus 100 with a predetermined database. (Narrowing down) is possible. The server 100 is an existing server that provides a searchable program such as a driver by the user. In the present invention, by using this existing server, a system for updating a program such as a driver of the apparatus 100 using the network is constructed at a low cost.

  When the information related to the driver is retrieved, the server 200 generates a driver list and transmits it to the requesting apparatus 100 (S103). The driver list is a list including information on drivers that can be installed in the program execution environment of the apparatus 100. As shown in FIG. 2, the driver list information includes a driver name, a driver download destination URL (Uniform Resource Locator), and a ReadMe file download destination URL corresponding to this driver. The driver is a program for extending the operating system so that various peripheral devices can be used. The Read Me file is a so-called text file in which various functions such as a driver-related function, applicable devices, precautions, revision history, and the like are described in so-called text.

  The device 100 receives the driver list from the server 200 (S104) and stores it in its own internal memory or the like. The device 100 determines whether there is a driver to be updated from the driver list according to a predetermined condition (S105). That is, the driver to be updated is selected. This is a process that is performed in order not to install such a driver again because it is not necessary to install again the same driver that is already installed in the device 100 among the drivers in the driver list. .

  It can be determined by various methods whether there is a driver to be updated. An example of this determination method will be described with reference to FIG. FIG. 3 is a flowchart for explaining determination processing by the apparatus 100. 4 has almost the same contents as FIG.

Upon receiving the driver list from the server 200 (S104), the apparatus 100 accesses the Read Me file download destination URL in the list and downloads the Read Me file. If a plurality of Read Me file download destination URLs are included in the list, each URL is accessed and a plurality of Read Me files are accessed.
The Me file is downloaded (S1040). As will be described later, the downloaded Read Me file includes a control code converted (encoded) into an invisible character string (such as the release date of the driver corresponding to the Read Me file).

The device 100 converts (decodes) the control code (publication date, etc.) converted into the invisible character string into the original control code (publication date, etc.) as described later (S1041). Then, the apparatus 100 compares the decoded release date with the system construction date (master creation date) stored in its own registry (S1042), and the Read downloaded earlier.
It is determined whether or not the Me file is new (S1043). Thus, since it determines based on date comparison, it becomes possible to raise determination accuracy compared with the case where it determines based on version comparison. This is because, for example, there is a bug in the latest version of the driver uploaded to the server 200. Therefore, if the old version of the driver is uploaded again, the version of the driver uploaded to the server 200 is determined in the apparatus 100 when the version is determined to be new or old. Is older than the version of the driver installed in itself, so that it is not downloaded from the server 200. Since the method of the present invention can cope with such a case, the determination accuracy is improved.

  As a result, if it is determined that the previously read Read Me file is not new (S1043: No), the Read Me file is excluded from the update target (S1044). On the other hand, when it is determined that the Read Me file is new (S1043: Yes), the apparatus 100 determines whether or not there is a Read Me file that has already been installed (S1045). As a result, if it is determined that there is a Read Me file that has already been installed (S1045: Yes), the apparatus 100 decodes the Read Me file and the release date of the Read Me file that was downloaded earlier (both decode the control code). (S1046), and determines whether the installation candidate (Read Me file downloaded earlier) is newer (S1047).

  As a result, if it is determined that the installation candidate is not newer (S1047: No), the installation candidate is excluded from the update target (S1048). On the other hand, if it is determined that the installation candidate is newer (S1047: Yes), the apparatus 100 determines whether or not there is specific information (File information) in the control code decoded from the Read Me file downloaded earlier. Determination is made (S1049). As a result, if there is specific information (S1049: Yes), the apparatus 100 determines whether there is the same information as the specific information in the default folder (S1050). As a result, if there is the same information (S1050: Yes), the installation candidate is excluded from the update target (S1051). On the other hand, if the same information does not exist (S1052), the installation candidate is set as an update target (S1052). The apparatus 100 executes the processes of S1041 to S1052 for all the Read Me files downloaded in S1040. As described above, it is possible to determine whether there is a driver to be updated, that is, to select a driver to be updated.

  When a driver to be updated is selected, the apparatus 100 displays information (driver names and the like) regarding all the installation candidate drivers that are the update target as shown in FIG. 5, for example (S106). When the update button shown in the figure is pressed by clicking or the like (S107), the apparatus 100 accesses the installation candidate driver download destination URL (included in the driver list or the Read Me file control code). Then, the corresponding driver is downloaded (S109, S110). Then, the apparatus 100 executes a process for installing (updating) the downloaded driver (S111).

  As described above, in the present embodiment, the server 200 narrows down the driver programs that can be installed under the program execution environment of the device 100 and transmits them to the device 100 in the form of a driver list. Therefore, it is possible to reduce the amount of communication on the network as compared with the case where all of the drivers are transmitted to the apparatus 100 without performing such narrowing down. In addition, driver installation can be automated.

In the present embodiment, the installation candidate is described as being a driver, but the present invention is not limited to this. For example, the installation candidate may be an update program (for example, an upgraded application program).
(Conversion to invisible character string)
Next, the conversion process into invisible characters will be described with reference to the drawings.

In this process, the control code (corresponding to the predetermined information of the present invention) is converted (encoded) into an invisible character string and added or described in the Read Me file (corresponding to the predetermined file of the present invention).
(Conventional technology)
Conventionally, in order to achieve stable operation of personal computers, correction software has been developed and registered on a distribution server. After that, the customer voluntarily accesses the server on which the correction software is registered to check whether there is a correction version. If registered, manually download and install the modified version into the system.
(Problems to be solved by the invention)
However, the conventional correction method is to have the customer check the modified software and download it, so the customer must always be aware of the maintenance of the personal computer, and the modified software distribution server In addition, it was necessary to provide accurate information suitable for the personal computer and to select necessary correction software. This requires that the customer has some knowledge of the personal computer, and it has been difficult for ordinary customers to perform these operations. Therefore, the support information for the customer is not utilized, and this has been a cause of the decrease in customer support quality and satisfaction.
In order to avoid these problems, it is necessary to develop a new dedicated server separately from the existing modified software distribution server in order to construct a system that realizes automatic download and installation of modified software. There is a problem that a very high development cost is required. In addition, there is a problem that the maintenance work burden on the support side that both systems (servers) must be maintained increases and the maintenance cost also increases. Furthermore, in order to automatically distribute to customers, operations such as user registration from customers are required. As a result, the support range is limited, resulting in a decline in support quality and a decline in the reputation of equipment sales companies. If a command is attached to a document, an unintelligible symbol is shown to the customer, resulting in a problem of customer confusion and poor support quality.

Here, the control code (corresponding to the predetermined information of the present invention) is converted (encoded) into an invisible character string and added or described in the Read Me file (corresponding to the predetermined file of the present invention) which is a customer browsing document. Accordingly, it is an object of the present invention to prevent an unintelligible symbol or the like from being shown to a customer who has viewed a customer browsing document.
(Encoding to invisible character string)
Next, a method for encoding predetermined information into an invisible character string will be described with reference to the drawings. FIG. 6 is a flowchart for explaining a method of encoding predetermined information into an invisible character string.

  This encoding has, for example, a function of encoding a control code (corresponding to predetermined information of the present invention) into an invisible character string, and a function of adding this to a customer browsing document (here, Read Me file) in a predetermined computer. This is realized by reading and executing a predetermined program.

  As shown in FIG. 7, the control code includes a driver name, a detailed description, a release date, and the like. At the time of encoding, a predetermined computer first sets (or outputs) a header character string of a control code (S201). The header string varies depending on the target language. For example, a character string of cts is set for Japanese and cts_eng is set for English (see FIG. 7). This header character string is replaced (encoded) with a tab (corresponding to the first invisible character of the present invention) and a half-width space (corresponding to the second invisible character of the present invention), for example, a predetermined location in the customer browsing document. Added or described.

Here, the encoding procedure will be described. The predetermined computer converts (encodes) a control code (equivalent to predetermined information of the present invention) such as an automatic distribution command into an invisible character string in which tabs and half-width spaces are combined according to a predetermined rule. For example, the shift JIS full-width “A” is expressed as “8260” in hexadecimal and “1000 0010 0110 0000” in binary. Accordingly, if the tab is made to correspond to the binary number “1” and the half-width space is made to correspond to the binary number “0”, the shift JIS full-width “A” is changed to the invisible character string [Tab] [Space]. ] [Space] [Space] [Space] [Space] [Tab] [Space] [Space] [Tab] [Tab] [Space] [Space] [Space] [Space] [Space] [Space] Is possible.

  When the header character string is encoded into an invisible character string as described above, the predetermined computer then adds an identifier corresponding to the head of each control code, and then sets each character as described above. Encode to invisible characters. For example, after the identifier “DN:” (see FIG. 6) corresponding to the driver name is added to the head of the driver name, each character is encoded into an invisible character, for example, the header character string in the customer browsing document. Immediately after that, it is added or described (S201). This encoding is repeated until the last control code (here, the release date) is reached (S203).

When the encoding for the last control code is completed, the predetermined computer sets (outputs) the footer character string of the control code (S204). For example, “end:” is set as the footer character string common to all languages. This footer character string is encoded as described above, and is added or described immediately after the last control code (here, the release date) in the customer browsing document, for example.
(Decoding processing of invisible character strings)
Next, a method for decoding the control code encoded in the invisible character string into the original control code will be described with reference to the drawings. FIG. 8 is a flowchart for explaining a method of decoding a control code encoded in an invisible character string into an original control code.

  This decoding is realized by, for example, reading and executing a predetermined program having a function of decoding a control code encoded in an invisible character string in the apparatus 100.

  The apparatus 100 searches for a header character string encoded from a predetermined file (for example, a Read Me file including an invisible character string (and a visible character string) generated by the encoding) (S300). If the search is not possible, the process is terminated (S300: No). On the other hand, when the header character string can be searched (S300: Yes), the predetermined program extracts and decodes the next line (S301). This decoding is realized by performing processing reverse to the above encoding. If the result of this decoding is a footer character string (S301: Yes), the predetermined program ends the decoding process, assuming that all decoding has been completed.

  On the other hand, if the decoding result is not a footer character string (S301: No), it is determined whether the first three characters are the driver name identifier “DN:” (S302). If the driver name identifier is “DN:” (S302: Yes) The fourth and subsequent characters are set as the driver name (S303). This decoding is repeated until the final control code (here, the release date) is reached (S304 to S307). Then, when the decoding result is a footer character string, the predetermined program ends the decoding process (S301: Yes).

As described above, the control code is an invisible character string conversion in which a tab and a half-width space are combined according to a predetermined rule (for example, a tab is binary “1” and a half-width space is binary “0”). Is done. Then, by adding or describing this invisible character string to the Read Me file, a Read including this invisible character string (and the visible character string) is included.
A Me file is generated.

  Accordingly, it is possible to prevent a customer who has browsed the customer browsing document from showing an unfamiliar symbol or the like. That is, it is possible to provide the control code in a form that the user is not aware of in the infrastructure that has been visually recognized by the user, and to provide completely different information from the document to the program user based on this information. In addition, since a visible character string and an invisible character string can be described in one customer browsing document, it is extremely easy and simple for the control code provider to add it to the customer browsing document. Can be provided with a control code. In addition, the customer system can be stably kept up-to-date without depending on the customer operation. In addition, since the stability of the system is improved every day, it is possible to prevent unexpected customer hang-ups and freezes in advance, thereby preventing customer data from being lost. Furthermore, there is a sense of security when using the system because you can always feel close to the support of the system sales manufacturer.

In the present embodiment, the predetermined information is decoded into invisible information and added or described together with the visible information in the predetermined file. However, the present invention is not limited to this. For example, the predetermined information may be described (added) to the predetermined file together with the visible information without decoding the predetermined information. In this way, it becomes possible for the side providing the predetermined information (control code or the like) to provide the predetermined information (control code or the like) simply by adding it to the customer browsing document.
(Access distribution process 1)
Next, a process for distributing the load on the maintenance system due to the cumulative increase in shipment of devices (personal computers) will be described with reference to the drawings. FIG. 9 and FIG. 10 are flowcharts for explaining processing for distributing accesses from a plurality of apparatuses 100.

  Each device 100 checks the maintenance history and determines whether it is the first time or a non-first time (S400). If it is non-first time (S400: non-first time), the elapsed days = system construction date (corresponding to the reference date of the present invention) -use date is calculated, and the elapsed days are calculated (S401). On the other hand, if it is the first time (S400: first time), after the maintenance history is initialized (S402), the elapsed days are calculated (S401) as in the non-first time.

  Next, every time the number of elapsed days exceeds a predetermined threshold, the apparatus 100 sets a timing that is later (arrives later) than the previous access timing as the next access timing to the server 200 or the like via the network N. (S403 to S411). Specifically, if the elapsed days <half a month (threshold) (S403: Yes), the maintenance date (next access timing) is set three days later (S404). If the elapsed days <February (threshold) (S405: Yes), the maintenance date (next access timing) is set one week later (S406). If the elapsed days <March (threshold) (S407: Yes), the maintenance date (next access timing) is set two weeks later (S408). If the elapsed days <half a year (threshold) (S409: Yes), the maintenance date (next access timing) is set to one month later (S410). Further, if the elapsed days exceed June (S409: No), the maintenance date (next access timing) is set after 2 months (S411). The apparatus 100 accesses the server 200 (specific URL) or the like at the set timing, and automatically downloads the driver or the like if it exists.

As described above, according to the above access distribution processing, every time the number of elapsed days exceeds a predetermined threshold, the next access timing to the server 200 or the like via the network N is later than the previous access timing. Since it is set, access can be distributed.
(Access distribution process 2)
Next, processing for distributing access will be described.

This process is intended to distribute automatic inquiry requests (accesses) generated from a plurality of devices 100 at approximate times.
(Conventional technology)
In recent years, automation of state monitoring and state maintenance has been required by a system that performs monitoring and inquiry for a certain period of time. At this time, a request (access) for the target device to automatically inquire information to the inquiry destination occurs. However, in the method of specifying a specific day or a specific time, the inquiry is concentrated at a specific time, and it is peak and non-peak times. There was a big gap. For this reason, it is necessary to decentralize inquiries (accesses) that concentrate at a specific time and reduce the load that is concentrated at a specific time.

  When it is necessary to obtain information at regular intervals, every time the user starts using the device (or at a specific date and time specified in advance), when confirming (accessing) information, a specific date or time zone Inquiries (accesses) were concentrated on the system, and therefore, the system suffered an extremely high load only during a specific period. However, because information that is obtained at regular intervals is not limited to information that requires immediate urgency, specific dates and specific times are specified, so inquiries are unnecessarily concentrated on specific dates and specific times. It was.

A typical conventional example is shown in FIGS. Taking the automatic monitoring program installed on the device 100 'and the backbone system as an example, the program installed on the N devices at the starting point a when the automatic monitoring program installed on the device 100' is started is also the point a. Inquiries were made to the core system all at once, and there was also a high load (response from N units / immediate processing request) that required processing at point a.
(Problems to be solved by the invention)
Therefore, even in the case of an automatic inquiry with no immediate urgency, there is a problem that an immediate processing request is made on a specific date or a specific time (point a). In addition, when many automatic inquiry requests are generated in the approximate time, the inquiry destination needs to receive the requests at the same time.

  Here, as shown in FIG. 13, even if N cases have the same date and time points a and b, no inquiry is requested immediately (points a and b), and a 'point after a predetermined time has elapsed. , B ′ point is made an inquiry request (access), and the inquiry request (access) is distributed.

Next, processing for distributing access will be described with reference to the drawings. FIG. 14 is a flowchart for explaining processing for distributing access.
When the system is activated (S500), the apparatus 100 makes a request (access) to the inquiry destination at a time when a predetermined time has elapsed from the reference point, based on the generation time of the inquiry case. Specifically, the apparatus 100 acquires the time when the automatic maintenance program is loaded (corresponding to the start time of the program of the present invention), uses this as a base point, and checks the latest information from the base point time to the maintenance system. The requested time is reserved (set) as a distributed request time (S501). The inquiry start time (distributed request time) is obtained by calculating the following expression.

(Expression) Time of base time + (base minute minute + base time second x coefficient 1) minute + (base time second + base time millisecond x coefficient 2) second + base time millisecond + offset time This formula For example, if the base time is 8:40:00 000 milliseconds, the coefficient 1 is 3, the coefficient 2 is 0.18, and the offset time is 0 hour 0 minute 0 000 milliseconds, 1 minute It is possible to disperse requests generated in the period of about 3 hours (degree of decentralization). Note that the dispersion time can be adjusted by adjusting the coefficient 1. 15 and 16 show the relationship between each base time and the distributed request time calculated based on this base time.

  The automatic maintenance program waits until the reserved request time (S502), and when the reserved request time is reached (S503), requests maintenance information from the maintenance system (period system) (S503). The maintenance system provides maintenance information to the apparatus 100 based on the request (S504, S505). The apparatus 100 executes predetermined processing according to the response content from the maintenance system (S506).

  As described above, in an apparatus that performs monitoring / inquiry over a certain period, automatic inquiry requests for state monitoring / maintenance can be distributed in an expected range from an approximate time. Therefore, it is possible to suppress the amount of requests that occur at the same time, distribute the amount of peak traffic, and keep the costs for infrastructure development and maintenance low.

  In the present embodiment, the time when the system is activated and the automatic maintenance program is loaded is described as the base point. However, the present invention is not limited to this. For example, such a time + α (for example, 20 minutes) may be used as a base point, or another time may be used as a base point.

  Further, when it takes a download unavailable time zone (for example, from 3 am to 5 am) in the maintenance system, the time in that time zone may be added to the originally reserved request time. In this way, the maintenance system is not accessed during the download unavailable time period.

  The present invention can be implemented in various other forms without departing from the spirit or main features thereof. For this reason, said embodiment is only a mere illustration in all points, and is not interpreted limitedly.

The present invention can also be specified as follows.
(Appendix)
(Additional remark 1) The step which transmits the request containing the execution environment specific information for specifying the program execution environment of the said computer to a computer to a predetermined server via a network, The program execution environment specified by the said execution environment specific information Receiving a list including installation candidates that can be installed from the predetermined server via the network, selecting an installation candidate from the list according to a predetermined condition, and installing the selected installation candidate. A program to be executed. (1)
(Supplementary note 2) The program according to supplementary note 1, wherein the execution environment specifying information includes information for specifying a model name of the computer and information for specifying an operating system installed in the computer. (2)
(Additional remark 3) The program of Additional remark 1 whose said installation candidate is a driver program. (3)
(Supplementary note 4) The program according to supplementary note 1, wherein the list includes a download destination address of an installation candidate, and the selected installation candidate is downloaded and installed from the download destination address. (4)
(Additional remark 5) The step which acquires the date regarding an installation candidate in a computer, the step which compares the date regarding the acquired installation candidate with predetermined date, and determines whether to install an installation candidate based on the result of the comparison A program for executing the step of installing the installation candidate determined to be installed. (5)
(Additional remark 6) The step which makes a computer input predetermined information to a computer, The input predetermined information is made into the invisible character string which combined the 1st invisible character and the 2nd invisible character according to the predetermined rule. A program for executing a step of converting and a step of adding the converted invisible character string to a predetermined file. (6)
(Additional remark 7) The step which acquires a predetermined file to a computer, The step which extracts the invisible character string containing a 1st invisible character and a 2nd invisible character from the acquired said predetermined file, The said extracted invisible A program for executing a step of converting a character string into original predetermined information according to a predetermined rule. (7)
(Supplementary note 8) The program according to supplementary note 6 or 7, wherein the predetermined information is a control code. (8)
(Supplementary Note 9) Each time the number of days elapsed from the reference date exceeds a predetermined threshold value, the computer sets a timing later than the previous access timing as the next access timing via the network. For executing the step of accessing via the network at a predetermined timing. (9)
(Additional remark 10) The program for making a computer perform the step which acquires the starting time of the said program, and the step which accesses a predetermined | prescribed server via a network at the timing calculated | required according to the acquired starting time. (10)
(Additional remark 11) It is information processing apparatus, Comprising: The means which transmits the request containing the execution environment specific information for specifying own program execution environment to a predetermined server via a network, It specifies by the said execution environment specific information Means for receiving a list including installation candidates that can be installed under a program execution environment from the predetermined server via the network; means for selecting an installation candidate from the list according to a predetermined condition; and installing the selected installation candidate An information processing apparatus comprising means. (12)

  (Supplementary note 12) The information processing apparatus according to supplementary note 11, wherein the execution environment specifying information includes information specifying a model name of the computer and information specifying an operating system installed in the computer. (13)

(Supplementary note 13) The information processing apparatus according to supplementary note 11, wherein the installation candidate is a driver program. (14)
(Supplementary Note 14) The list includes download destination addresses of installation candidates,
The information processing apparatus according to appendix 11, wherein the selected installation candidate is downloaded from the download destination address and installed. (15)

  (Supplementary Note 15) Means for acquiring a date related to an installation candidate, means for comparing the date related to the acquired installation candidate and a predetermined date, means for determining whether to install an installation candidate based on the result of the comparison, An information processing apparatus comprising: means for installing an installation candidate determined to be installed. (16)

  (Supplementary Note 16) Means for allowing a user to input predetermined information, means for converting the input predetermined information into an invisible character string obtained by combining the first invisible character and the second invisible character according to a predetermined rule. An information processing apparatus comprising: means for adding the converted invisible character string to a predetermined file. (17)

  (Supplementary Note 17) Means for acquiring a predetermined file, means for extracting an invisible character string including a first invisible character and a second invisible character from the acquired predetermined file, and extracting the invisible character string An information processing apparatus comprising: means for converting into original predetermined information according to a predetermined rule. (18)

(Supplementary note 18) The information processing apparatus according to supplementary note 16 or 17, wherein the predetermined information is a control code. (19)
(Additional remark 19) It is an information processing apparatus, and the means which sets a timing later than the timing accessed last time as the next access timing via the network every time the number of days elapsed from the reference date exceeds a predetermined threshold value An information processing apparatus comprising: means for accessing via the network at the set timing. (20)

  (Additional remark 20) Information processing apparatus, comprising: means for acquiring a start time of the program; and means for accessing a predetermined server via a network at a timing determined according to the acquired start time apparatus.

  (Supplementary note 21) A method of installing on a computer connected to a network, the step of transmitting a request including execution environment specifying information for specifying a program execution environment of the computer to a predetermined server via the network; Receiving a list including installation candidates that can be installed under the program execution environment specified by the execution environment specifying information from the predetermined server via the network; selecting an installation candidate from the list according to a predetermined condition; An installation method comprising: installing the selected installation candidate.

  (Supplementary note 22) The installation method according to supplementary note 21, wherein the execution environment specifying information includes information for specifying a model name of the computer and information for specifying an operating system installed in the computer.

(Supplementary note 23) The installation method according to supplementary note 21, wherein the installation candidate is a driver program.
(Supplementary Note 24) The list includes download destination addresses of installation candidates,
The installation method according to appendix 21, wherein the selected installation candidate is downloaded from the download destination address and installed.

  (Supplementary Note 25) A step of acquiring a date related to an installation candidate in a computer, a step of comparing a date related to the acquired installation candidate with a predetermined date, and determining whether to install an installation candidate based on the result of the comparison An installation method for executing the step of installing the installation candidate determined to be installed.

  (Additional remark 26) The step which makes a user input predetermined information, The step which converts the said input predetermined information into the invisible character string which combined the 1st invisible character and the 2nd invisible character according to the predetermined rule. And a step of adding the converted invisible character string to a predetermined file.

  (Supplementary note 27) A step of obtaining a predetermined file, a step of extracting an invisible character string including a first invisible character and a second invisible character from the acquired predetermined file, and the extracted invisible character string An invisible character processing method for further executing the step of converting into original predetermined information according to a predetermined rule.

(Supplementary note 28) The invisible character processing method according to supplementary note 26 or 27, wherein the predetermined information is a control code.
(Supplementary note 29) A method of distributing access from computers, and every time the number of days elapsed from a reference date exceeds a predetermined threshold, the next access timing via the network is later than the previous access timing An access distribution method comprising: setting a timing; and accessing via the network at the set timing.

  (Supplementary Note 30) A method for distributing access from a computer, the step of acquiring a start time of the program, and the step of accessing a predetermined server via a network at a timing determined according to the acquired start time An access distribution method comprising:

  (Supplementary Note 31) A system including an information processing apparatus and a predetermined server connected to a network, wherein the information processing apparatus sends a request including execution environment specifying information for specifying its own program execution environment to the request Means for transmitting to a predetermined server via a network; means for receiving a list including installation candidates installable under the program execution environment specified by the execution environment specifying information from the predetermined server via the network; predetermined conditions A system comprising: means for selecting an installation candidate from the list in accordance with: means for installing the selected installation candidate.

  (Supplementary note 32) The system according to supplementary note 31, wherein the execution environment specifying information includes information specifying a model name of the computer and information specifying an operating system installed in the computer.

(Supplementary note 33) The system according to supplementary note 31, wherein the installation candidate is a driver program.
(Supplementary note 34) The system according to supplementary note 31, wherein the list includes download destination addresses of installation candidates, and the selected installation candidate is downloaded from the download destination address and installed.

  (Supplementary Note 35) Means for acquiring a date related to an installation candidate, means for comparing the date related to the acquired installation candidate and a predetermined date, means for determining whether to install an installation candidate based on the result of the comparison, A system comprising: means for installing an installation candidate determined to be installed.

  (Supplementary note 36) A system including an information processing apparatus connected to a network, each time the number of days elapsed from a reference date exceeds a predetermined threshold value, the previous access as the next access timing via the network A system comprising: means for setting a timing later than the set timing; and means for accessing via the network at the set timing.

  (Supplementary Note 37) A system including an information processing apparatus and a predetermined server connected to a network, the means for acquiring the start time of the program, and the network at a timing determined according to the acquired start time A system for accessing a predetermined server via the network.

(Supplementary Note 38) A system including an information processing apparatus and a predetermined server connected to a network, wherein the information processing apparatus sends a request including execution environment specifying information for specifying its own program execution environment to the request Means for transmitting to a predetermined server via a network; means for receiving a list including installation candidates installable under the program execution environment specified by the execution environment specifying information from the predetermined server via the network; predetermined conditions And a means for selecting the installation candidate from the list, a means for installing the selected installation candidate, the predetermined server receiving a request transmitted from the information processing apparatus, and an execution environment included in the request Program specified by specific information A system comprising: means for searching for information on installation candidates that can be installed in an execution environment from a predetermined database; and means for transmitting the search results to the information processing apparatus as a list including the installation candidates.
(Supplementary Note 39) Computer (time): (formula) base time hour + (base time minute + base time second x factor 1) min + (base time second + base time millisecond x factor 2) second + base time A program for executing the step of calculating the millisecond + offset time, and the step of accessing a predetermined server via the network at the hour, minute, and second indicated by the calculation result. (11)
(Supplementary Note 40) Information processing apparatus, wherein (formula) time at base time + (minute of base time + second of base time × factor 1) min + (second of base time + millisecond of base time × factor 2) An information processing apparatus comprising: means for calculating second + millisecond of base time + offset time; and means for accessing a predetermined server via the network at the hour, minute, and second indicated by the calculation result.
(Supplementary note 41) A method of distributing access from a computer, wherein (formula) base time hour + (base time minute + base time second x factor 1) minute + (base time second + base time millimeter) An access distribution method comprising the steps of: (second × factor 2) second + millisecond of base time + offset time; and accessing a predetermined server via the network at the hour, minute, and second indicated by the calculation result.
(Supplementary Note 42) A system including an information processing apparatus and a predetermined server connected to a network, wherein (formula) time of base time + (minute of base time + second of base time × factor 1) min + (base point) Means for calculating second of time + millisecond of base time × coefficient 2) second + millisecond of base time + offset time, accessing the predetermined server via the network at the hour, minute and second indicated by the calculation result Means.

  According to the present invention, it is possible to download only a computer suitable for its own program execution environment.

It is a figure for demonstrating schematic structure of the network system in this embodiment. It is a sequence diagram for demonstrating a driver update process. 4 is a flowchart for explaining determination processing by the apparatus 100. 4 is a flowchart for explaining determination processing by the apparatus 100. It is an example of a display screen of installation candidate drivers. It is a flowchart for demonstrating the method to encode predetermined information into an invisible character string. It is an example of a control code or the like. It is a flowchart for demonstrating the method to decode the control code encoded into the invisible character string into the original control code. 10 is a flowchart for explaining processing for distributing accesses from a plurality of apparatuses 100. FIG. 6 is a diagram for describing processing for distributing access from a plurality of devices 100. It is a figure for demonstrating a prior art example. It is a figure for demonstrating a prior art example. FIG. 6 is a diagram for describing processing for distributing access from a plurality of devices 100. 10 is a flowchart for explaining processing for distributing accesses from a plurality of apparatuses 100. It is a figure for demonstrating the relationship between each base time and the distributed request | requirement time calculated based on this base time. It is a figure for demonstrating the relationship between each base time and the distributed request | requirement time calculated based on this base time.

Explanation of symbols

100 devices 200 servers N networks

Claims (4)

A program for causing a computer to determine a time to access a server via a network,
Obtaining a base time which is a start time of the own program or a time obtained by adding a predetermined time to the start time;
A value obtained by multiplying a numerical value representing the position of the second of the base time when the base time is expressed in units of hours, minutes, seconds, and milliseconds by a first coefficient and the minutes of the base time. Calculating a value obtained by adding a numerical value representing as a fractional value;
Calculating a value obtained by adding a value obtained by multiplying a numerical value representing the millisecond of the base time by a second coefficient and a numerical value representing the second of the base time as the value of the second;
The value of the hour place is represented by a numerical value representing the place of the hour of the base time, the value of the minute place is represented by the value of the calculated minute place, and the value of the second place is the value of the calculated second. A step of outputting a time for accessing the server, which is obtained by adding an offset time to a time represented by a value, and the time represented by a numerical value representing the millisecond of the base time. When,
A program that causes a computer to execute. An information processing apparatus for determining a time for accessing a server via a network,
Means for acquiring a starting time of a program for determining a time to access a server via a network or a base time which is a time obtained by adding a predetermined time to the starting time;
A value obtained by multiplying a numerical value representing the position of the second of the base time when the base time is expressed in units of hours, minutes, seconds, and milliseconds by a first coefficient and the minutes of the base time. Means for calculating a value obtained by adding a numerical value representing the value as a fractional value;
Means for calculating a value obtained by adding a value obtained by multiplying a numerical value representing the millisecond place of the base time by a second coefficient and a numerical value representing the second place of the base time as a second place value;
The value of the hour place is represented by a numerical value representing the place of the hour of the base time, the value of the minute place is represented by the value of the calculated minute place, and the value of the second place is the value of the calculated second. Means for outputting the time of access to the server, which is obtained by adding the offset time to the time represented by the value, and the time represented by the numerical value representing the millisecond of the base time When,
An information processing apparatus comprising: A method of distributing access from the computer by determining a time at which the computer accesses the server via a network,
Obtaining a base time which is a start time of a program for determining a time to access a server via a network or a time obtained by adding a predetermined time to the start time;
A value obtained by multiplying a numerical value representing the position of the second of the base time when the base time is expressed in units of hours, minutes, seconds, and milliseconds by a first coefficient and the minutes of the base time. Calculating a value obtained by adding a numerical value representing as a fractional value;
Calculating a value obtained by adding a value obtained by multiplying a numerical value representing the millisecond of the base time by a second coefficient and a numerical value representing the second of the base time as the value of the second;
The value of the hour place is represented by a numerical value representing the place of the hour of the base time, the value of the minute place is represented by the value of the calculated minute place, and the value of the second place is the value of the calculated second. A step of outputting a time for accessing the server, which is obtained by adding an offset time to a time represented by a value, and the time represented by a numerical value representing the millisecond of the base time. When,
An access distribution method comprising: A system that includes an information processing apparatus and a server connected to a network, and determines a time for accessing the server via the network,
Means for acquiring a starting time of a program for determining a time to access a server via a network or a base time which is a time obtained by adding a predetermined time to the starting time;
A value obtained by multiplying a numerical value representing the position of the second of the base time when the base time is expressed in units of hours, minutes, seconds, and milliseconds by a first coefficient and the minutes of the base time. Means for calculating a value obtained by adding a numerical value representing the value as a fractional value;
Means for calculating a value obtained by adding a value obtained by multiplying a numerical value representing the millisecond place of the base time by a second coefficient and a numerical value representing the second place of the base time as a second place value;
The value of the hour place is represented by a numerical value representing the place of the hour of the base time, the value of the minute place is represented by the value of the calculated minute place, and the value of the second place is the value of the calculated second. Means for outputting the time of access to the server, which is obtained by adding the offset time to the time represented by the value, and the time represented by the numerical value representing the millisecond of the base time When,
A system comprising:

Images