JPH0715440A - Identification information management method - Google Patents

Abstract

PURPOSE:To reduce a storage capacity required for the management of identification information and to allow the method to easily cope with even addition/ deletion of an identification object. CONSTITUTION:Different primes Pi,...,Pm are provided to each of identification objects 31i,...,31m as identification information so that the capacity of group information to specify all identification objects belonging to a group is small and the group information (information as to a function a) is a product among primes PA, PB, PC provided to all identification objects belonging to the group. When the identification object belonging to the group is added/deleted, the prime product is revised. The identification object belonging to the group is selected by dividing a prime product of the group with an optional prime and selecting the identification object to which the divided-out prime is provided. Whether or not an identification object belongs to a group is discriminated to be YES when the prime product of the group is divided by the prime given to the identification object and divided out.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an identification information management method, and can be applied to, for example, a node address management method for managing addresses of other nodes having a function which the own node does not have in a communication network.

[0002]

2. Description of the Related Art There are many devices and systems in which identification information is given to a plurality of elements in the device or system and elements belonging to the same group are managed by the identification information from a certain viewpoint. The network is one such system.

In some communication networks, a certain function is owned by only some nodes, and a node not having the function uses the function of another node having the function. For example, in a communication network that uses so-called personal computers and workstations as the node, the machine translation function is expensive, so only some nodes have this function, rather than all nodes. It is more practical to use the machine translation function of other installed nodes for nodes that do not exist.

FIG. 2 shows an example of such a communication network. In the communication network 10 composed of five nodes 11 to 15 to which different identification information (generally one serial number) is given, the nodes 12 and 14 own the function 1, and the nodes 13 and 14 own the function 2. Therefore, when the node 11 executes the function 1 or 2, the function of these other nodes is used.

Therefore, in such a communication network, each node needs to manage information of another node having a function that is not provided in its own node. Therefore, as shown in FIG. 3, each node has a network of another node (hereinafter referred to as a directly related node) that is directly communicable and has the function, as shown in FIG. A node address table 20 that stores the above-mentioned address (identification information: hereinafter referred to as a node address) 21 is provided.

[0006] Further, there is a case where an attempt is made to execute a predetermined function, and even if the other node of the communication partner is determined by the node address table 20 relating to the function, the partner may not be able to communicate. A node state table 25 that stores the communicability states 26 of all directly related nodes is also provided, and the information of this table 25 is also used to determine another node (node address) of the communication partner.

[0007]

However, according to the conventional node address management method, it is necessary to have the node address table 20 as shown in FIG. 3 for each function, and a lot of memory is required for such information. There was a problem that capacity was required. When a new node is added and connected, as shown in FIG. 3, the node address 22 of the node must be added to the node address table 20 related to the function of the node. Considering the above, the node address table 20 must have a margin, and the memory capacity becomes large. If the node address table 20 does not have enough room to add the node address 22, the node address table itself is reconfigured.

Further, according to the conventional node address management method, not only the node address table 20 but also the node state table 3 can be used to access the node having a predetermined function.
There was a problem that it could not be determined without referring to 0. It should be noted that one node state table 30 may be prepared regardless of the function, but naturally the memory capacity is also allocated to this table 30.

The above-mentioned problems, namely, a problem that a large storage capacity is required for managing the identification information, and that addition and deletion of the element to which the identification information is added cannot be easily dealt with, Not only in the communication network, but also in devices and systems in which identification information is given to a plurality of elements and elements that belong to the same group from a certain viewpoint are managed by the identification information and used.

The present invention has been made in consideration of the above points, and can reduce the storage capacity required for managing the identification information as compared with the prior art, and the identification provided with the identification information. The object of the present invention is to provide an identification information management method that can easily cope with changes in addition and deletion of objects.

[0011]

In order to solve such a problem, the identification information management method of the present invention according to claim 1 assigns different prime numbers as identification information defining each identification object, and groups them from a certain viewpoint. In this case, the product of the prime numbers assigned to all the identification objects belonging to the group is used as the group information for identifying all the identification objects belonging to the group.

According to a second aspect of the present invention, in the first aspect of the present invention, when selecting one or more identification objects belonging to the group, the group information which is a prime product is divided by an arbitrary prime number. When it is divisible, the identification object to which the prime number is assigned is selected.

According to the present invention of claim 3, in the present invention of claim 1, when confirming whether or not a certain identification object belongs to a group, the group information which is a prime product of the group is confirmed. It is decided to divide by the prime number given to the target identification object and to judge that the identification object belongs to the group when it is divided.

According to a fourth aspect of the present invention, in the first aspect of the present invention, each identification object is another node connected to a predetermined node in the communication network and has the same function not owned by the predetermined node. The group information of the other nodes that it has is managed by the product of the prime numbers that define each other node.

According to a fifth aspect of the present invention, in the present invention according to the fourth aspect, the other node in the communication disabled state is excluded from the group.

[0016]

When the information of the identification object belonging to a certain group is to be managed, it is necessary to individually store and manage the identification information of all the identification objects belonging to the group from the viewpoint of memory capacity. There are many problems. Therefore, the identification information management method of the present invention according to claim 1 uses the identification information that defines each identification target object so that the group information for identifying all the identification target objects that belong to the group requires only one piece of data. Group information for assigning different prime numbers and identifying all identification objects belonging to the group is the product of the prime numbers assigned to all identification objects belonging to the group.

When the identification objects belonging to the group are changed (added or deleted), the group information (prime product) for specifying all identification objects belonging to the group is naturally changed.

As a method of using such group information, there are selection of an identification object belonging to a group and confirmation of whether a certain identification object belongs to a group.

The former is defined by the present invention of claim 2, and the group information consisting of the product of prime numbers is divided by an arbitrary prime number, and when it is divisible, the identification object to which the prime number is given is selected. I am trying.

The latter is defined by the present invention of claim 3, and the group information consisting of the product of prime numbers is divided by the prime number given to the identification object to be confirmed, and when it is divisible, the identification object is Will be determined to belong to the group.

The present invention according to claim 4 is an application of the invention according to claim 1 to a communication network, wherein each identification object is another node connected to a predetermined node and is owned by the predetermined node. The group information of other nodes having the same function, which are not provided, is managed by the product of the prime numbers that define each other node.

According to a fifth aspect of the present invention, the element of the group in the fourth aspect of the present invention is another node which is not owned by a predetermined node and has the same function and which is in a communicable state. is there. In such a case, when the present invention according to claim 2 is applied, it is possible to select another node which is in a communicable state and has another function which the predetermined node does not own.

[0023]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS An embodiment in which the identification information management method according to the present invention is applied to a node address management method of a communication network will be described in detail below with reference to the drawings.

Here, FIG. 1A is a block diagram for explaining the node address management method of the embodiment focusing on the node 30, and FIG. 1B is a node address table 30 a stored in the node 30. Explanatory diagram showing the configuration of FIG.
Is a flowchart showing the node address table changing process executed by each node, and FIG. 6 is a flowchart showing the node address selecting process executed by each node.

In FIG. 1A, the node 30 includes a plurality of other nodes (directly related nodes) 31i, 31j, ...
It is directly connected to 31m. The node 30 uses the function of any of the directly related nodes for the plurality of functions a to x (see FIG. 1B) that the node 30 does not own. Therefore, in the node 30, the node address table 30a shown in FIG. 1B, the node address table change processing (configured by software or hardware) 30b showing the processing content in FIG. 5, and the processing content in FIG. Node address selection processing (configured by software or hardware) 30c indicating

In the case of this embodiment, as node address information for the node 30 to access the other directly related nodes 31i, 31j, ..., 31m, a set of two nodes of this node 30 and other directly related nodes is used. A prime number provided for each (in other words, for each link) (hereinafter, referred to as an address prime number: Moreover, since it directly defines a related node,
Pi, Pj, ..., Pm are used as appropriate. The address prime numbers Pi, Pj, ..., Pm are 2
It takes a different value for each set of nodes.

For example, when viewed from the node 30, the address prime number Pi defines the directly related node 31i, and conversely, when viewed from the directly related node 31i, the address prime number Pi.
i defines the node 30. Therefore, assigning a different address to each node is different from assigning an address to each set of two nodes, which directly defines the related node as a result. In this example,
The reason why the address is given to each set of two nodes will be described later.

Next, the structure of the node address table 30a of this embodiment will be described. The node address table 30a of this embodiment is not provided for each function a to x that accesses and executes another node, but each function a to
It is common to x.

The node address table 30a is divided into areas for each function a, ..., X possessed by other nodes, and each area stores a value related to that function (hereinafter referred to as a node address table element). Has been done. The node address function element is a product of all address prime numbers set in a set with a directly related node that has the function and is directly communicable at that time.

For example, among the directly related nodes 31i to 31m directly connected to the node 30, the address prime numbers are PA, PB, and PC (these are any of Pi to Pm.
If the node according to (1) has the function a and can communicate at that time, the address prime product PA × PB × PC is stored as the node address table element in the area of the function a of the node address table 30a. . Also,
Of the directly related nodes 31i to 31m, if the node whose address prime number is PD or PE (these are any two of Pi to Pm) has the function b and can communicate at that time, the node address table 30a In the area of function b, the address prime product PD × PE is stored as the node address table element. Further, among the directly related nodes 31i to 31m, the address prime numbers are PF, PG,
If the nodes related to PH and PI (these are any four of Pi to Pm) have the function x and can communicate at that time, the node address table element is provided in the function x area of the node address table 30a. The address prime number product PF × PG × PH × PI is stored as

The updating of the node address table 30a having such a configuration is executed as shown in FIG.
When the number of directly related nodes connected to the node 30 changes (in this case, not only the number of directly related nodes itself increases or deletions but also the number of directly related nodes does not change and the functions of the directly related nodes increase or be deleted). Alternatively, when the communication enable / disable state of the directly related node changes, the node address table changing process shown in FIG. 5 is started.

For example, in the former case, the node 30a concerned
The change is set by the operator through the input section of the above, and the latter case is the case where the signal is transmitted and received through the control signal line or the data bus.

When the node address table changing process is started, the contents of change are first discriminated (step 100).

When the number of directly related nodes to which the node 30 is connected increases or when the communication enable / disable state of any of the directly related nodes shifts to the communicable state, the node shifts to the increased directly related node or communicable state. All functions that the directly related node has (functions that the node 30 does not have)
, The node address table element is fetched from the node address table 30a, each fetched value is multiplied by the address prime number relating to the directly related node, and the obtained value is stored again in the corresponding area of the node address table 30a (step 101).

On the other hand, when the number of directly related nodes connected to the node 30 decreases or when the communication enable / disable state of any of the directly related nodes shifts to the communication disabled state, the decreased directly related node or communication disabled state is set. For all the functions possessed by the migrated directly related node (functions not possessed by the node 30), the node address table elements are extracted from the node address table 30a, and the respective extracted values are divided by the address prime numbers related to the directly related node,
The obtained value is stored again in the corresponding area of the node address table 30a (step 102).

Regarding the function information of the directly related node necessary for this processing, a table describing the functions owned by each directly related node may be prepared separately, and increased or deleted. When the operator instructs the directly related node, the function may be instructed and obtained, and further, when the communication enabled state or the communication disabled state is exchanged, the function may also be transferred and obtained. Is also good.

Next, when the node 30 needs to execute a predetermined function which is not owned by the node 30, it is performed 1
The process of determining the directly related nodes will be described.

When the node 30 determines that it should execute a function that it does not own, it starts the node address selection process shown in FIG.

First, the node address table element (address prime product) relating to the function determined from the node address table 30a is taken out, and an appropriate prime number is selected as a divisor (step 110). Then, divide the node address table element (address prime product) by the divisor,
It is determined whether it is divisible (steps 111 and 11).
2). If it is not divisible, another prime number is selected as the divisor and the same process is repeated (steps 113-111).
-112).

When such a process is repeated at least once, it is divided and the divided divisor is information defining the directly related node as a communication partner (address prime:
Node address) (step 114).

The order of changing the divisor may be the order of magnitude, or the decision value in the past may be prioritized.

As described above, since the information stored in the node address table 30a also reflects the information on the communicable state of each directly related node, the communication with the directly related node associated with the determined node address is immediately started. can do. That is, for the determined directly related node,
It is not necessary to confirm whether communication is possible after that.

Next, the node address management method of the embodiment will be described more specifically with reference to FIGS.

FIG. 7 shows a communication network composed of five nodes 41 to 45. In this network, a set of two directly connected nodes (41, 4
2), (41, 43), (41, 44), (42, 4)
5) and (43, 45) are the address prime numbers P, respectively.
1, P2, P3, P4 and P5 are assigned. The function 1 is owned by the nodes 42 and 44, the function 2 is owned by the nodes 43 and 44, and the node 41 does not own both the functions 1 and 2.

The address primes P3 and P4 or the address primes P3 and P5 may be the same. In this embodiment, the function owned by itself uses the function of another directly connected node and does not execute the communication for executing the function with the node which is not directly connected. . For example, since the node 41 is not directly connected to the node 45, the address prime numbers P4 and P5 may be any value when viewed from the node 41. However, node 42
Considering the connection from No. 43 or 43, the address primes P1 and P4 cannot be equal, the address primes P2 and P5 cannot be equal, and the address primes P3 and P4 or the address primes P3 and P5 may be equal.

By assigning an address to each set of two nodes rather than assigning an address to each node, the number of types of address values in the entire network can be reduced as described above (the same address). Preferred because the value can be used in multiple places.

The node 41 will be described below. The node 41 is directly connected to the nodes 42, 43 and 44, and shares the address prime numbers P1, P2 and P3 as a set with the directly related nodes 42, 43 and 44, respectively.
Therefore, the address prime numbers P1, P2, and P3 are selected as different values. Since the node 41 does not own the functions 1 and 2, when it is necessary to execute the function 1 or 2, it is necessary to communicate with another directly related node.

As shown in FIG. 8, when the nodes 42 and 44 are in the communicable state at that time, the node 41 has the value P1 × as the node address table element related to the function 1 of the node address table (see FIG. 6). When P3 is stored and the nodes 43 and 44 are in a communicable state at that time, the function 2 of the node address table is stored.
P2 × P3 as the node address table element related to
Is stored.

When the table is in such a state,
It is assumed that the node 41 needs to execute the function 1, and needs to determine which directly related node function 1 to use. At this time, the above-described processing shown in FIG. 6 is executed, and the node address table element P1 × relating to the function 1 is executed.
A prime number P1 or P3 that divides P3 is determined as a node address. For example, if the determined node address is P1, the function 1 of the node 42 is used by communicating with the node 42.

When the node address table is in the state shown in FIG. 8, it is assumed that a new node 46 is added to the communication network shown in FIG. 7 and the communication network changes as shown in FIG. This added node 46 is directly connected to the node 41 and has the function 1 and the function 2
If the node does not own the node (note that the added node is in a communicable state immediately after the node is added), the node address table changing process shown in FIG. 5 described above is executed in the node 41. An address prime number P6 different from the address prime numbers P1 to P3 is given to the set of the node 41 and the additional node 46.

Since the additional node 46 owns the function 1, the node address table element related to the function 1 in the node address table in the node 41 is the address prime product P1 × P3 up to that point as shown in FIG. To P
It is changed to 1 × P3 × P6. On the other hand, since the additional node 46 does not own the function 2, the node address table element related to the function 2 in the node address table in the node 41 maintains the address prime product P2 × P3 up to that point as shown in FIG. To do.

When the node address table is in the state shown in FIG. 10, the communication network shown in FIG.
It is assumed that the node 44 is deleted as shown in 1. The deleted node 44 is the one directly connected to the node 41, and the function 1 not owned by the node 41
Since it owns the nodes 1 and 2, the node address table changing process shown in FIG. 5 is executed in the node 41.

Since the deletion node 44 owns the function 1, the node address table element related to the function 1 in the node address table in the node 41 is the address prime product P1 × P3 × so far as shown in FIG. P6 is changed to P1 × P6, and similarly, the node address table element related to the function 2 in the node address table in the node 41 is changed from the previous address prime product P2 × P3 to P2 as shown in FIG. It

As described above, according to the above-described embodiment, the information of another node having a function which is not owned by one node is stored and managed as a product of prime numbers. Therefore, the memory capacity can be reduced.

Further, according to the above embodiment, it is not necessary to change the memory capacity to be used or the information storage configuration for the addition or removal of other nodes, and it is possible to easily cope with the situation. be able to.

Further, according to the above-mentioned embodiment, not only other node information having a function that the self does not own,
It is possible to manage the communication availability status of other nodes with the same stored information. As a result, the dedicated storage unit that manages the communication availability status of the directly related node can be omitted.

Furthermore, according to the above-mentioned embodiment, since the information (address prime number) defining the communication partner node is the information for the pair between the two nodes, that is, it is not the information peculiar to each node. The selected value can be given to different parts of the communication network, which facilitates selection of such information. When it is attempted to add information defining a communication partner node, which is a prime number, to each node, a node to which a large prime number is added appears if the network scale is large, and the bit width of such information must be increased.

The present invention is not limited to the above-mentioned embodiments, but allows various modified embodiments as illustrated below.

(1) In the above embodiment, the information of the other node having the function not possessed by the self node is managed including its communicable state, but the communicable state of the other node is a separate address. You may make it manage by a prime product. For example, if communication other than complementing a function not owned by the own node is also required, information on the communicable state alone is also useful.

(2) The communication network to which the above embodiment can be applied may be any of mesh, bus, and star.

(3) In the above embodiment, the information for each function of the node address table is used when one other node is selected, but the method of use is not limited to this. For example, it can be used to confirm whether a certain node has a predetermined function. In this case, the prime product (node address table element) of the address primes related to that node
If it is divided, it is determined to belong. Also,
For example, it can be naturally used for selecting a plurality of other nodes.

(4) In the above embodiment, the identification information that defines the other node that executes communication is given to each set of two nodes. However, it is given to each other node uniquely to that node. Is also good. A communication network to which such a granting method can be applied is limited to a small scale to some extent.

(5) The present invention is not limited to use in the communication network as in the above embodiment, but can be applied to various systems and devices using identification information (address or identifier). For example, in a database system for managing personal information, a prime number is assigned to each individual, and as personal information satisfying an item (for example, a man) of a certain viewpoint, the product of the prime numbers given to all individuals (man) satisfying the item is calculated. You can manage. Also, group information of a plurality of processors provided in an apparatus that realizes a predetermined function may be managed by a product of different prime numbers assigned to each processor. Furthermore, it can also be used when managing subroutines related to the same function. In short, different prime numbers are assigned as identification information that defines each identification object, and when grouping from a certain point of view, as group information for identifying all identification objects that belong to that group, all belonging to that group It is sufficient to use the product of the prime numbers given to the identification object.

[0064]

As described above, according to the present invention, different prime numbers are given as identification information defining each identification object,
Since the product of the prime numbers given to all identification objects belonging to the group is used as group information for specifying all identification objects belonging to the group when grouped from a certain viewpoint. It is possible to reduce the required storage capacity in comparison with the above, and it is also possible to easily cope with changes in the addition and deletion of the identification object.

[Brief description of drawings]

FIG. 1 is a block diagram for explaining an embodiment method and an explanatory diagram showing a node address table.

FIG. 2 is a block diagram showing an example of a communication network.

FIG. 3 is an explanatory diagram showing a node address table according to a conventional method.

FIG. 4 is an explanatory diagram showing a node state table according to a conventional method.

FIG. 5 is a flowchart showing a node address table changing process according to the embodiment.

FIG. 6 is a flowchart showing a node address selection process executed by each node of the embodiment.

FIG. 7 is a diagram (part 1) for explaining the embodiment more specifically.

FIG. 8 is a diagram (part 2) for explaining the embodiment more specifically.

FIG. 9 is a diagram (part 3) for explaining the embodiment more specifically.

FIG. 10 is a view (No. 4) for explaining the embodiment more specifically.

FIG. 11 is a view (No. 5) for more specifically explaining the embodiment.

FIG. 12 is a diagram (No. 6) for explaining the embodiment more specifically.

[Explanation of symbols]

30 ... Node, 30a ... Node address table, 30b ... Node address table change processing, 30c ... Node address selection processing, 31i-31m ... Node directly connected to node 30, Pi-Pm ... Address prime number, PA-PI ... Any of the address prime numbers Pi to Pm.

Claims (5)

[Claims] 1. A group having different prime numbers as identification information defining each identification object, and when grouping from a certain point of view, as group information for specifying all identification objects belonging to the group, An identification information management method characterized by using a product of prime numbers given to all the identification objects to which it belongs. 2. When selecting one or more identification objects to which the group belongs from the group, the group information, which is a product of prime numbers, is divided by an arbitrary prime number, and when it is divisible, the identification number is assigned. The identification information management method according to claim 1, wherein an object is selected. 3. When confirming whether or not a certain identification object belongs to a group, the group information, which is a prime product of the group, is divided by a prime number given to the identification object to be confirmed. The identification information management method according to claim 1, wherein it is determined that the identification target object belongs to a group when it is divided. 4. Each of the identification objects is another node connected to a predetermined node in a communication network,
2. The identification information management method according to claim 1, wherein group information of other nodes having the same function that are not owned by a predetermined node is managed by a product of prime numbers that define each other node. 5. The identification information management method according to claim 4, wherein the other node in the communication disabled state is excluded from the group.