JPH0522297A - Communication network system - Google Patents

Abstract

PURPOSE:To manage even a network in which number of opposite stations is increased and its scale is enlarged by means of opposite station addresses. CONSTITUTION:The system is provided with an address division means 30 dividing an opposite station address into a prescribed number, an index reference means 40 using the divided address as a relative value to reference an index table, a final discrimination means 50 discriminating it that the divided address is a least rank of the opposite station addresses, and a control table get means 60 obtaining an opposite station control table while the division address of the least rank is used as a relative value, and the opposite station address used for an index to obtain the opposite station control table is divided in the unit of a prescribed bit and when the value able to be designated as the opposite station address is large, number of divisions is increased and then the index table is referenced.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION The present invention is used for address management in a large-scale network having a plurality of partner stations. The present invention relates to a communication network system capable of managing a partner station based on the partner station address even if the number of partner stations in the network increases.

[0002]

2. Description of the Related Art Conventionally, an address management method for obtaining a partner station control table by using a plurality of partner station addresses is shown in FIG.
As shown in (1), the partner station address 70 itself is used as one relative index value, and the address of the partner station control table 72 is obtained by referring to one index table 71.

[0003]

The above-mentioned conventional address management system refers to the index table 71 with the partner station address 70 itself as one relative index value, but the value that can be used as a relative index value is limited. Therefore, there is a certain limit to the value that can be specified as the partner station address 70, that is, the number that can be defined as the partner station is limited, and in a large-scale network in which the number of partner stations is larger, If the index table 71 is used alone to refer to the partner station control table 72, there is a problem that the index table 71 cannot be used.

The present invention solves such a problem, and an object of the present invention is to provide a system capable of managing a partner station by a partner station address even in a large scale network.

[0005]

SUMMARY OF THE INVENTION According to the present invention, a plurality of stations are connected to each other via a network, and an index table for holding a pointer indicating an address uniquely assigned to each partner station is provided in each of the stations. , A partner station control table for managing and controlling addresses for each partner station using this index table,
In a communication network system including address management means including means for obtaining an address stored in the partner station control table by referring to the index table when the partner station address is input, the index table is provided in address units. A plurality of addresses, the address management means includes means for pointing to the next index table when the divided address is not the lowest divided address, and means for pointing to the partner station control table when the lowest address, An address dividing unit that divides the address of the partner station into units of a predetermined number of bits and provides the address, and one of the addresses divided by the unit of the predetermined number of bits by this address dividing unit is used as a relative index value to refer to the index table and Index reference for index table Means and, when the index reference means uses one of the addresses divided into a predetermined number by the address division means as a relative index value, it judges whether or not the address is the lowest address of the partner station address. When the final determination means and the address divided and provided by the address division means are determined to be the lowest by the final determination means, the address is used as a relative index value to refer to the end of the index table, And a control table obtaining means for obtaining the partner station control table in address units.

[0006]

The other station address is divided into units of a predetermined number of bits, one of the divided addresses is used as a relative index value to refer to the index table, and the next index table is obtained. When referring to this index table, it is determined whether the address is the lowest address of the partner station address, and when the divided and provided address is determined to be the lowest address, that address is used as the relative index value. Then, referring to the end of the index table, the partner station control table in address units is obtained.

As a result, the partner station control table can be easily obtained, and the partner station can be easily managed by the partner station address even in a large scale network.

[0008]

Embodiments of the present invention will now be described with reference to the drawings. FIG. 1 is a block diagram showing the configuration of the embodiment of the present invention.

In the embodiment of the present invention, a plurality of stations 1 are connected to each other via a network, and each of the stations 1 has an index table 2n for holding a pointer indicating an address uniquely assigned to each partner station, A partner station control table 24 for managing and controlling an address for each partner station using the index table 2n is provided, and when the partner station address is input, the partner station control table is referred to by referring to the index table 2n. An address management unit 20 including a unit for obtaining an address stored in 24 is provided. Further, as a feature of the present invention, the index table 2n is divided into a plurality of address units, and the address management unit 20 stores the divided addresses at the maximum. If it is not a lower division address, the next index table 2
An address dividing means 30 which includes means for pointing to n, and for pointing to the partner station control table 24 in the case of the lowest rank, for partitioning and providing the partner station address in units of a predetermined number of bits.
And an index reference unit 40 for obtaining the next index table 2n by referring to the index table 2n with one of the addresses divided by the address dividing unit 30 as a predetermined number of bits as a relative index value,
When the index reference unit 40 uses one of the addresses divided into a predetermined number by the address division unit 30 as a relative index value, the final determination unit that determines whether or not the address is the lowest address of the partner station address. 50 and the address provided by being divided by the address dividing means 30 is determined to be the lowest by the final determining means 50, the address is used as a relative index value to refer to the end of the index table 2n, and the address unit Control table getting means 60 for obtaining the partner station control table 24 in
Includes means for providing the divided partner station address in order from the beginning.

The address management means 20 points to the next index table 2n when the first divided address is not the lowest divided address, and points to the partner station control table 24 when the lowest divided address. The address dividing unit 30 divides the partner station address into units of a predetermined number of bits, and the index reference unit 40 obtains a pointer to the next index table 2n from the index table 2n by a relative value. Also, the final judgment means 5
0 determines whether or not the divided address provided from the address dividing means 30 is the lowest, and the control table getting means 60 obtains a pointer to the partner station control table from the final index table 2n by a relative value.

Next, the operation of the embodiment of the present invention will be described with reference to the drawings. FIG. 2 shows an example in which the partner station address is divided into three. When the partner station address 10 uniquely assigned to each partner station is used to control the partner station, each partner station address 10 is used. In order to obtain the above information, it is necessary to obtain the partner station control table 24 used for managing and controlling the station for each partner station.

Therefore, in order to manage the partner station control table 24 in the address management means 20 for each partner station address 10 of the intended partner station, the address dividing means 30 sets the partner station address 10 to a predetermined bit. It is divided into units (8 bits divided into 3 in the case of the present embodiment), and each divided one is provided in order from the beginning of the partner station address 10, and the beginning division address (1) 11 of the partner station address 10 is provided. obtain.

Then, the final decision means 50 decides whether or not this divided address (1) 11 is the lowest address of the divided destination station address 10, and after confirming that it is not the lowest address. The index reference means 40 uses the divided address (1) 11 at the beginning of the divided destination station address 10 as a relative index value and the relative X from the start address of the index table (1) 21.
The next index table (2) 22 is obtained by referring to the location of the address "nn".

Next, the address division means 30 acquires an intermediate division address (2) 12 of the divided destination station address 10, and this division address (2) 12 is the lowest of the divided destination station addresses 10. The final determining means 50 determines whether the address is an address, and after confirming that the address is not the lowest address, the intermediate divided address (2) 12 of the divided destination station address 10 is used as a relative index value for indexing. The reference means 40 refers to the location of the address of relative X'mm 'from the start address of the index table (2) 22 to obtain the next index table (3) 23.

Further, the final division address (3) 13 of the divided destination station address 10 is divided into address division means 30.
Is obtained, the final determination means 50 determines that this divided address (3) 13 is the lowest address of the divided partner station address 10, and the divided address (3) 13 determined to be the lowest is set as a relative address. As the index value, the control table get means 60 refers to the location of the address of relative X'll 'from the head address of the index table (3) 23 to obtain the partner station control table 24 of the target partner station address 10.

FIG. 3 is a flow chart showing the flow of control performed by a program for realizing the operation of the embodiment of the present invention.

When the partner station address is input (step 101), the partner station address is divided into n (step 1).
02), after obtaining the first division address as the initial state (step 103), the first index table is obtained (step 104), and the current division address number k and division number n are compared. It is judged whether or not the other end station address is referred to from the beginning to the end (step 105). If not, the next index table (k + 1) is obtained (step 106), and the next division address (k + 1) is referred to. Then (step 107), the process returns to the determination process of step 105 (step 105). When it is judged that the process is repeated until the end, the partner station control table is obtained from the index table (k) (step 109).

[0018]

As described above, according to the present invention, since the partner station address used as an index for obtaining the partner station control table is divided into a predetermined number of bits and used as an index, the number of partner stations is Even if the value that can be specified as the partner station address increases, the number of partitions can be increased and more index tables can be referenced, so that the partner station control table can be easily obtained, resulting in a larger scale. Even in the network, there is an effect that the partner station can be managed by the partner station address.

[Brief description of drawings]

FIG. 1 is a block diagram showing the configuration of an embodiment of the present invention.

FIG. 2 is a diagram for explaining the operation in the embodiment of the present invention.

FIG. 3 is a flowchart showing a flow of operations of the embodiment of the present invention.

FIG. 4 is a diagram illustrating an operation of a conventional example.

[Explanation of symbols]

 1 station 2n, 71 index table 10, 70 partner station address 11 divided address (1) 12 divided address (2) 13 divided address (3) 20 address management means 21 index table (1) 22 index table (2) 23 index table (3) 24, 72 partner station control table 30 address division means 40 index reference means 50 final judgment means 60 control table acquisition means

Claims (1)

Claim: What is claimed is: 1. A plurality of stations are connected to each other via a network, and each of the stations has an index table for holding a pointer indicating an address uniquely assigned to each partner station, A partner station control table for managing and controlling the address of each partner station using the index table is provided, and when the partner station address is input, the index table is referred to and stored in the partner station control table. In the communication network system including an address management unit including a unit for obtaining an address, the index table is divided into a plurality of address units, and when the divided address is not the lowest divided address in the address management unit. Points to the next index table, Includes means for pointing to the partner station control table, an address partitioning means for partitioning and providing the partner station address in a unit of a predetermined number of bits, and an address partitioning unit for partitioning the address in a unit of a predetermined number of bits. One of the addresses divided into a predetermined number by the address division means is used as the relative index value by the index reference means for referring to the index table with one as a relative index value and the index reference means uses the index reference means as the relative index value. When the address is determined to be the lowest address of the address of the partner station, the final determination means determines whether the address provided by being divided by the address division means is the lowest address. , Using that address as a relative index value Communication network system with reference to the last down index table, characterized in that a control table get means for determining said other station control table in the address unit.