| 摘要 |
Communications network route finding algorithm wherein a route request (RReq) message specifying a desired destination (e.g. B) is transmitted from source node (A). A single next hop (e.g. Route 1) is selected and the RReq is unicast over it. In the event that the RReq is unsuccessful another next hop is selected. Rather than simply try routes in numerical order (1, 2, 4, 5 see Fig. 3) the invention selects a new route which has different characteristics to that which has failed (e.g. route 4 in a different domain, see Fig. 4). |
