摘要 |
<p>Method of detour path determination for data packets re-routing in a mesh network (100), wherein the mesh network comprises a plurality of N nodes, with N integer higher than 1, arranged according to a network topology, each node has a K-hops neighbourhood knowledge of the network topology, with 1 ‰¤ K < N, primary paths are predefined for routing data packets within the mesh network,
wherein, in order to obtain at least one detour path for at least part of a primary path PPx comprising a ordered sequence of nodes with a head node I and an end node J:
- the head node I generates and sends to the node following it in the ordered sequence of nodes a request data packet, the request data packet comprising information enabling the request data packet to travel through said ordered sequence of nodes according to a forward direction till the end node J;
- at the receipt of the request data packet, the end node J generates and sends to the node preceding it in the ordered sequence of nodes a response data packet, the response data packet comprising information representative of the K-hops neighbourhood knowledge of the network topology of node J, and information enabling the response data packet to travel back through said ordered sequence of nodes till the head node I according to a backward direction;
- at the receipt of the response data packet, the head node I processes the information representative of the K-hops neighbourhood knowledge of node J so as to obtain a merged knowledge of the network topology comprising the K-hops neighbourhood knowledge of node I and the K-hops neighbourhood knowledge of node J; then head node I uses the merged knowledge of the network topology to carry out a detour path computation to find if there is said at least one detour path for said at least part of the primary path PPx.</p> |
申请人 |
FLUIDMESH NETWORKS S.R.L. |
发明人 |
LENZINI, LUCIANO;MINGOZZI, ENZO;BISTI, LUCA;BERTANI, TORQUATO;ERTA, ALESSANDRO;MALESCI, UMBERTO |