Method and network nodes for path searching in a packet-oriented communication network
In a network node of a packet-based communication network, comprising several network nodes, at least two path searches to a target network node are carried out in at least one network node, in series or parallel and the result of at least one of the path search methods is stored in the routing table.
1 - 8 . (canceled)
9 . A method for path searching in a network node for a packet-switching communication network having a plurality of network nodes in which at least on of the plurality of network nodes is a destination network node, the method comprising:
exchanging information via a routing protocol;
evaluating the routing protocol information via at least two different path search methods;
selecting a path search method for each destination network node; and
storing selection results in a routing table.
10 . The method according to claim 9 , wherein a connection path established via the path search method and leading to a destination network node are store respectively, fed to a discriminator that selects one connection path from the set of connection paths established via the path search methods and leading to a destination network node and inputs this connection path in a table of the network node.
11 . The method according to claim 9 , wherein a shortest path search method is used as the path search method.
12 . The method according to claim 9 , wherein a multipath search method is used as the path search method.
13 . The method according to claim 10 , wherein the table is a routing table.
14 . The method according to claim 10 , wherein the table is a control table.
15 . A network node for a packet-switching communications network having a plurality of network nodes in which at least one of the plurality of network nodes is a destination network node or a destination system is linked to at least one of the plurality of network nodes, comprising:
at least two different path search algorithms stored in the network node to which routing protocol information is fed; and
a routing table for storing the result of a specific path search algorithm for each destination network node.
16 . The network node according to claim 15 , wherein a discriminator is provided to select the results of the different path search algorithms.
17 . The network node according to claim 15 , wherein one of the available path search algorithms is selected by a discriminator and a resulting information is stored in the routing table.
18 . The network node according to claim 15 , wherein one of the available path search algorithms is selected for each destination network node or destination system and a resulting information is stored in the routing table.
19 . The network node according to claim 16 , wherein one of the available path search algorithms is selected for each destination network node or destination system and a resulting information is stored in the routing table.
20 . The network node according to claim 17 , wherein one of the available path search algorithms is selected for each destination network node or destination system and a resulting information is stored in the routing table.