首页>
外国专利>
Constraint satisfying route identifying method for mobile phone, involves searching route among potential routes calculated by using reactive routing algorithm, if route is not found by proactive routing protocol
Constraint satisfying route identifying method for mobile phone, involves searching route among potential routes calculated by using reactive routing algorithm, if route is not found by proactive routing protocol
The method involves searching a route by using a routing table (TR) updated by implementation of a proactive routing protocol (P-RP), where the protocol obtains the routing table by a dijikstra algorithm. A preset number of potential routes (R-k) are selected from a topology table (TT) maintained updated by the protocol, if the route is not found in the search, where the routes (R-k) are calculated by a reactive routing algorithm e.g. depth-first search (DFS) type algorithm. The route is searched among the potential routes, when the route is not found in the search made using the table (TR). Independent claims are also included for the following: (1) a device for identifying a route satisfying a constraint between a source node and a destination node in a telecommunications network (2) a computer program comprising instructions for the execution of stages of a method for identifying a route satisfying a constraint between a source node and a destination node in a telecommunications network (3) a computer readable storage medium storing a computer program comprising instructions for the execution of stages of a method for identifying a route satisfying a constraint between a source node and a destination node in a telecommunications network (4) a telecommunications network comprising a set of nodes adapted to implement a method for identifying a route satisfying a constraint between a source node and a destination node in a telecommunications network.
展开▼