Path controller, path control method, and program therefor

Abstract

Provided is a path controller capable of reducing path search time. A path controller 10 creates a logical tree LT having a plurality of member trees MT1 and MT2 within a routing table 52 at the time of initial setting. Direct tables DT1 and DT2 for the member trees MT1 and MT2 have the same DT entries (root). Unlike a conventional tree in which a single tree is constructed for the same root, since the present invention is such that the plurality of member trees are constructed for the same root, the number of nodes N passed through before reaching leaves L is reduced. At the time of path search, a plurality of search engines SE1 and SE2 search the member trees MT1 and MT2, respectively.

Description

technical field [0001] The present invention relates to path controllers and, more particularly, to path controllers for receiving and transmitting frames from a plurality of host computers within a network or from other networks. Background technique [0002] One of the path search techniques performed with path controllers such as routers and Layer 3 switches is the tree method. In the tree method, destination address information such as MAC address and IP address is stored in a tree structure. When performing a path search, the path controller follows a node (hereinafter referred to as a "node") based on a search key (address information), and acquires path information when reaching an external node (hereinafter referred to as a "leaf"). Figure 10 An example of the tree structure when the path controller has the 7-bit destination address information shown in Table 1 is shown. [0003] Destination address information 0010100 0100010 ...

AI Technical Summary

Problems solved by technology

Therefore, even in the tree structure with the direct table DT, when a deviation occurs in the tree structure, the number of node stages increases, thereby increasing the path search time

Images