JP2690648B2 - Network address management device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

The present invention is used for a communication control program of a host computer. The present invention relates to a management method of a network address that is uniquely addressed for each network resource.

[0002]

2. Description of the Related Art In the conventional example, a single network address pointer list having a maximum network address determined at the time of starting a communication control program as an upper limit is generated, a network resource table is registered, and the network address pointer is searched at the time of retrieval. The value of the network address was searched in the list as an offset, and the corresponding network resource table was acquired.

[0003]

As described above, in the conventional example, the network address pointer list having the upper limit of the maximum network address determined when the communication control program is started must be generated. If it is not allocated, the memory is wasted. In addition, memory access may not be possible if the maximum network address is significantly large. In addition, since the pointer list is searched using the network address as an offset when searching or deleting, there is a possibility that the network address of the network resource to be registered cannot be offset-modified, which is inconvenient when controlling a large-scale network. .

The present invention eliminates such drawbacks, and an object of the present invention is to provide a network address management device capable of registering a desired network resource with a constant memory resource regardless of the total number of registered network resources. .

[0005]

According to the present invention, there is provided a network address composed of n bytes which represents a unique network resource in the communication control software of a host computer, and a network address management program which manages a plurality of network resources. In the provided network address management device, a base table generated at the initial startup of the communication control software, a group of n network address pointers in a tree structure pointed from the base table 1, and a group of the network address pointers Network address assembling means for assembling the network address based on the offset information of the entry in the And a network resource table pointed to by one network address pointer list in the network address pointer list group, the network address management program comprising: , And means for accessing the network resource table using the network address.

[0006]

The n network address pointer list group of the tree structure is pointed from the base table generated at the initial activation of the communication control software. The network address pointer list group is expanded to the network address pointer list group based on the offset information obtained from the network address constructed based on the offset information of the entry. The network resource table is pointed to by one of the network address pointer lists in the network address pointer list group. The network address management program uses the network address to access the network resource table. As a result, the memory used for managing the network addresses of a large amount of network resources is efficiently used, and even when searching for network resources, processing at a predetermined speed that does not depend on the total number can be performed.

[0007]

An embodiment of the present invention will be described below with reference to the drawings. FIG. 1 is a diagram showing this embodiment.

In FIG. 1, the network address pointer list is set to N. A. P. It is abbreviated to L. In this embodiment, the base table 1 and the first network address pointer list 2.1.1 to the nth network address pointer list group 2. 1 pointed from the base table 1. n, a network address 4 composed of n bytes representing a unique network resource in the host computer, the first network address pointer list 2.1.1 to the nth network address pointer list group 2. 2. Network address assembling means for assembling the network address 4 by obtaining the offset information from n.
1 and the offset information from the network address 4 to obtain the first network address pointer list 2.1.1.
~ Nth network address pointer list group 2. network address expanding means 3.2 for expanding to n, and nth
Network address pointer list group 2. 2 is composed of a network resource table 5 pointed to by n and an application program 6 for accessing the network resource table 5 by using a network address 4. FIG. Address network list group 2. It represents a tree structure up to n. This tree structure has the base table 1 as its apex, and has a spread of 256 entries at each level. Therefore, the number of network resources that can be represented by this tree structure is 256 n.

In this embodiment, as shown in FIG. 1, a network address 4 composed of n bytes representing a unique network resource in the communication control software of the host computer and a network address management for managing a plurality of network resources. With program 6
Further, as a feature of the present invention, the base table 1 generated at the initial startup of the communication control software, and the n network address pointer list groups 2. of the tree structure pointed from the base table 1.
1.1 to 2. n. kn−1 and this network address pointer list group 2.1.1 to 2. n. kn
Network address assembling means 3.1 for assembling the network address 4 based on the offset information of the entry within −1, and this network address assembling means 3.1
Network address pointer list group 2.1.1 or 2. n. network address expanding means 3.2 for expanding to kn−1 and network address pointer list groups 2.1.1 to 2. n. kn-1
Of the network address pointer list, and the network address management program 6 includes means for accessing the network resource table 5 using the network address 4.

Next, the flow of this embodiment will be described with reference to FIG.

First, the registration of network resources will be described. At the time of registration, the network resource table 5 is given as an input parameter, and the network address 4 is returned to the network address management program 6. As a result, the network address management program 6 can access the network resource table 5 thereafter by using the network address 4. Next, the registration method will be described. Whether or not the first network address pointer list 2.1.1 exists is determined by whether or not there is a link from the base table 1, and if there is not, the first from the pool managed memory
The network address pointer list 2.1.1 is acquired and linked to the base table 1. The pool management means will be implemented using existing technology. Next, the pointer to the second network address pointer list 2.2.1 is obtained from the pointer entry to the first second network address pointer list 2.2.1 on the first network address pointer list 2.1.1. . When the pointer to the second network address pointer list 2.2.1 does not exist, the first network address pointer list 2.1.1 is acquired from the pool-managed memory and linked to the base table 1. Similarly, a pointer from the second network address pointer list 2.2.1 to the third network address pointer list 23.1 is obtained, and this operation is performed for the nth network address pointer list 2.3.1. n. Repeat until 1. List of nth network address pointers 2. n. If 1 is obtained, the pointer entry to the network resource table 5 is searched for an empty one, and if there is a space, the pointer to the network resource table 5 is set. If there is no space, the nth network address pointer list 2.
n. 1. The n-1th network address pointer list in 1. List of pointers from n-1.1 to n-1th network address pointer list 2. 1. Obtain n-1. 1.
2nd nth network address pointer list on n-1. n. 2 is searched for an empty pointer entry in the network resource table 5, and if there is a free space, the pointer to the network resource table 5 is set. If there is no vacancy, then the nth
-1 Network address pointer list 2. n-1.
1 is also obtained, and the (n-1) th network address pointer list 2. n-1. 1. The third nth network address pointer list on 1. n. Ask for 3. The same operation is performed for the nth network address pointer list 2. n. Repeat up to 256 times until the pointer to the network resource table 5 can be set on m. Even if repeated 256 times, the nth network address pointer list 2. n.
If there is no entry that can set the network resource table 5 on m, the (n-2) th network address pointer list 2. n-2. Go back to 1 and perform the same operation. 1.n-2 network address pointer list
n-2. If 1 is not possible, the n-2nd network address pointer list 2. n-3. Go back to 1. The same backward operation is performed by the first network address pointer list 2.
Perform up to 1.1. If the first network address pointer list 2.1.1 is invalid, the registration overflows. Next, a mechanism for assembling the network address 4 by the network address assembling means 3.1 will be described. Now, it is assumed that the network resource table 5 is registered in the position shown in FIG. 1 by the mechanism described above.
At that time, the network address assembling means 3.1 is
A second network address pointer list 2.2. 1 on the network address pointer list 2.1.1. Offset of entry to k1 "k1", second network address pointer list 2.2. List of third network address pointers on k1 2.3. Offset of entry to k2 "k2", third network address pointer list 2.3. Fourth network address pointer list on k2 2.3. 1. Offset of entry to k2 "k3", nth network address pointer list n. Network resource table 5 on kn-1
The offset "kn" of the entry to is stored. The network address assembling means 3.1 assembles the network address 4 from each of the stored offsets and notifies the network address management program 6 of it. In this way, the network resource registration is completed, and the network address management program 6 sets the network address 4
You will get

Next, a search for network resources will be described. Now, it is assumed that the network resource table 5 is registered in the position shown in FIG. 1 by the above-described registration of the network resource, and the network address management program 6 searches the network resource table 5 using the network address 4. The network address expanding means 3.2 decomposes the network address 4 transferred from the network address management program 6 into n pieces by 1 byte. The decomposed network addresses 4 respectively correspond to the second network address pointer list 2.2.1 on the first network address pointer list 2.1.1. Offset of entry to k1 "k1
, Second network address pointer list 2.
2. List of third network address pointers on k1 2.3. Offset of entry to k2 "k2", third
Network address pointer list 2.3. Fourth network address pointer list on k2 2.3. k2
Offset of entry to "k3", nth network address pointer list 2. n. Offset "k of entry to network resource table 5 on kn-1
n ". Then, using the offset "k1", the second on the first network address pointer list 2.1.1
Network address pointer list 2.2. From the k1 entry to the second network address pointer list 2.
2. Find k1. Similarly, using the offset "k2", the second network address pointer list 2.2. k
1. Third network address pointer list on 1.
3. k2 entry to third network address pointer list 2.3. Find k2. The same operation is performed for the nth network address pointer list 2. n. The process is repeated until kn−1 is obtained, and the nth network address pointer list 2. n. The network resource table 5 is accessed by finding the pointer of the target network resource table 5 from the offset "kn" at kn-1.

Finally, the deletion of network resources will be described. Now, it is assumed that the network resource table 5 is registered at the position shown in FIG. 1 by the above-described registration of the network resource, and the network address management program 6 deletes the network resource table 5 using the network address 4. List of nth network address pointers 2. n. The pointer entry of the network resource table 5 in kn-1 is made an empty entry. List of nth network address pointers 2. n. If all the pointer entries in the network resource table 5 in kn-1 are exhausted, the nth network address pointer list 2. n. Delete kn-1. 1. List of n-1th network address pointers n-1. List of nth network address pointers in kn-2 n. If all kn-1 entries are exhausted, the n-1th network address pointer list 2. n-1. Delete kn-2. Thereafter, similarly, the data is dynamically deleted by tracing back to the first network address pointer list.

[0014]

As described above, the present invention has an effect of registering a target network resource with a constant memory resource regardless of the number of registered network resources when registering the network resources.

Also, when searching for network resources, there is an effect that processing can be performed at a constant speed that does not depend on the total number.

In addition, the memory for creating the necessary table (pointer list) is dynamically created or deleted, and it is not necessary to reserve it in advance and unnecessary memory is not used. When the total number is small, there is an effect that the memory resource can be used for another purpose.

By increasing the number of n as long as the memory resources of the host computer allow, the maximum manageable number of network resources can be increased without depending on the memory access architecture of the host computer. is there.

[Brief description of the drawings]

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

FIG. 2 is a configuration diagram showing a relationship between network address pointer lists included in FIG.

[Explanation of symbols]

1. Base table 2.1.1 to 2. n. kn-1 network address pointer list 3.1 network address assembling means 3.2 network address expanding means 4 network address 5 network resource table 6 network address management program

Claims (1)

(57) [Claims] 1. A network address management device comprising a network address composed of n bytes representing a unique network resource in the communication control software of a host computer, and a network address management program for managing a plurality of network resources. Based on a base table generated at the initial startup of the communication control software, a group of n network address pointer lists having a tree structure pointed from the base table 1, and offset information of entries in the network address pointer list group. Network address assembling means for assembling the network address, and the net based on the offset information obtained from the network address assembled by the network address assembling means. Network address expansion means for expanding the network address pointer list group, and a network resource table pointed to by one network address pointer list in the network address pointer list group. A network address management device comprising means for accessing the network resource table using an address.