JP2009187523A - Negative delivery system, negative delivery server, and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To reduce a processing time required to update negative data of terminals. <P>SOLUTION: A negative management center 1 manages all negative data and causes a negative delivery server 2 to hold the latest all negative data. The negative delivery server 2 obtains the difference between the latest all negative data and past all negative data, and delivers one of the difference negative data and the latest all negative data to the terminals 3. The method of determining delivery data includes detecting the throughput of the terminal 3 to be compared with a preset threshold, or making a decision based on network load, the number of simultaneous connections, etc. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention relates to a negative delivery system for preventing unauthorized use of a contactless IC card.

  In a system that uses a non-contact IC card or the like and uses negative information, the negative information is held in each settlement terminal in order to improve processing speed. And it is necessary to deliver negative information regularly to each payment terminal.

  The negative information is information for determining, for example, unauthorized use of a lost contactless IC card, and is used as a commuter pass in a station service system including an automatic ticket gate, for example, for railways. If the contactless IC card is lost, etc., the user will register the unique number of the lost contactless IC card in the server etc. as the negative information. Negative information is distributed and stored in each automatic ticket gate or the like.

  As a result, each automatic ticket checker does not need to make an inquiry to the server or the like (that is, the above processing speed is improved), and if the unique number of the commuter pass used when passing the ticket gate is in the negative information, it is illegal. It can be determined to be used. However, each time a new loss or the like occurs, the unique number to be registered as negative information increases, and it is necessary to periodically update the negative information held by each automatic ticket checker.

As a system for distributing the negative information, there are conventional techniques described in Patent Documents 1 and 2, for example.
The prior art system of Patent Document 1 includes a wireless card issuing machine that records a predetermined ID number on the wireless card itself, such as the non-contact IC card, and transmits the ID number and purchase information to a host computer, and a wireless card. A negative data master file that centrally manages the negative ID data and purchase information and the negative data related to the lost wireless card, and the host computer stores the negative data master file in the system immediately before or during operation of the device. Deliver to all devices and wireless card issuers.

Further, in Patent Document 2, a server that distributes differential batch negative data composed of a predetermined number of latest negative data, and a differential batch negative data distributed from the server are received, and the received differential batch negative data differs from the generation received in the past. A function that compares each differential batch negative data, generates changed negative data for each generation of differential batch negative data, calculates a check value for the differential batch negative data, and distributes the changed negative data, the differential batch negative data, and the check value In addition to receiving the difference batch negative data from the center at the time of initial setting, and subsequently receiving the changed negative data and the check value corresponding to the difference batch negative data possessed by itself, the received check value and the check value calculated by itself are received. If both check values are compared, the difference batch negative for the center Negadeta delivery system comprising a terminal requesting the distribution of data is disclosed.
JP 2000-90298 A JP 2005-234642 A

  However, in the invention of Patent Document 1, since the negative data master file is distributed, the amount of distribution data becomes large, and particularly when the network is slow, it takes time to distribute.

  Further, in the invention of Patent Document 2, it is necessary to perform processing for generating differential batch negative data from the changed negative data at each terminal, calculation of check values, and the like. It will take time.

  The processing time (update processing time) relating to the negative data update of each terminal mainly depends on the time (distribution time) required to distribute the negative data to the terminal via the network and the internal processing of the terminal that has received this distribution. Although it is time (internal processing time), in any of the methods disclosed in Patent Documents 1 and 2, depending on the network environment and the processing performance of the terminal, the update processing time may become long as a result.

  An object of the present invention relates to a negative distribution system that periodically distributes negative data to each terminal via a network. Depending on the network environment of the system and the processing performance of the terminal, the entire amount of negative data is distributed or the difference negative data The negative distribution system, the negative distribution server, the program, and the like can be provided that can reduce the processing time for updating the negative data of the terminal by dynamically determining whether or not to distribute.

  The negative distribution system of the present invention is a negative distribution system in which a plurality of terminals that hold all the amount of negative data and perform a check process using the total amount of negative data when processing the IC card, and a negative distribution server are connected to the network. The negative delivery server includes a total amount negative data acquisition unit that periodically acquires new total amount negative data, and a differential negative data generation unit that generates difference negative data that is a difference between the new total amount negative data and past total amount negative data. And a negative delivery method determining means for dynamically determining whether to deliver the total amount negative data or the differential negative data as a negative delivery method every time a request is made from any of the terminals, and the negative delivery method determining means Negative data distribution means for distributing negative data to the requesting terminal by the negative distribution method A, wherein each terminal based on Negadeta delivered by the Negadeta distribution means, having a total amount Negadeta updating means for updating the total amount Negadeta self holds the new total amount Negadeta.

  As described above, depending on the processing performance of each terminal, network load, etc., the total processing time for updating the total amount negative data of the terminal may be shorter when distributing the total amount negative data, or when the difference negative data is distributed. Sometimes it is shorter. Thus, by dynamically determining the negative delivery method each time by the negative delivery method determining means, it is possible to shorten the total processing time for updating the total amount negative data of the terminal.

The negative delivery method determining means determines the negative delivery method by, for example, comparing the processing performance of the request source terminal with a predetermined first threshold value.
Further, the negative delivery method determining means determines the negative delivery method by comparing a network load related to communication with the requesting terminal and a predetermined second threshold value set in advance. Also good.

  Alternatively, the negative delivery method determining means may determine the negative delivery method by comparing the number of simultaneous connections from a plurality of terminals with a predetermined third threshold value set in advance.

  Alternatively, any of the above negative delivery method determination methods may be combined.

  According to the negative delivery system of the present invention, the negative delivery server, the program, etc., it relates to a negative delivery system that regularly delivers negative data to each terminal via a network, depending on the network environment of the system and the processing performance of the terminal. The processing time for updating the negative data of the terminal can be shortened by dynamically determining whether or not to distribute the whole amount of negative data or the difference negative data.

Embodiments of the present invention will be described below with reference to the drawings.
In the negative distribution system of this example, each terminal side holds all negatives by receiving all negatives from the negative distribution server at the time of initial installation etc., and thereafter receives all negatives or differential negatives. Based on this, the latest total amount negative data can be generated, so that the terminal can check for illegal use of the IC card using the latest total amount negative data.

  In particular, the negative distribution server in the negative distribution system of this example dynamically determines whether to distribute the entire amount of negative data or the differential negative data according to the network environment of the system and the processing performance of the terminal. By switching these, the time required for updating the negative data of the terminal (the time required for the negative data distribution + the time for generating the latest total amount of negative data) can be shortened.

  As for the contents of the data, it may be considered that all negatives = total negative data, but a predetermined check is performed on all received negatives, or the existing total negative data is deleted and all received negatives are Since it takes a certain amount of time to store the latest full quantity negative data, such a process is considered as a process for generating the latest full quantity negative data.

Hereinafter, the negative delivery system of this example will be described in detail.
FIG. 1 is a diagram showing a configuration example of the negative delivery system of this example.
The negative distribution system of FIG. 1 includes a negative management center 1, a negative distribution server 2, and each terminal 3. The negative management center 1 and the negative distribution server 2 are connected to a network 4, and the negative distribution server 2 and each terminal. 3 is connected to the network 5 and can transmit and receive data via the networks 4 and 5, respectively.

  Each terminal 3 is, for example, the above-described automatic ticket gate, but is not limited to such an example, and is not limited to a terminal related to a railway system. The terminal 3 may be any terminal as long as an IC card (in particular, a non-contact IC card in this case) is used and performs some processing such as payment processing. Therefore, the terminal 3 may be, for example, a terminal connected to a cash register to pay for purchased goods with electronic money of an IC card.

  As described above, since the terminal 3 may be various IC card terminals, there may be a terminal 3 with high processing performance and a terminal 3 with low processing performance as described above. Also, the network environment (here, network 5) connected to each terminal 3 may be various, such as low speed / high speed, and further the communication status at that time (for example, a large number of terminals 3 communicating). Etc.), the communication load also fluctuates.

  In the negative delivery system of this example, the contact number is uniquely assigned to each contactless IC card in advance, and the contactless IC card user is contacted when the card is lost. The card ID number is registered in the negative management center 1 as negative data.

  The negative management center 1 is a center device that collectively manages negative data, and stores, for example, all amount negative data that is all negative data information. Then, the newly added negative data and the information such as the ID number of the non-contact IC card that should not be used in the same manner as in Patent Document 1 are sent to the negative management center 1 at any time. If necessary, update all negative data (add new negative data, delete existing negative data, change data contents, etc.).

  Then, the negative management center 1 transmits the latest total amount of negative data at that time to the negative distribution server 2 via the network 4 at the beginning or periodically at a predetermined first time interval (for example, every morning). Moreover, the negative management center 1 is a difference between the total amount negative data at the previous transmission and the latest total amount negative data periodically (for example, every hour) at a predetermined second time interval shorter than the first time interval. The changed negative data is transmitted to the negative distribution server 2 via the network 4.

  When the total amount negative data is sent from the negative distribution center 1, the negative distribution server 2 stores the total amount negative data as the latest all case negatives. This all-case negative is, for example, all the negatives of version 1 (generation 1). Thereafter, each time the negative distribution server 2 receives the changed negative data transmitted from the negative distribution center 1, the negative distribution server 2 generates a new latest all-new data based on the changed negative data and the latest negatives at that time. Generate negatives (upgrade to version). Leave all previous negatives without deleting them.

  Then, the negative distribution server 2 compares all the newly generated latest negatives with all the negatives of different generations (versions) generated in the past (all previous negatives), The difference negative data corresponding to each generation (hereinafter referred to as the difference negative) is generated by obtaining the difference between each generation and all the negatives. This may be the same as the processing for obtaining the changed negative data described in Patent Document 2, and in the same manner, for each terminal, a difference negative corresponding to the version (generation) of all the negatives held by the terminal is obtained. Delivered to the terminal 3. However, the negative delivery server 2 of this example may deliver not only the difference negative but the latest all-case negative according to the determination result described later. However, as a matter of course, the latest all negatives are distributed to the newly installed terminal 3 (not yet stored all the negatives) regardless of the determination result.

  Thus, each terminal 3 receives all the negatives from the negative distribution server 2 at the time of initial installation or the like, and stores this as the total negative data. Thereafter, all negatives or differential negatives are received, and the latest total negative data is generated based on this. Naturally, at the time of settlement (when an IC card is used), negative (injustice) check is performed using the entire amount of negative data.

FIG. 2 is a schematic diagram for explaining a negative data distribution flow between the negative management center 1 and the negative distribution server 2.
As described above, the negative management center 1 collectively manages the negative data, and first or periodically (for example, once a day), the latest total negative data A at that time (referred to as A1 in the figure). Transmit to the negative delivery server 2. After that, the negative management center 1 periodically (for example, once an hour), the latest total amount negative data A at that time and the total amount negative data A (hereinafter referred to as the previous time) The change negative data B is created by obtaining the difference from the total amount negative data A), and the created change negative data B is transmitted to the negative distribution server 2.

  When receiving the total amount negative data A transmitted from the negative management center 1, the negative distribution server 2 stores the received total amount negative data A as the latest all case negative C. In addition, when the negative distribution server 2 receives the changed negative data B transmitted from the negative management center 1, the negative updated server 2 combines the received changed negative data B with all the latest negative C at that time, so that a new latest Create all negatives C.

  For example, in the example shown in FIG. 2, when the negative management center 1 transmits the total amount negative data A1, the negative distribution server 2 stores the total amount negative data A1 as it is as the entire case negative C1 shown in the drawing. After that, when the negative management center 1 creates and transmits the changed negative data B2, which is the difference between the latest total amount negative data A2 and the total amount negative data A1 at the previous transmission, the negative distribution server 2 uses the current latest total negatives. A new latest all-case negative C2 shown in the figure is created by combining the received change negative data B2 with the above-mentioned all-case negative C1. Thereafter, when all the negatives C are distributed to an arbitrary terminal 3 until new negative data A or changed negative data B is newly received, the latest all negative C2 is distributed.

At this time, all the negatives C1 of the old version (old generation) are left without being deleted and used in the process of FIG. 4 described later.
Here, version (generation) information is given to each created negative C. For example, if the illustrated C1 is version 1 (generation 1), the illustrated version C2 is upgraded to version 2, the version C3 is upgraded to version 3, and so on. In this example, the one with the highest version number is the latest all-case negative C at that time.

  Similarly, the negative management center 1 creates and transmits changed negative data B3, which is the difference between the total amount negative data A3 and A2, for example, and the negative distribution server 2 sends this B3 to the above-mentioned all negative C2. All the negatives C3 shown in the figure are combined. In the same manner as described above, all the negatives C2 of the old version (old generation) are left without being deleted. In view of the latest all-case negative C3 at this time, all-case negative C2 is one generation before and all-case negative C1 is two generations before. All the negatives C of all old generations are not necessarily left, but may be left until a predetermined generation. For example, if it is set that three generations before the current latest all-case negative C are set, all case negatives C before four generations will be deleted.

FIGS. 3A to 3C show examples of the total amount / changed negative data.
FIG. 3A shows a part of the previous total amount negative data A, and FIG. 3B shows a part of the latest total amount negative data A. FIG. 3C shows the changed negative data B, which is the difference between these previous / newest total amount negative data.

  As shown in FIGS. 3A and 3B, the data configuration of the total amount negative data A includes an ID number 11 and a data generation date 12. The data structure of the change negative data B shown in FIG. 3C includes a change type 21, an ID number 22, and a data generation date 23.

  ID numbers 11 and 22 are ID numbers uniquely assigned to contactless IC cards registered as negative data due to loss or the like, and data generation dates 12 and 23 are dates registered as negative data. The change type 21 is, for example, one of update, deletion, and addition shown in the figure.

  The negative management center 1 creates the changed negative data B shown in FIG. 3C based on the previous / current total amount negative data A shown in FIGS. 3A and 3B. That is, the negative management center 1 compares the latest total amount negative data shown in FIG. 3B with the previous total amount negative data shown in FIG. 3A, extracts records that do not coincide with each other, By determining the change type, the change negative data B shown in FIG. 3C is created.

  In the example shown in the figure, the ID number 11 = '00000002' (hereinafter simply referred to as ID number '2'. Other numbers are the same), '3', and '4' records do not match. Extracted. The change type of each extracted record is “update” because the data generation date 12 is changed for the record with ID number 11 = “2”, and the record with ID number 11 = “3” is included in the latest all-volume negative data. Since it is not deleted, the record of ID number 11 = '4' is not included in the previous total amount negative data, so it is "added" and the changed negative data B in FIG.

Then, the changed negative data B in FIG. 3C is transmitted to the negative delivery server 2.
At the time of receiving this changed negative data B, the negative distribution server 2 uses all the negative C having the same contents as the previous total negative data A shown in FIG. 3A as the latest (current) negative C. is doing. When the change negative data B shown in FIG. 3C is received, the ID number = '2 based on the received change negative data B for all current negatives C having the contents shown in FIG. A new latest all-case negative C is created by updating the record of ', deleting the record of ID number =' 3 ', and adding the record of ID number =' 4 '. Naturally, the contents of all the created negatives C are as shown in FIG.

  In this way, the total amount negative data A and the total case negative C have at least the same data contents even though the names are different. In this example, even after the latest total amount negative data A is distributed first (for example, once a day at the beginning of the day), the latest total amount negative data A at that time is regularly distributed (for example, every hour). However, since the total amount of negative data A has a large amount of data, the communication load increases and the distribution process takes time. Therefore, only the difference is distributed.

  However, the present invention is not limited to this example. For example, if the network 4 is a very high-speed network or the like, the latest total amount of negative data A at that time may be distributed periodically (for example, every hour).

FIG. 4 is a schematic diagram for explaining a negative data distribution flow between the negative distribution server and the terminal of this example.
In the negative delivery server 2, the latest all-case negative C (here, the version (generation) n shown in the drawing is referred to as all-case negative n) by the processing described with reference to FIGS. 2 and 3. The one before the generation n shall be described as all negatives n-1 (the same applies to the differential negative D). Difference negative D corresponding to each old generation is created by comparing each with n-1, all case negative n-2, and all case negative n-3. That is, the difference negative n-1, the difference negative n-2, and the difference negative n-3 are created.

  The data structure of the difference negative D may be the same as that of the changed negative data B, and is not particularly shown or described. Further, the combining process described below in each terminal 3 may be the same as the combining process in the negative delivery server 2 described in FIG.

  The negative delivery server 2 executes the processing of the negative delivery server 2 in FIG. 5 to be described later after creating each differential negative D corresponding to each of the previous generations. That is, every time there is a request from an arbitrary terminal 3, the latest all-case negative n is distributed to the requesting terminal 3 or a difference negative D is distributed to the requesting terminal 3 by a determination process shown in FIG. Decide whether or not to distribute all negatives or differential negatives D.

  When distributing the difference negative D, one of the plurality of difference negatives n-1, n-2, and n-3 created as described above is distributed. This distributes to the terminal 3 a differential negative D corresponding to the version (generation) m of all the negatives E currently held and used in the requesting terminal 3. For example, if the version m of all case negatives E held by the requesting terminal 3 is n−2, the difference negative n−2 is distributed.

  The terminal 3 creates a new all-case negative E by combining the received difference negative D with all the case negatives E currently held and used (all cases negative E of version m). Then, all the negatives E of version m are deleted. As described above, this combination process is substantially the same as the combination process of the negative delivery server 2 described with reference to FIGS. 2 and 3, and the newly created negative N Any of negatives n-1, n-2, and n-3 has the same contents as the latest all-case negative C (here, all-case negative n) in the negative delivery server 2. In addition, the latest version of all case negative C (here, version n) is added to the distributed difference negative D, and from this the terminal 3 changes the version of the newly created case negative E to version n. Manage as.

  Further, even when the negative delivery server 2 determines that the difference negative D is to be delivered by the determination process, there is no difference negative D corresponding to the version m of all the negatives E held by the requesting terminal 3. (In the illustrated example, for example, when m = n−4), all the negatives n are distributed to the terminal 3.

  In addition, when all the negatives n are distributed from the negative distribution server 2, the terminal 3 stores all the received negatives n as new all negatives E and all the negatives E of the existing version m. Performs the deletion process.

  As a result, each time an arbitrary IC card is used, the terminal 3 uses the latest all-case negative E (that is, the latest all-volume negative data A) before performing processing (such as payment processing) on the IC card. Negative check can be performed. If fraud is detected, for example, a process for making the IC card unusable (such as writing some information for making the IC card unusable) may be performed. Further, since there is no need to perform a negative check for the IC card thereafter, the negative management center 1 is notified via the negative distribution server 2 so that the data relating to the IC card is deleted from the total amount of negative data A. It may be.

In the system as described above, in this example, as described below, it is possible to shorten the processing time related to the negative data update of the terminal 3.
FIG. 5 shows a communication sequence when negative data is distributed from the negative distribution server 2 to the terminal 3. That is, a communication sequence related to the negative update process of the terminal 3 is shown.

Here, the illustrated procedures (1) to (8) are used, and hereinafter, (1) to (8) will be described.
(1) Each terminal 3 transmits a “negative acquisition request” to the negative distribution server 2 periodically (for example, every hour). This request includes a terminal ID for identifying the terminal 3 of the transmission source, version (generation) information of all case negatives E held by the terminal 3 at that time, and the like.

  (2) The negative distribution server 2 that has received the “negative acquisition request” transmits a “negative acquisition response” to the terminal 3 that is the transmission source. This response includes information on negative data to be acquired by the terminal 3 and information on a location (directory or the like) where the negative data is stored in the server 2. In other words, the transmission of this “negative acquisition response” determines the negative data to be distributed (determines whether all negatives C or differential negative D. Further, if it is set as differential negative D, it determines which of a plurality is present). Perform after processing. For example, when it is determined that the difference negative n-2 is to be distributed as in the above example, information such as the file name and storage location (directory) of the difference negative n-2 is stored in the “negative acquisition response”. Include and send.

  (3) The terminal 3 that has received the “negative acquisition response” performs file transfer processing by FTP (File Transfer Protocol) on the negative distribution server 2 based on the various information included in the “negative acquisition response”. Start (notify FTP start).

(4) Thereby, the terminal 3 acquires negative data (all the cases negative C or difference negative D) from the negative delivery server 3.
(5) The terminal 3 that has completed the acquisition of the negative data ends FTP for the negative distribution server 2 (notifies the end of FTP).

  (6) Then, the terminal 3 performs processing on the acquired negative data. Specifically, it is assumed that negative data validity check, compressed data decompression processing, difference negative merging processing, combination processing, data movement processing from the working memory to the storage memory, and the like are performed.

Through such processing, the latest all-case negative E is created. Thereafter, operation (such as fraud check) is performed using this latest all-case negative E.
(7) After creating and storing the latest all-case negative E, the terminal 3 transmits a “negative acquisition completion notification request” to the negative distribution server 2. This request includes success / failure information of the process in (6).

(8) The negative distribution server 2 that has received the “negative acquisition completion notification request” transmits a “negative acquisition completion notification response” to the terminal 3 that is the transmission source.
As described above, the update process for all the negatives E in any terminal 3 is performed.

  Here, in the negative delivery system, various terminals 3 can be considered. For example, when the terminal 3 supports a plurality of payment methods, the terminal 3 needs high processing performance, and the cost of the terminal 3 increases. For this reason, the terminals 3 constituting the negative delivery system are mixed from those having high processing performance (high cost) to those having relatively low processing performance (low cost).

  In the negative delivery system, the negative delivery server 2 and the terminal 3 are connected using the network 5, and the network 5 depends on the installation environment of the terminal 3 (for example, the environment of the store where the terminal 3 is installed). From high speed to low speed will be mixed.

  And as already stated, in the negative delivery system of this example, the negative delivery server 2 can determine the type of negative (all negatives or differential negatives) to be delivered to each terminal 3 for each terminal 3. This is possible (for example, when it is desired to distribute the differential negative D as much as possible, it is only necessary to hold a large number of all the negatives of different past generations). Determines the negative delivery method (whether all negatives or differential negatives are delivered) according to the processing performance and installation environment of each terminal 3.

Specifically, for example, the following methods (a) to (d) are conceivable as the method for determining the negative delivery method.
(A) The type of negative data to be distributed is determined according to the processing performance of each terminal 3.

  In the sequence of FIG. 5 described above, the place where the processing performance of the terminal 3 has the greatest influence on the overall processing time is “negative data processing” in (6). From this, in the negative delivery server 2, by measuring the time T1 from receiving “(5) FTP end” to receiving “(7) negative acquisition completion notification request” for each terminal 3, It is possible to grasp the processing performance for each terminal 3.

  By using this, the negative delivery server 2 delivers the difference negative when the processing performance of the terminal 3 as the delivery destination is high, so that the combination processing within the terminal 3 is performed at a high speed. If the processing performance is low, it is determined that all the negatives that do not need to be combined in the terminal 3 are distributed.

  For example, for each terminal 3, the time T1 is measured in the past (for example, the previous time) when the processing of FIG. 5 is performed with the terminal 3, and the measured time T1 and a predetermined threshold set in advance are measured. Compared with R1, when T1 ≧ R1, it is determined that the processing performance is low, and when T1 <R1, it is determined that the processing performance is high. That is, when the measurement time T1 is equal to or longer than the predetermined time R1, it is determined that the processing performance is low because the (6) “negative data processing” takes time.

  For example, the time T1 is a time measured when the differential negative D is delivered to the terminal 3 in the past, and the threshold R1 corresponds to the (6) “negative data processing” time at the time of such differential negative D delivery. Threshold. However, it is not limited to this example, and the processing time for distributing all negatives C may be used.

  The determination result (high / low processing performance) is stored in association with the terminal ID of the terminal 3. As a result, in the distribution process this time, it is possible to determine whether to distribute all the negatives or the differential negatives by referring to the stored determination results. The method for determining whether the processing performance is high or low is not limited to the example based on the measurement result of the previous time T1, and for example, the average value of the measurement result of the time T1 during the past fixed period is used. Also good.

  Further, the value of the threshold R1 may be arbitrarily set by a system administrator or the like. However, the above-mentioned “reducing the processing time related to the negative update of the terminal 3”, which is the effect of this example, is basically the case where all cases negative C is delivered and the case where difference negative D is delivered, One that requires a shorter processing time (total processing time; time taken from (1) to (8) in FIG. 5) of “terminal 3 negative update” to increase processing time This means that the processing time can be shortened compared to the case where is selected. Therefore, it is desirable that the value of the threshold value R1 is set so as to satisfy this condition. For example, the threshold value R1 is determined on the basis of an actually measured value by performing an experiment in advance.

  However, the processing time may not necessarily be shortened by 100% because there may be fluctuations in network load and the amount of data to be distributed. However, in the entire negative update process performed many times, the overall processing time can be shortened as compared with the conventional case.

(B) The type of negative data to be distributed is determined according to the load status of the network.
In the sequence of FIG. 5, the place where the network load condition has the greatest influence on the overall processing time is “negative data acquisition by FTP” in (4).

  As a result, the negative distribution server 2 measures the time T2 from when “(3) FTP start” is received until “(5) FTP end” is received, thereby grasping the network load status at that time. Is possible.

  By using this, if the network load at that time is small and communication is possible at high speed, all negatives with a large amount of data are distributed, and if the network load is large and communication is slow, the difference with a small amount of data Deliver negatives.

  As in the case of (a) above, the predetermined threshold value R2 is obtained and set in advance by experiments or the like, and the time T2 measured in the past update process is compared with this threshold value R2. For example, if T2 ≧ R2, it is determined that the network load is large, and if T2 <R2, it is determined that the network load is small, and this determination result is stored in association with the terminal ID of the communication partner terminal 3. Keep it. As a result, during the current update process, it is possible to determine whether to distribute all the negatives or the differential negatives by referring to the stored determination results.

  The measurement of the time T2 may be performed only when all the negatives C are distributed, may be performed only when the difference negative D is distributed, or may be performed when either is distributed. Good. However, since the time T2 is different between the delivery of all negatives C and the delivery of the differential negative D even when the network load is the same, the time T2 is measured only at the delivery of all the negatives C, for example. In the case of the example, the threshold value R2 is a value corresponding to all-case negative C delivery. If the time T2 is measured at both distributions, two types of threshold R2 need to be prepared corresponding to all-case negative C distribution and differential negative D distribution.

(C) The type of negative to be distributed is determined according to the number of simultaneous accesses from the terminal 3.
In general, the negative delivery server 2 such as the system of this example is designed so that negative acquisition request accesses from a plurality of terminals 3 can be received simultaneously. In this case, it is possible to grasp how many accesses from the terminals 3 are being processed at the same time when the negative distribution server 2 is present.

  Using this, if the number of simultaneous accesses from the terminal 3 at that time is large, a differential negative with a small amount of data is distributed, and if the number of simultaneous accesses is small, all negatives with a large amount of data are distributed. Is possible.

  For example, a predetermined threshold value R3 is obtained and set in advance by experiment or the like, and the current simultaneous access number is compared with the threshold value R3, so that a difference negative is distributed when the simultaneous access number exceeds the threshold value R3. When the number of simultaneous accesses is equal to or less than the threshold value R3, all negatives are distributed.

(D) The type of negative to be distributed is determined by the combination of (a) to (c) above.
The type of negative to be distributed can be determined by a combination of a plurality of factors such as the processing performance of the terminal 3, the network load status, and the number of simultaneous accesses from the terminal 3.

As an example, there is an algorithm as shown in FIG. 6, but a different algorithm or judgment logic may be used.
The negative delivery method determination process shown in FIG. 6 is a combination of all of the above (a) to (c).

  That is, when the number of simultaneous accesses is greater than or equal to the threshold R3 by the determination of (c) (step S11, YES), or when the network load is greater than or equal to the threshold R2 by the determination of (b) (when T2 ≧ R2) (step (S12, YES), or when the terminal performance is equal to or higher than the threshold value according to the determination in (a) above ("the terminal performance is equal to or higher than the threshold value" means T1 <R1, that is, when the processing performance is high) (step S13, YES) ), The difference negative is distributed (step S15).

  On the other hand, when the number of simultaneous accesses is less than the threshold value R3 (step S11, NO) according to the determination in (c) above, and when the network load is less than the threshold value according to the determination in (b) (when T2 <R2) (step S12 , NO), and if the terminal performance is less than the threshold value (T1 ≧ R1; if the processing performance is low) (step S13, YES), all negatives are distributed (step S14).

Not limited to the example of FIG. 6, for example, any two of the above (a) to (c) may be combined.
Further, the negative distribution server 2 distributes all the negatives C when the data amount of all the negatives C is small, or sets the negative distribution method according to the ratio of the total negative C data amount and the difference negative D data amount. It is also possible to use other criteria such as determining.

  As described above, according to the system, the negative delivery method, etc. of this example, the time required for the negative update at the terminal can be reduced by determining the negative delivery method according to the processing performance of the terminal 3 and the installation environment of the terminal 3. It can be shortened.

  The negative management center 1 is not necessarily limited to generating / distributing changed negative data. For example, the latest total amount of negative data at that time may always be distributed to the negative distribution server 2. Further, the generation of the difference negative D for each generation in the negative distribution server 2 is not necessarily performed. For example, during the period from when the negative management center 1 distributes the latest total amount of negative data to the negative distribution server 2 until the next latest total amount of negative data is distributed, each terminal 3 always performs its own total amount of negative data by the process of FIG. Is updated, only one differential negative D is required, and there is no need to select according to the generation of the total amount of negative data held by the terminal 3.

Next, other examples of negative delivery method determination processing will be described below with reference to FIGS.
FIG. 7 is a flowchart of another example of the negative delivery method determination process.

FIG. 8 is a specific example (part 1) of another example of the negative delivery method determination process.
FIG. 9 is a specific example (part 2) of another example of the negative delivery method determination process.
In the other example, the data size of the latest all-amount negative data (all cases negative C) held by the negative delivery server 2 is compared with the data size of the difference negative D of the generation to be delivered to the requesting terminal 3 The one with the smaller data size is distributed. Thereby, the negative data distribution time can be shortened. Further, since the difference negative D is distributed when the data amount of the difference negative D is relatively small, it can be expected that the update processing time of the own total amount negative data in the terminal 3 is shortened, and the total processing time related to the negative data update Can be expected to be shortened.

  In the process shown in FIG. 7, when a negative acquisition request from any terminal 3 (including version information of all amount negative data held by the terminal itself) is received, first, the entire amount held by the requesting terminal 3 The version of the negative data is recognized (step S21), thereby determining the difference negative D to be delivered to the requesting terminal 3 (determining which generation of the difference negative D is to be delivered), and this difference negative D Is determined (step S23). Further, the data size of the latest all-amount negative data (all cases negative C) held by the negative delivery server 2 is obtained (step S24).

  Then, the data sizes obtained in steps S23 and S24 are compared (step S24), and the smaller data size is distributed to the requesting terminal 3. That is, when the latest version of all case negative C has a smaller data amount (difference negative D size> all case negative size), the all case negative C is distributed to the requesting terminal 3 (step S25). ). Conversely, if the difference negative D has a smaller amount of data (the size of the difference negative D <the size of all negatives), the difference negative D is distributed to the requesting terminal 3 (step S26).

A specific example shown in FIG. 8 will be described. This specific example shows an example of a case where the latest version of all case negatives C will be distributed.
In the example shown in the figure, the total amount negative data held by the requesting terminal 3 is version Ver.1, and the latest total amount negative data (all case negative C) held by the negative distribution server 2 is version Ver.2. As described with reference to FIG. 4, the negative distribution server 2 holds the difference negative D corresponding to each old generation, and the contents of the difference negative D corresponding to version Ver. That is, as shown in the figure, the contents with ID number = 1, 2, 3 are deleted and the record with ID number = 4 is added, and the size is 4 records. On the other hand, all the negatives C of version Ver.2 are the size of one record as shown.

Accordingly, in this example, “the size of all the negatives C <the size of the difference negative D”, so that the process of step S25 is executed, and the total amount of negative data is distributed.
Next, a specific example shown in FIG. 9 will be described. This specific example shows an example of a case where the difference negative D is to be distributed.

  In the illustrated example, the total amount negative data held by the requesting terminal 3 is version Ver.1 (consisting of three records with ID numbers = 1, 2, and 3), and the latest total amount held by the negative distribution server 2. The negative data (all negative C) is version Ver.2. In this example, version Ver. 2 is obtained by adding a record with ID number = 4 to version Ver. 1 and has a size of 4 records. Further, as shown in the figure, the content of the difference negative D corresponding to version Ver. 1 indicates that a record with ID number = 4 is added, and is the size of one record.

  Accordingly, in this example, since “the size of all negatives C> the size of the difference negative D”, the process of step S26 is executed, and the difference negative D corresponding to version Ver. 1 is distributed. Become. The terminal 3 generates the latest full amount negative data Ver.2 using the distributed difference negative D.

FIG. 10 shows a hardware configuration of the computer 50 such as the negative management center 1 and the negative distribution server 2.
10 includes a CPU 51, a memory 52, an input unit 53, an output unit 54, a storage unit 55, a recording medium driving unit 56, and a network connection unit 57, which are connected to a bus 58. It has become.

The CPU 51 is a central processing unit that controls the entire computer 50.
The memory 52 is a memory such as a RAM that temporarily stores a program or data stored in the storage unit 55 (or the portable recording medium 59) when executing arbitrary processing. The CPU 51 executes the various processes described above using the program / data read out to the memory 52.

The output unit 54 is, for example, a display, and the input unit 53 is, for example, a keyboard, a mouse, or the like.
The network connection unit 57 is configured to connect to, for example, the networks 4 and 5 and perform communication (command / data transmission / reception, etc.) with other information processing apparatuses.

The storage unit 55 is, for example, a hard disk or the like, and stores an application program for causing the CPU 51 to implement various processes described with reference to FIGS.
The CPU 51 implements various processes described with reference to FIGS. 2 to 6 and the like described above by reading and executing various programs stored in the storage unit 55.

  Alternatively, the various programs / data stored in the storage unit 55 may be stored in the portable recording medium 59. In this case, the program / data stored in the portable recording medium 59 is read by the recording medium driving unit 56. The portable recording medium 59 is, for example, an FD (flexible disk) 59a, a CD-ROM 59b, a DVD, a magneto-optical disk, or the like.

  Alternatively, the program / data may be downloaded from another device via a network connected by the network connection unit 57. Or you may download further what was memorize | stored in the other external apparatus via the internet.

  In addition, the present invention can be configured not only as a portable storage medium recording a program for realizing the various processes of the present invention on a computer, but also as the program itself.

It is a figure which shows the structural example of the negative delivery system of this example. It is the schematic explaining the negative data delivery flow between a negative management center and a negative delivery server. (A)-(c) is a figure which shows an example of all amount / change negative data. It is the schematic explaining the negative data delivery flow between the negative delivery server of this example, and a terminal. It is a figure which shows the communication sequence which concerns on the negative update process of a terminal. It is a flowchart figure of a negative delivery system determination process. It is a flowchart figure of the other example of a negative delivery system determination process. It is a specific example (the 1) of the other example of a negative delivery system determination process. It is a specific example (the 2) of the other example of a negative delivery system determination process. It is a computer hardware block diagram.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Negative management center 2 Negative distribution server 3 Terminal 4, 5 Network 11 ID number 12 Data generation date 21 Change classification 22 ID number 23 Data generation date 50 Computer 51 CPU
52 memory 53 input unit 54 output unit 55 storage unit 56 recording medium drive unit 57 network connection unit 58 bus 59 portable recording medium 59a FD (flexible disk)
59b CD-ROM

Claims (10)

A negative distribution system in which a plurality of terminals that hold all amount negative data and perform check processing using the total amount negative data when processing the IC card, and a negative distribution server are connected to a network,
The negative delivery server
A total amount negative data acquisition means for periodically acquiring new total amount negative data;
Differential negative data generating means for generating differential negative data which is a difference between the new total negative data and past total negative data;
Negative delivery method determination means for dynamically determining which of the total amount negative data and the difference negative data is delivered as a negative delivery method every time there is a request from any of the terminals;
Negative data distribution means for distributing negative data to the requesting terminal by the negative distribution method determined by the negative distribution method determination means,
Each of the terminals includes a total amount negative data update unit that updates the total amount negative data held by itself to the new total amount negative data based on the negative data distributed by the negative data distribution unit.   The negative delivery method determining means determines the negative delivery method by comparing the processing performance of the request source terminal with a predetermined first threshold value set in advance. Negative delivery system.   The negative delivery method determining means determines the negative delivery method by comparing a network load related to communication with the requesting terminal and a predetermined second threshold value set in advance. The negative delivery system according to claim 1.   2. The negative delivery method determining means determines the negative delivery method by comparing the number of simultaneous connections from a plurality of terminals with a predetermined third threshold value set in advance. Negative delivery system.   The negative delivery method determination means compares the processing performance of the request source terminal with a predetermined first threshold value, and sets a predetermined network load related to communication with the request source terminal. And comparing the number of simultaneous connections from a plurality of terminals with a predetermined third threshold set in advance, and determining the negative delivery method based on each comparison processing result. The negative delivery system according to claim 1, wherein: The system further includes a negative management center that collectively manages the total amount negative data and updates the total amount negative data as needed.
The negative management center distributes the latest total amount of negative data at that time to the negative distribution server via the network at any time, and thereafter periodically the latest total amount of negative data at that time and the total amount of negative data at the time of the previous distribution A change negative data generation / distribution means for obtaining change negative data that is a difference between the change negative data and distributing the change negative data to the negative distribution server,
The total amount negative data acquisition means of the negative distribution server generates and acquires the latest total amount negative data by combining the changed negative data with the total amount negative data held by itself when the changed negative data is distributed. The negative delivery system according to claim 1. The negative delivery server holds a plurality of total amount negative data of different generations as the past total amount negative data,
The difference negative data generation means generates difference negative data for each of a plurality of total amount negative data of different generations when generating the difference negative data between the latest total amount negative data and the past total amount negative data. Generate negative data,
The negative data distribution unit holds the request source terminal among the differential negative data corresponding to each generation when the negative distribution method determination unit determines to distribute the differential negative data as the negative distribution method. 2. The negative delivery system according to claim 1, wherein differential negative data corresponding to the generation of the total amount of negative data is delivered to the requesting terminal.   The negative delivery method determination means determines that the smaller data size is to be delivered by comparing the data size of the differential negative data to be delivered to the requesting terminal and the data size of the total amount negative data. The negative delivery system according to claim 1 or 7, wherein The negative distribution server in a negative distribution system in which a plurality of terminals that hold all the negative data and perform a check process using the total negative data when processing the IC card and a negative distribution server are connected to a network. ,
A total amount negative data acquisition means for periodically acquiring new total amount negative data;
Differential negative data generating means for generating differential negative data which is a difference between the new total negative data and past total negative data;
Negative delivery method determination means for dynamically determining which of the total amount negative data and the difference negative data is delivered as a negative delivery method every time there is a request from any of the terminals;
Negative data distribution means for distributing negative data to the requesting terminal by the negative distribution method determined by the negative distribution method determination means;
A negative delivery server characterized by comprising: A computer of the negative distribution server in a negative distribution system in which a plurality of terminals that hold the total amount of negative data and also perform a check process using the total amount of negative data when processing the IC card and a negative distribution server are connected to a network. ,
A total amount negative data acquisition means for periodically acquiring new total amount negative data;
Differential negative data generating means for generating differential negative data which is a difference between the new total negative data and past total negative data;
Negative delivery method determination means for dynamically determining which of the total amount negative data and the difference negative data is delivered as a negative delivery method every time there is a request from any of the terminals;
Negative data distribution means for distributing negative data to the requesting terminal by the negative distribution method determined by the negative distribution method determination means;
Program to function as.