Probabilistic link selection in routing algorithm

1 . A method for finding a path for routing a call from a source-node to a destination-node through a communication network, comprising:

generating, via the source-node, a random-number; and

selecting, depending on the random-number, at least one path between the source-node and the destination-node from the source-node.

2 . The method according to claim 1 , wherein

the random number is a variance of a link distance, depending on the link capacity and/or the free bandwidth.

3 . The method according to, claim 1 , wherein

signaling to other nodes throughout the network is implemented by OSPF-LSA-messages.

4 . The method according to, claim 1 , wherein

the source-node generates for each selected path a separate random-number.

5 . The method according to claim 1 , wherein

the random number is a sum of random variables calculated at each link of a considered path.

6 . The method according to claim 1 , wherein

the method uses a Quality of Service routing algorithm for selecting a path.

7 . The method according to claim 6 ,

wherein the Dijkstra- and/or the Bellman-Ford-Algorithm will be used as Quality of Service routing algorithm.

8 . The method according to claim 1 , wherein

a destination node is an end device, an end device of a mobile network, a computer, a mobile computer and/or a PDA.

9 . The method according to claim 1 , wherein

a communication network is a mobile communication network and/or a data network.

10 . An apparatus for finding a path for routing a call from a source-node to a destination-node through a communication network, comprising

a source-node for generating a random-number, and

with the source-node for selecting at least one path between the source-node and the destination-node depending on the generated random-number.

11 . The apparatus according to claim 10 , wherein

the apparatus for signaling use OSPF LSA messages.