JPH10257066A - Network address retrieval system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To obtain an address control table retrieval system capable of simultaneously retrieving an address and a masked address and speeding up the retrieval of the address. SOLUTION: In the retrieval of an IP address 133. 141. 77. 59, the address is divided into four addresses, i.e., 133, 141, 77, 59 and a first control table, a second control table, a third control table, a fourth control table are successively retrieved by using values of each address. In the retrieval of each control table, a retrieval end/continuation flag in the control table corresponding to the divided addresse is read, the end or continuation of the retrieval is decided and when the retrieval is continued, the next table pointer of the control table used in the next retrieval corresponding to the divided address in the control table is read. Each control table is repeatedly read and retrieved until the end of the retrieval.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a network address search method for searching for a network address in a network relay device or in a terminal connected to the network.

[0002]

2. Description of the Related Art An information communication network system is a network in which a large number of terminals and relay devices are interconnected. FIG. 11 shows an information communication network system, where 1 is a wide area network, 11, 12 and 1.
3 is a relay device, 21 to 24 are terminals. Relay device 1
3, the interface A is connected to the relay device 11, the interface B is connected to the relay device 12, the interface C is connected to the terminal 24, and the interface D is connected to the wide area network 1. In communication between terminals, an address is used to identify a communication partner terminal. The terminal searches for information related to the address of the communication partner terminal using the address, and determines an operation by using the searched information. Further, the relay device searches for information related to the address using the address of the communication terminal for relay processing, particularly for determining the route of the relay data. For these address searches,
The search must be speeded up and the data transfer delay must be reduced.

[0003] A terminal or a relay device holds information related to an address generated by multiplying the address by an address mask. Thus, since a plurality of pieces of information related to a plurality of addresses before the address mask is applied are not held, the amount of information to be held is reduced. The address mask is used by masking several bits located at the lower part of the address. In the address search, there are a plurality of search results for each bit length to be masked in the search of a certain address, but a method of selecting from search results having a large bit length which is not masked is adopted. This is called a mask longest match. In the address search, the search corresponding to the longest match of the address mask must be speeded up.

FIG. 12 shows a routing table used by the relay device 13 to determine an interface for transmitting received data. In FIG. 12, the destination network is 26.0.0.0 and the address mask is 255.0.0.
The corresponding destination address of 0.0.
Data to 26.255.255.255 is transmitted from transmission interface A to the line. The destination network is 133.141.76.0 and the address mask is 25
Applicable destination address 13 of 5.255.252.0
3.1411.76.0 to 133.141.77.955
Is transmitted from the transmission interface A to the line.

If the destination network is 133.141.7
7.0 with an address mask of 255.255.255.0
Destination address 133.141.77.0-1
Data to 33.141.77.255 is transmitted from transmission interface B to the line. The destination network is 133.141.77.59 and the address mask is 25
Applicable destination address 1 of 5.255.255.255
Data to 33.141.77.59 is transmitted from transmission interface C to the line. And all addresses are
The data is transmitted from the transmission interface D to the line.

When the relay apparatus 13 receives data addressed to the destination address 133.141.77.59 from the interface D, the relay apparatus 13 must determine an interface for transmitting the received data for relay. 133.141.77.59 satisfies the conditions of the respective destination addresses to the transmission interface A, the transmission interface B, and the transmission interface C, but the longest match of the address mask is 255.255 due to the longest match of the address mask. . 255.255 to the interface C.

FIG. 13 is a pointer table used in the conventional network address search system disclosed in Japanese Patent Application Laid-Open No. Sho 62-91038, for example.
The pointer table is composed of a table pointer “0” to a table pointer “63”, and each path control table has a next table pointer pointing to another path control table, an IP address, an IP address mask, a transmission interface, and a path control table. It consists of a synonym pointer that indicates whether there is a connection.

Next, the operation will be described. In this conventional example, the hash value of the IP address is taken and used as an index for searching the pointer table. That is, when arranging a large number of path control tables, the I
Take the hash value of the P address. Suppose now that the calculation method of the hash value is such that 32 bits of the IP address are divided into 8 bits, and the least significant 6 bits of the addition of the divided four numbers are used as the hash value. Set the IP address of the path control table to 2
6.0.0.0, the IP address mask is 255.0.
If it is 0.0, the hash value is 26 + 0 + 0 + 0
= 26, which is the least significant 6 bits. Therefore, FIG.
Table pointer "26" of the pointer table shown in FIG.
Is set to point to the path control table. Change the IP address of the path control table to 133.141.76.
0, IP address mask 255.255.252.0
, The hash value is 133 + 141 + 76 +
The least significant 6 bits of 0 = 350 are 30. Therefore, the table pointer "3" of the pointer table shown in FIG.
0 "is set to indicate the path control table.

The IP address of the path control table is set to 13
3.141.77.0, IP address mask 255.
If it is 255.255.0, the hash value is 13
3 + 141 + 77 + 0 = 351, which is the least significant 6 bits, is 31. Therefore, the table pointer "31" of the pointer table shown in FIG. 13 is set so as to point to the path control table. The IP address of the path control table is 133.141.77.59, and the IP address mask is 2
Assuming that 55.255.255.255, the hash value is 133 + 141 + 77 + 59 = 410, the lowest 6
This is bit 26. Accordingly, the table pointer “26” of the pointer table shown in FIG. 13 has an IP address of 26.0.0.0 and an IP address mask of 255.
Since a 0.0.0.0 path control table is set,
The IP address is set to 26.0.0.0, and the IP address mask is set to the next table pointer of the path control table of 255.0.0.0 so as to point to the path control table.

[0010] Similarly, the same processing is performed for all the path control tables, and the path control tables are previously arranged at the positions of the corresponding table pointers. That is, a path control table in which the hash value of the IP address is 0 is arranged at the position of the table pointer “0”. When the path control tables are arranged in this way, a plurality of path control tables are naturally arranged at the position of a certain table pointer. Accordingly, as shown in FIG. 13, the table pointer "26" of the pointer table "26"
For example, when there are two path control tables at the position of “26”, the IP address 2 is stored in the table pointer “26”.
It is set to point to the path control table of 6.0.0.0, and the next table pointer in the path control table of IP address 26.0.0.0 is the IP address 133.14.
It is set to point to the path control table of 1.77.59, and the IP address 133.14 is set in the synonym pointer in the path control table of IP address 26.0.0.0.
Indicates connection to the path control table of 1.77.59 "
1 ". IP address 133.141.77.
The synonym pointer in the path control table 59 is set to “0” indicating that there is no connection. Depending on the table pointer, there is no path control table of the corresponding hash value, and a specific value indicating that there is no corresponding path control table, for example, “0” is set in the table pointer.

In the example shown in FIG. 13, the table pointer "
A unique IP address 133.14 at the location indicated by 30 "
There is a 1.76.0 path control table. "0" is set in the synonym pointer to indicate that there is no connection.
Similarly, at the position indicated by the table pointer “31”, the IP address
There is a path control table at address 133.141.77.0. In the search of the IP address, the longest match of the IP address mask is used to sequentially search from the IP address masked with the long IP address mask value to search for a matching control block.

IP address 133.141.78.11
For example, in the first search, the IP address masked with the IP address mask 255.255.255.255 is used in the first search.
The address 133.141.78.111 is searched, and 13
The table pointer “15” of the pointer table is read from the hash value 15 which is the lower 6 bits of 3 + 141 + 78 + 111 = 463, but the corresponding path control table is not set. Is searched for the IP address 133.141.78.110, and there is no matching path control table. Therefore, in the next search, the IP address 133.141.78.110 masked with the IP address mask 255.255.255.252. Search 108. These searches are continued until the IP address 133.141.78.0 is obtained by reducing the mask length by one bit and masking the IP address 133.141.78.111 with the IP address mask 255.255.252.0. The corresponding path control table is detected by searching for the IP address 133.141.76.0 masked with the IP address mask 255.255.252.0, the information of the transmission interface A is obtained, and the search ends.

In the search for each IP address, a hash value of the IP address is calculated, and the I value in the path control table at the position indicated by the corresponding table pointer in the pointer table is calculated.
The P address is compared with the IP address mask, and if they match, the search ends. If the result of the comparison does not match, the next path control table to be linked is searched, and the search is continued to the last control table to be linked.

IP address 133.141.77.59
For example, in the first search, the IP address 133.141.77.59 masked with the IP address mask 255.255.255.255 is searched in the first search, and 133+
The table pointer "26" of the pointer table is read out from the hash value 26, which is the lower 6 bits of 141 + 77 + 59 = 410, and the corresponding path control table has the IP address 26.0.0.0.
Since the synonym pointer of the path control table with the P address 26.0.0.0 is “1”, the IP address 133.141.77.59 pointed to by the next table pointer is read, and the IP address mask 255.25 is read.
5. IP address masked with 5.255.255 133.
The corresponding path control table is detected by the search of 141.77.59, the information of the transmission interface C is obtained, and the search is terminated.

When a matching path control table is detected by searching for an IP address, the relay apparatus transmits relay data to the line from the transmission interface of the detected path control table. If there is no matching path control table in the IP address search, an unregistered result is obtained. In this case, the relay data is transmitted from the transmission interface D to the line.

[0016]

Since the conventional network address search method is configured as described above,
If a large number of hash values calculated from the P address match, the number of linked control tables will increase by the number of IP addresses with matching hash values. Unless the control table is searched, the search is not terminated, so that the number of searches increases. In addition, in the search based on the longest match of the IP address mask, the search is performed in order from the IP address masked with the long IP address mask value. Therefore, in order to obtain an unregistered search result, all the IP address mask values are masked. There is a problem that the number of searches increases because the search must be performed using the IP address.

The present invention has been made to solve the above problems, and has as its object to provide a network address search method capable of speeding up address search. It is another object of the present invention to provide a network address search method capable of simultaneously performing an address search and a search with a mask applied to an address, thereby speeding up the address search.

[0018]

According to a first aspect of the present invention, a network address search system registers information (hereinafter, address information) corresponding to a network address in a relay device of a network or in a terminal connected to the network. In the network address search method to search,
Dividing the above network address into multiple addresses,
Corresponding to the divided address (hereinafter referred to as a divided address), a control table having information for identifying whether the search is completed or continuing, and a table pointer pointing to a control table corresponding to the next lower divided address if continuation is provided, When registering the same address information corresponding to a plurality of network addresses specified by using an address mask, the above network addresses are divided, and registered even if the upper divided address is the same and the lower divided addresses are different from each other. If the address information to be registered is the same, the search end and the address information are registered in the control table corresponding to the upper divided address, and if the address information to be registered in the lower divided address control table is different from the registered address information. , Table pointing to control table corresponding to search continuation and lower division address Repeatedly to register the control table corresponding to the interface to split the upper address, and registers the search end and address information in the control table corresponding to the divided address has been reached the lowest division address,
If the search end is registered in the control table corresponding to the upper division address for the network address to be searched, the address information corresponding to the division address is obtained, and if the search continuation is registered, the next table pointer , A control table corresponding to the next lower-order divided address is obtained, and the above process is repeated until the search is completed, thereby searching for address information.

A network address search method according to a second invention is a network address search method for registering and searching for a processing entry address corresponding to a network address in a relay device of a network or in a terminal connected to the network. A control table having a processing entry address and a table pointer pointing to a control table corresponding to the next lower divided address corresponding to the divided network address (hereinafter referred to as a divided address); When registering a processing entry address corresponding to a plurality of network addresses specified by using an address mask, the above-described processing is performed regardless of the lower divisional address, in which the plurality of network addresses are divided and the upper divisional address is the same. Entry door If the address is the same, the processing entry address corresponding to the upper division address is registered in the control table. If the processing entry address differs depending on the lower division address, the search is continued with the table pointer indicating the control table corresponding to the lower division address. If the search function is registered in the control table corresponding to the higher division address, and the processing entry address is registered in the control table corresponding to the higher division address for the network address to be searched, the processing entry corresponding to the division address If control is passed to the address and the entry address of the search function that continues the search is registered, the control table corresponding to the next lower divided address is obtained from the next table pointer, and the above is sequentially repeated until the search is completed. Check processing entry address It is intended to.

[0020]

BEST MODE FOR CARRYING OUT THE INVENTION

Embodiment 1 FIG. This embodiment will be described with reference to FIG. 1 based on the network configuration shown in FIG. 11 and the routing table in the relay device 13 shown in FIG. FIG. 1 is an address control table for storing a transmission interface for an IP address. Reference numeral 31 denotes a first control table, which includes a divided address serving as an index from A000 to A255, a search end / continuation flag, a next table pointer, and a transmission interface for determining a relay data transmission destination. 32 is a second control table, from B000 to B2
It is composed of a divided address serving as an index up to 55, a search end / continuation flag, a next table pointer, and a transmission interface for determining a relay data transmission destination. Reference numeral 33 denotes a third control table, which includes a divided address serving as an index from C000 to C255, a search end / continuation flag, a next table pointer, and a transmission interface for determining a relay data transmission destination. Reference numeral 34 denotes a fourth control table, which is composed of a divided address serving as an index from D000 to D255, a search end / continuation flag, a next table pointer, and a transmission interface for determining a relay data transmission destination. Note that the address control table includes a first control table 31, a second control table 32, a third control table 33, and a fourth control table 34.

Next, the operation will be described. 2 and 3 are diagrams showing the processing procedure of the network address search method according to the present invention. In the present embodiment, a 32-bit I
The P address is divided into four for every 8 bits, the four numbers are separated by ".", And each is converted to a decimal number to represent a four-stage control table. End of search /
The continuation flag is set to “0” when it indicates that the search is completed, and is set to “1” when the search is continued to the next control table. "0" indicating search end is set in the search end / continuation flag.
Is set in the transmission interface paired with the search end / continuation flag, the interface name for transmitting the relay data is set. When the search end / continuation flag is set to “1” indicating that the search is continued, the search end / continuation flag is set.
The pointer to the control table to be searched is set in the next table pointer that is paired with the continuation flag.

IP address 133.141.77.59
IP address mask 255.2 for long match
IP address 13 masked with 55.255.255
An example will be described in which 3.141.77.59 and the corresponding transmission interface C are registered in the address control table. The search end / continuation flag 312 of the address A133 of the first control table 31 is set to "1" indicating the search continuation, and the next table pointer 313 paired with the search end / continuation flag 312 is set to the second control table. B000 is set as a pointer to 32. The search end flag 322 of the address B141 of the second control table 32 includes
The next table pointer 323 paired with the search end / continuation flag 322 is set to “1” indicating the search continuation and the third
C000 is set as a pointer to the control table 33. The search end / continuation flag 332 of the address C077 of the third control table 33 is set to "1" indicating continuation of the search, and the next table pointer 333 paired with the search end / continuation flag 332 is set to the fourth control table. D000 is set as a pointer pointing to D.34. Search end / continue flag 342 at address D059 in fourth control table 34
Is set to "0" indicating the search end, and C is set to the transmission interface paired with the search end / continuation flag 342.

Next, the IP address 133.141.7
If the IP address mask 255.255.255.0 is masked in a state where 7.59 is registered, IP address
All IP addresses that become address 133.141.77.0, but registered IP addresses 133.14
Excluding 1.77.75, ie 133.141.77.0
An example will be described in which the transmission interface B is registered in the address control table corresponding to an IP address of 133.141.77.255. Regarding the registration method in the first control table 31, the second control table 32, and the third control table 33, the IP address 133.141.77.59
Same as registration. Since the search end / continuation flag 342 of the address D059 of the fourth control table 34 has already been set, addresses D000 to D000 other than the address D059 are set.
The search end / continuation flag 342 of D058 and D060 to D255 is set to “0” indicating the end of search, and the search end / continuation flag 342 is set.
The transmission interface paired with the continuation flag 342 has B
Set.

In the state where the above IP address is registered, the IP address mask 255.255.2
If masked with 52.0, the IP address 133.141.
All IP addresses that will be 76.0, except for IP addresses 133.141.77.0 to 133.141.7
Excluding 7.255, i.e. 133.141.76.0-1
33.141.76.255 and 133.141.78.
An example will be described in which the transmission interface A is registered in the address control table in correspondence with the IP address of 0 to 133.141.79.255. For the setting of the first control table 31 and the second control table 32, the IP address 13
This is the same as the example of setting 3.141.77.59. Since the search end / continuation flag 332 of the address C077 of the third control table 33 has already been set, the address C077
76, C078 and C079 search end / continuation flag 33
2 is set to “0” representing the end of the search, and A is set to the transmission interface paired with the search end / continuation flag 332.

When the IP address is registered, the IP address mask is 255.0.0.0.
I becomes 26.0.0.0 if masked by
All P addresses, ie, 26.0.0.0 to 26.25
An example will be described in which the transmission interface A is registered in the address control table corresponding to the IP address of 5.255.255. The search end / continuation flag 312 of the address A026 of the first control table 31 is set to "0" indicating the end of the search, and A is set to the transmission interface paired with the search end / continuation flag 312.

In the registration of the IP address in the control table, the registration is performed from the first control table 31 using the IP address and the IP address mask. A second control table 32,
The third control table 33 and the fourth control table 34
Depending on the setting value of the next table pointer, there are a plurality of them. The search end / continuation flag corresponding to the unregistered IP address is set to “0” indicating the search end, and the search end / continuation flag is set.
D is set for the transmission interface paired with the continuation flag. It is not necessary to have the fourth control table corresponding to 76, 78 and 79.

Next, a search processing method will be described with reference to FIGS. 2 and 3 in which an example is described in which the IP address 133.141.77.59 is searched for a transmission interface. The first 8 bits 133 of the IP address to be searched are selected (FIG. 2).
Step 52), the address A of the first control table 31
The search end / continuation flag 312 of 133 is read (step 53). In the search end / continuation flag 312, “1” indicating the search continuation is set (step 54). The next table pointer 313 is read, and the pointer B000 of the second control table 32 is read (step 57). The second 8-bit 141 of the IP address to be searched is selected (step 58), and the search end / continuation flag 322 of the address B141 of the second control table 32 indicated by B000 is read (step 59). The search end / continuation flag 322 is set to "1" indicating that the search is continued (step 6).
0).

The next table pointer 323 is read and the third
The pointer C000 in the control table 33 is read (step 63). The third 8-bit 77 of the IP address to be searched is selected (step 66 in FIG. 3), and the search of the address C077 of the third control table 33 indicated by C000 is completed /
The continuation flag 332 is read (step 67). "1" indicating continuation of the search is set in the search end / continuation flag 332 (step 68). The next table pointer 333 is read, and the pointer D000 of the fourth control table 34 is read (step 71). The fourth 8-bit 59 of the IP address to be searched is selected (step 72), and the search end / continuation flag 342 of the address D059 of the fourth control table 34 indicated by D000 is read (step 73). The search end / continuation flag 342 is set to “0” indicating the end of the search (step 74). The transmission interface C is read (step 75), and the search ends.

Next, the IP address 133.141.7
An example of retrieving 8.111 and obtaining a transmission interface will be described with reference to FIGS. The first 8-bit 133 of the IP address to be searched is selected (step 52), and the search end / continuation flag 312 of the address A133 in the first control table 31 is read (step 53). In the search end / continuation flag 312, “1” indicating the search continuation is set (step 54). The next table pointer 313 is read, and the pointer B000 of the second control table 32 is read.
(Step 57).

The second 8-bit 141 of the IP address to be searched is selected (step 58), and the second address indicated by B000 is selected.
The search end / continuation flag 322 of the address B141 of the control table 32 is read (step 59). The search end / continuation flag 322 is set with "1" indicating that the search is continued (step 60). The next table pointer 322 is read, and the pointer C000 of the third control table 33 is read (step 63). Third 8 of IP address to search
The bit 78 is selected (step 66), and the search of the address C078 of the third control table 33 indicated by C000 is completed /
The continuation flag 332 is read (step 67). “0” indicating the end of the search is set in the search end / continuation flag 332 (step 68). The transmission interface A is read (step 69), and the search ends.

In the above example, the case of an IP address has been described.
ge) address, MAC (Media Access Control) address, or telephone number. As described above, according to the present invention, the address to be searched is divided into n numbers for each of a plurality of bits, the corresponding control table is searched by the index of the number of the divided addresses, and the next number of the divided addresses is retrieved. Since the address of the corresponding control table is obtained, the network address can be searched at high speed.

Further, according to the present invention, the m-th control table is searched by the index of the m-th number of the divided address, and the end of the search is detected by the read value, so that the network address can be searched at high speed.

Embodiment 2 FIG. As in the first embodiment, the present embodiment will be described with reference to FIG. 4 based on the example of FIG. 11 having the network configuration of FIG. 11 and the routing table of the relay device 13 of FIG. In FIG. 4, the first control table includes an index address from A000 to A255, a processing entry address, and a next table pointer. The second control table includes an index address from B000 to B255, a processing entry address, and a next table pointer. The third control table is C00
It comprises an index address from 0 to C255, a process entry address, and a next table pointer. 4th
The control table includes an index address from D000 to D255, a processing entry address, and a next table pointer.

Next, FIGS. 5, 6, 7, 8, 9 and 10 are diagrams showing the processing procedure of the network address search method according to the present invention, and FIG. 6 is a second control table search function, FIG. 7 is a third control table search function, FIG. 8 is a fourth control table search function, and FIG. 9 is an A transmission function for transmitting data to the interface A and transmitting data to the interface B. FIG. 10 shows a C transmission function for transmitting data to the interface C and a D transmission function for transmitting data to the interface D. In the present embodiment, 32 bits of the IP address are divided every 8 bits, and a four-stage control table is created using the four divided numbers. The processing entry address is a pointer that points to the processing function of the corresponding address.

When the processing entry address 412 in the first control table 41 points to the second control table search function, the next table pointer 413 paired with the processing entry address 412 is used as an argument of the second control table search function. This is a pointer indicating the address of the second control table 42 to be processed. When the processing entry address 422 in the second control table 42 points to the third control table search function, the next table pointer 423 paired with the processing entry address 422 is processed as an argument of the third control table search function. This is a pointer indicating the address of the third control table 43. When the processing entry address 432 in the third control table 43 points to the fourth control table search function, the next table pointer 433 paired with the processing entry address 432 is processed as an argument of the fourth control table search function. This is a pointer indicating the address of the fourth control table. In the processing entry address in the fourth control table 44, pointers indicating A to D transmission functions for transmitting data to the interfaces A to D are set.

IP address 133.141.77.59
IP address mask 255.255.255.255
133.141.77.59 IP address masked by
Is registered in the address control table. In the processing entry address 412 of the address A133 of the first control table 41, a pointer of the second control table search function is set. As the next table pointer 413 paired with the processing entry address 412, a pointer pointing to the second control table 42 is set. Process entry address 422 of address B141 of second control table 42
, A pointer to a third control table search function is set. As the next table pointer 423 paired with the processing entry address 422, a pointer pointing to the third control table 43 is set. Address C0 of third control table 43
The pointer of the fourth control table search function is set to the process entry address 432 of 77. The next table pointer 433 paired with the processing entry address 432 includes:
Set a pointer to the fourth control table. In the processing entry address 442 of the address D059 of the fourth control table 44, a pointer indicating a C transmission function for transmitting data to the interface C is set.

IP address 133.141.77.59
An example of registering an IP address 133.141.77.0 in which an IP address 133.141.77.0 is masked with an IP address mask 255.255.255.0 in an address control table will be described. IP
The IP address 133.141.77.0 masked by the address mask 255.255.255.0 has the IP address 133.141.77.0 to 13 before masking.
An IP address of 3.141.77.255 corresponds to this.
However, the IP address 133.141.77.59 has already been set by the longest match.
Regarding the setting of the first control table 41, the second control table 42, and the third control table 43, the IP address 13
This is the same as the setting example of 3.141.77.59. Since the processing entry address 442 of the address D059 of the fourth control table 44 has already been set, the address D059 is set.
Addresses other than D000 to D058 and D060 to D25
5, the processing entry address 442 has the interface B
A pointer to the B transmission function for transmitting data to is set.

IP address 133.141.77.59
An example of registering the IP address 133.1411.76.0 masked with the IP address mask 255.255.252.0 in the address control table will be described. IP
The IP address 133.1411.76.0 masked by the address mask 255.255.252.0 has the IP address 133.141.76.0-13 before masking.
An IP address of 3.141.79.255 corresponds to this.
However, the IP address 133.1411.77.0-13
3.141.77.255 has already been set by longest match. The setting of the first control table 41 and the second control table 42 is the same as the example in which the IP address 133.141.77.59 is registered. Since the processing entry address 432 of the address C077 in the third control table 43 has already been set, a pointer indicating an A transmission function for transmitting data to the interface A is set in the processing entry addresses 432 of the addresses C076, C078, and C079.

An example in which an IP address 26.0.0.0 masked with an IP address mask 255.0.0.0 is registered in an address control table will be described. The IP address 26.0.0.0 masked with the IP address mask 255.0.0.0.0 has an IP address 2 before masking.
6.0.0.0 to 26.255.255.255 IP
Address is applicable. Address A0 of first control table
A pointer indicating an A transmission function for transmitting data to the interface A is set in the process entry address 412 of 26.

To register an IP address in the address control table, a setting is made from the first control table 41 using an IP address and an IP address mask. Second control table 42, third control table 43, and fourth control table 44
Exist depending on whether or not to continue the search. A pointer pointing to a D transmission function for transmitting data to the interface D is set in the processing entry address corresponding to the address whose IP address has not been registered.

Next, the search processing method will be described by taking an example of searching for the IP address 133.141.77.59.
The first 8-bit 133 of the IP address to be searched is selected (step # 82), and the address A133 of the first control table 41 is selected.
Of the processing entry address 412 (step 8)
3). Since the pointer of the second control table search function is set in the read process entry address 412, the second table pointer B000 is used as an argument to read the second control table search function.
Execute the processing of the control table search function (step 8)
4). 14 of the second 8 bits of the IP address to be searched
1 is selected (step 87), and the process entry address 422 of the address B141 of the second control table 42 is read (step 88). Read process entry address 4
22, the pointer of the third control table search function is set, so the next table pointer C000 is used as an argument.
Of the third control table search function using
(Step 89). The third 8-bit 77 of the IP address to be searched is selected (step 92), and the processing entry address 432 of the address C077 of the third control table 43 is selected.
Is read (step 93). Since the pointer of the fourth control table search function is set in the read process entry address 432, the process of the fourth control table search function is executed using the next table pointer D000 as an argument (step 94). The fourth 8-bit 59 of the IP address to be searched is selected (step 97), and the processing entry address 442 of the address D059 of the fourth control table 44 is read (step 98). In the read process entry address 442, a C transmission function is registered. The C transmission function is executed (step 99), data is transmitted to the interface C (step 108), and the search process is terminated (step 109).

IP address 133.141.78.11
An example of searching for 1 will be described. The first 8-bit 133 of the IP address to be searched is selected (step 82),
The process entry address 412 of the address A133 in the first control table 41 is read (step 83). Since the pointer of the second control table search function is set in the read process entry address 412, the process of the second control table search function is executed using the next table pointer B000 as an argument (step 84). IP to search
The second 8-bit address 141 is selected (step 87), and the address B141 processing entry address 422 of the second control table 42 is read (step 88).

Since the pointer of the third control table search function is set in the read processing entry address 422, the processing of the third control table search function is executed using the next table pointer C000 as an argument (step 89). . The third 8-bit 78 of the IP address to be searched is selected (step 92), and the address C078 processing entry address 432 of the third control table 43 is read (step 93). Read process entry address 4
32, an A transmission function is registered. A transmission function is executed (step 94), data is transmitted to interface A (step 102), and the search process is terminated (step 1).
03).

In the above example, the case of an IP address has been described.
ge) Address, MAC (Media Access Control) address or phone number

According to the present invention, the address of the network or terminal to be searched is divided into n numbers for each of a plurality of bits, and the contents of the control table are read out in correspondence with the divided addresses corresponding to the addresses of the control table. So you can search network address at high speed. Further, the m-th control table is searched by the index of the m-th number of the divided address, the processing entry address is read from the m-th control table, the read processing function is executed, and the processing related to the address searched by the executed processing function is executed. Is determined, the network address can be searched at high speed.

[Brief description of the drawings]

FIG. 1 is a configuration diagram showing an address control table according to a first embodiment of the present invention.

FIG. 2 is a configuration diagram (1/2) illustrating a processing procedure according to the first embodiment of the present invention;

FIG. 3 is a configuration diagram (2/2) showing a processing procedure according to the first embodiment of the present invention;

FIG. 4 is a configuration diagram illustrating an address control table according to a second embodiment of the present invention;

FIG. 5 is a configuration diagram showing a processing procedure according to a second embodiment of the present invention.

FIG. 6 is a configuration diagram showing a processing procedure according to a second embodiment of the present invention.

FIG. 7 is a configuration diagram showing a processing procedure according to a second embodiment of the present invention.

FIG. 8 is a configuration diagram showing a processing procedure according to a second embodiment of the present invention.

FIG. 9 is a configuration diagram showing a processing procedure according to the second embodiment of the present invention.

FIG. 10 is a configuration diagram showing a processing procedure according to a second embodiment of the present invention.

FIG. 11 is a configuration diagram showing a conventional information communication network system.

FIG. 12 illustrates an example of a routing table.

FIG. 13 is a configuration diagram showing a conventional address control table.

[Explanation of symbols]

DESCRIPTION OF SYMBOLS 1 Wide area network 11-13 Relay apparatus 21-24 Terminal 31, 41 1st control table 32, 42 2nd control table 33, 43 3rd control table 34, 44 4th control table 311, 321, 331, 341 Division address 312 , 322, 332, 342 Search end / continuation flag 313, 323, 333, 343 Next table pointer 314, 324, 334, 344 Transmission interface 411, 421, 431, 441 Division address 412, 422, 432, 442 Processing entry address 413 , 423, 433, 443 Next table pointer

 ──────────────────────────────────────────────────続 き Continued on the front page (72) Inventor Akira Watanabe 2-3-2 Marunouchi, Chiyoda-ku, Tokyo Mitsubishi Electric Corporation

Claims (2)

[Claims] 1. A network address search method for registering and searching for information (hereinafter, address information) corresponding to a network address in a relay device of a network or in a terminal connected to the network. Divided into
Corresponding to the divided address (hereinafter, referred to as a divided address), a control table having information for identifying whether the search is completed or continuing, and a table pointer pointing to a control table corresponding to the next lower divided address if the search is continued, is provided. When registering the same address information corresponding to a plurality of network addresses specified by using an address mask, the above network addresses are divided, and registered even if the upper divided address is the same and the lower divided addresses are different from each other. If the address information is the same, the search end and the address information are registered in the control table corresponding to the upper divided address, and if the address information to be registered in the lower divided address control table is different from the registered address information. ,
The search continuation and the registration of the table pointer pointing to the control table corresponding to the lower divided address in the control table corresponding to the higher divided address are repeated, and when the lowest divided address is reached, the control corresponding to the divided address is repeated. Register the search end and the address information in the table, and if the search end is registered in the control table corresponding to the upper divided address for the network address to be searched, obtain the address information corresponding to the divided address and continue the search Is registered, a control table corresponding to the next lower divided address is obtained from the next table pointer, and the above-mentioned steps are repeated until the search is completed, thereby searching for address information. 2. In a network address search method for registering and searching for a processing entry address corresponding to a network address in a relay device of a network or in a terminal connected to the network, the network address is divided into a plurality of addresses. ,
A control table having a processing entry address and a table pointer pointing to a control table corresponding to the next lower divided address is provided in correspondence with the divided address (hereinafter, referred to as a divided address), and a plurality of addresses are designated using an address mask. When registering the processing entry address corresponding to the network address of
If the upper division address obtained by dividing the plurality of network addresses is the same and the processing entry address is the same regardless of the lower division address, the processing entry address corresponding to the upper division address is registered in the control table, and the lower division address is registered. If the processing entry address differs, the table pointer pointing to the control table corresponding to the lower divided address and the search function for continuing the search are registered in the control table corresponding to the higher divided address. If the processing entry address is registered in the control table corresponding to the divided address, control is passed to the processing entry address corresponding to the divided address, and if the entry address of the search function for continuing the search is registered, the next From table pointer to next A network address search method wherein a control table corresponding to a lower divided address is obtained, and the above processing is repeated until the search is sequentially completed to search for a processing entry address.