Node device and computer readable storage medium storing program

• US 8,817,616 B2
• Filed: 10/20/2010
• Issued: 08/26/2014
• Est. Priority Date: 04/25/2008
• Status: Active Grant

• Current Assignee: Fujitsu Limited
• Original Assignee: Fujitsu Limited
• Inventors: Iwao, Tadashige, Masubuchi, Kentaro, Nakajima, Chiaki, Ikemoto, Kentaro, Koga, Syunsuke, Takahashi, Yuji
• Primary Examiner(s): ROSE, KERRI M
• Application Number:
  US12/908,169
• Publication Number:
  US 20110141932A1
• Time in Patent Office: 1,406 Days
• Field of Search: 370229-232, 370/235, 370/252, 370/400, 370/401, 370463-465, 370/468
• US Class Current: 370/230.1
• CPC Class Codes: H04B 7/2606 Arrangements for base station coverage control, e.g. by using relays in tunnels
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/021 Ensuring consistency of routing table updates, e.g. by using epoch numbers
• CPC Class Codes: H04L 45/026 Details of "hello" or keep-alive messages
• CPC Class Codes: H04L 45/26 Route discovery packet
• CPC Class Codes: H04L 45/54 Organization of routing tables
• CPC Class Codes: H04W 40/12 based on transmission quality or channel quality

Abstract

In a node device 1 in a communication network, an FID management table 5 stores an FID for unique identification of a frame and the information about a destination node of the frame, and a weighting table 7 stores weighting information about another node as a destination for relay of the frame for each final destination node of the frame. When a frame transmitted to a local node is received, and if the FID of the received frame is stored in the FID management table 5, the data about the destination node associated with the FID is updated. If the FID of the frame received from the frame reception device is not stored in the FID management table 5, the FID management table 5 corresponding to the destination node of the frame is referred to, and another node as a destination for relay of the frame is determined.

Claims

1. A node device in a network having a plurality of node devices, the node device comprising:

an identification information management table configured to store, as information about a frame transmitted by a local node, identification information for unique identification of a frame and information about a destination node of the frame;

a destination node weighting table configured to store weighting information about another node as a destination node for relay of the frame for each final destination node of the frame;

a frame reception device configured to receive the frame transmitted addressed to the local node from another node;

a destination node weighting table update device configured to update data of the destination node weighting table corresponding to the final destination node of the frame for the destination node stored as associated with identification information when an occurrence of a loop or a back-track is detected by comparing the identification information of the frame received by the frame reception device with the identification information stored in the identification information management table; and

a frame destination determination device configured to determine another node as a destination node for relay of the frame by referring to the destination node weighting table corresponding to a final destination node of the frame when he identification information about the frame received by the frame reception device is not stored in the identification information management table,

wherein the weighting information includes one of an incoming route link weight, an outgoing route link weight, a bidirectional link weight, an incoming route quality weight and an inter-link reach weight.

2. The node device according to claim 1, wherein when the occurrence of a loop or a back-track is detected by comparing the identification information of the frame received by the frame reception device with the identification information stored in the identification information management table, the destination node weighting table update device updates the destination node stored as associated with the identification information so that a weight of the destination node of the destination node weighting table corresponding to a final destination node of the frame can be reduced in priority.

3. The node device according to claim 2,

further comprising:

an adjacent node management table configured to store information about nodes surrounding a local node;

a hello message transmission device configured to transmit information about existence of the local node and information about surrounding routes read from the adjacent node management table as a hello message;

a hello message reception device configured to receive the hello message transmitted from the surrounding node; and

an adjacent node management table update device configured to update the adjacent node management table according to information about a source node of the hello message received from the hello message reception device,

wherein the destination node weighting table update device updates, in the adjacent node management table, data to be transmitted to a first node of the destination node weighting table so that a priority of the data can be reduced when the first node in a predetermined state is detected.

4. The node device according to claim 3, wherein the adjacent node management table update device updates the adjacent node management table depending on a state of a source node determined based on a reception interval of a hello message of each source node received by the hello message reception device.

5. A method executed by a node device in a network having a plurality of node devices, said method comprising:

storing in an identification information management table, as information about a frame transmitted by a local node, identification information for unique identification of a frame and information about a destination node of the frame;

storing in a destination node weighting table storing weighting information about another node as a destination node for relay of the frame for each final destination node of the frame;

receiving the frame transmitted addressed to the local node from another node;

updating data of the destination node weighting table corresponding to the final destination node of the frame for the destination node stored as associated with identification information when an occurrence of a loop or a back-track is detected by comparing the identification information of the frame received by the frame reception device with the identification information stored in the identification information management table; and

determining another node as a destination node for relay of the frame by referring to the destination node weighting table corresponding to a final destination node of the frame when the identification information about the received frame is not stored in the identification information management table,

wherein the weighting information includes one of an incoming route link weight, an outgoing route link weight, a bidirectional link weight, an incoming route quality weight and an inter-link reach weight.

6. The method according to claim 5, wherein when the occurrence of a loop or a back-track is detected by comparing the identification information of the frame received by the frame reception device with the identification information stored in the identification information management table, the destination node weighting table updating process updates the destination node stored as associated with the identification information so that a weight of the destination node of the destination node weighting table corresponding to a final destination node of the frame can be reduced in priority.

7. The method according to claim 6, further comprising:

receiving as a hello message information about an existence of another node transmitted from the other node and information about a route around the other node;

updating an adjacent node management table storing information about another node around the local node according to information about a source node of the received hello message;

the destination node weighting table updating process updating data which is the first node as a destination node of the destination node weighting table so that a priority of the data can be reduced when a first node entering a predetermined state is detected in the adjacent node management table.

8. The method according to claim 7, wherein the adjacent node management table updating process performs update based on a state of the source node determined depending on a reception interval for each source node of the hello message.

9. A non-transitory computer readable storage medium storing a program making a computer as a node device in a network having a plurality of node devices to execute a process comprising:

storing in an identification information management table, as information about a frame transmitted by a local node, identification information for unique identification of a frame and information about a destination node of the frame;

storing weighting information about another node as a destination node for relay of a frame for each final destination node of the frame in a destination node weighting table;

receiving the frame transmitted addressed to the local node from another node;

updating data of the destination node weighting table corresponding to the final destination node of the frame for the destination node stored as associated with identification information when an occurrence of a loop or a back-track is detected by comparing the identification information of the frame received by the frame reception device with the identification information stored in the identification information management table; and

determining another node as a destination for relay of the frame by referring to the destination node weighting table corresponding to a final destination node of the frame when the received identification information about the frame is not stored in the identification information management table,

wherein the weighting information includes one of an incoming route link weight, an outgoing route link weight, a bidirectional link weight, an incoming route quality weight and an inter-link reach weight.

10. A node device in a network including a plurality of node devices, comprising:

a frame reception device configured to receive a frame transmitted addressed to a local node from one or more partner nodes;

a storage device configured to store a table including;

first information about communication quality of a frame transmitted from the local node to each of the one or more partner nodes;

second information about communication quality of a frame transmitted from each of the one or more partner nodes to the local node; and

third information about bidirectional communication quality calculated from the first and second information;

a priority determination device configured to determine an evaluation value indicating a priority of each of the one or more partner nodes according to the table; and

a frame transmission device configured to transmit according to the evaluation value a frame to a node having a highest priority in the one or more partner nodes,

wherein the evaluation value is calculation using a hop count, an inter-link reach weight and a route quality weight in the frame received by the frame reception device.

11. The node device according to claim 10, wherein

the priority determination device determines the evaluation value according to the hello frame received by the frame reception device and transmitted from one or more of the partner nodes to the local node;

the frame reception device receives a data frame transmitted to the local node from any of the one or more of the partner nodes; and

the frame transmission device transmits the data frame to an appropriate node in the one or more of the partner nodes using the evaluation value.

12. A method executed by a node device in a network having a plurality of node devices, said method comprising:

receiving a frame transmitted addressed to a local node from one or more partner nodes;

storing in a storage device a table including;

first information about communication quality of a frame transmitted from the local node to each of the one or more partner nodes;

second information about communication quality of a frame transmitted from each of the one or more partner nodes to the local node; and

third information about bidirectional communication quality calculated from the first and second information;

determining an evaluation value indicating a priority of each of the one or more partner nodes according to the table stored in the storage device; and

transmitting according to the evaluation value a frame to a node having a highest priority in the one or more partner nodes,

wherein the evaluation value is calculated using a hop count, an inter-link reach weight and a route quality weight in the received frame.

13. The method according to claim 12, further comprising:

determining the evaluation value according to a received hello frame transmitted from one or more of the partner nodes to the local node;

receiving a data frame transmitted to the local node from any of the one or more of the partner nodes; and

transmitting the data frame to an appropriate node in the one or more of the partner nodes using the evaluation value.

14. A non-transitory computer readable storage medium storing a program making a computer as a node device in a network having a plurality of node devices to execute a process, said process comprising:

receiving a frame transmitted addressed to a local node from one or more partner nodes;

storing in a storage device a table including;

first information about communication quality of a frame transmitted from the local node to each of the one or more partner nodes;

second information about communication quality of a frame transmitted from each of the one or more partner nodes to the local node; and

third information about bidirectional communication quality calculated from the first and second information;

determining an evaluation value indicating a priority of each of the one or more partner nodes according to the table stored in the storage device; and

transmitting according to the evaluation value a frame to a node having a highest priority in the one or more partner nodes,

wherein the evaluation value is calculated using a hop count, an inter-link reach weight and a route quality weight in the received frame.