ROUTING PROCESSOR AND ROUTING METHOD

摘要

PROBLEM TO BE SOLVED: To provide an efficient routing method for shortening a time required for routing. SOLUTION: In a branch B pointer, '11' is stored in a control area, '00010' is in a size storage area and a 'memory address A' is in an information storage area. The existence of a succeeding routing table is indicated by '11' of the control area. It is indicated that the number of branch pointers is 2<2> =4 in the routing table in a second stage being the succeeding one by '00010' of the size storage area. It is indicated that the number of bits to be referred to is two in a received network address by '00010' of the size storage area. The second and third bits from the highest-order of the network address are referred to in the second-stage of routing table.