ROUTING METHOD, ROUTER, AND RECORDING MEDIUM STORING ROUTING PROGRAM

摘要

PROBLEM TO BE SOLVED: To obtain the method to attain routing through dynamic adaptation by updating periodically a routing table of its own station based on a length of a queue of an adjacent node so as to attain an adaptive shortest hop path routing in a way of reducing a delay time against fluctuation of a traffic with respect to the received packet. SOLUTION: Whether or not a time comes a p-sec after preceding processing is discriminated and in the case that the p-sec elapses from the preceding processing, a parameter is set to 1, communication is made to an adjacent node, a queue length is received and stored in a queue length memory 14. Whether or not the parameter is M or over is discriminated, and in the case of NO, the parameter is incremented by 1 and the processing is restored to the original processing. In the case of YES, since data of the queue length are received from all adjacent nodes, the parameter is set to 1. Then whether or not a node (k) is an adjacent node belonging to a shortest hop bus reaching a destination node stored in a shortest hop bus memory 15 is discriminated.