Probabilistic choice link in a routing algorithm

摘要

1. method u043du0430u0445u043eu0436u0434u0435u043du0438u00a0 way u0434u043bu00a0 routing calls from the source node to the node (sn) - u043fu043eu043bu0443u0447u0430u0442u0435u043bu00a0 (dn) through the communication network, u043eu0442u043bu0438u0447u0430u044eu0449u0438u0439u0441u00a0, source node (sn) gene u0435u0440u0438u0440u0443u0435u0442 random number, and depending on the generated random number, at least one path between a source node (sn) and the receiving node (dn) is a commit u0438u0440u0430u0442u044cu0441u00a0 from source node (sn).;2. method for u043eu0442u043bu0438u0447u0430u044eu0449u0438u0439u0441u00a0 1, so that a random number u00a0u0432u043bu00a0u0435u0442u0441u00a0 dispersion u0440u0430u0441u0441u0442u043eu00a0u043du0438u00a0 line u0441u0432u00a0u0437u0438, dependent on the capacity of the u0441u0432u00a0u0437u0438 and / or free bandwidth.;3. method for u043eu0442u043bu0438u0447u0430u044eu0449u0438u0439u0441u00a0 1 or 2, so that u0441u0438u0433u043du0430u043bu0438u0437u0430u0446u0438u00a0 to other nodes in the network through the communications protocol OSPF u0432u044bu043fu043eu043bu043du00a0u0435u0442u0441u00a0 lsa.;4. method for u043eu0442u043bu0438u0447u0430u044eu0449u0438u0439u0441u00a0 1, so that the source node (sn) generates a random number u0434u043bu00a0 each selected path.;5. method for u043eu0442u043bu0438u0447u0430u044eu0449u0438u0439u0441u00a0 1, so that a random number of random variables u00a0u0432u043bu00a0u0435u0442u0441u00a0 amount, calculated in each line u0441u0432u00a0u0437u0438 the path.;6. method for u043eu0442u043bu0438u0447u0430u044eu0449u0438u0439u0441u00a0 1, so that the way of using the routing algorithm on the basis of quality u043eu0431u0441u043bu0443u0436u0438u0432u0430u043du0438u00a0 u0434u043bu00a0 cause.;7. method for u043eu0442u043bu0438u0447u0430u044eu0449u0438u0439u0441u00a0 p.6, so that a routing algorithm based on the quality of u043eu0431u0441u043bu0443u0436u0438u0432u0430u043du0438u00a0 u0438u0441u043fu043eu043bu044cu0437u0443u0435u0442u0441u00a0 Dijkstra - and / or Bellman - ford algorithm.;8. method for u043eu0442u043bu0438u0447u0430u044eu0449u0438u0439u0441u00a0 1, so that the receiver node (dn) u043fu0440u0435u0434u0441u0442u0430u0432u043bu00a0u0435u0442 a terminal device, the terminal device of mobile network, computer, mobile asia pacific en and / or personal digital assistant (pda).;9. method for u043eu0442u043bu0438u0447u0430u044eu0449u0438u0439u0441u00a0 1, so that the u043au043eu043cu043cu0443u043du0438u043au0430u0446u0438u043eu043du043du0430u00a0 u043fu0440u0435u0434u0441u0442u0430u0432u043bu00a0u0435u0442 network a network of mobile u0441u0432u00a0u0437u0438 and / or data transmission network.;10.the device u0434u043bu00a0 u043du0430u0445u043eu0436u0434u0435u043du0438u00a0 way u0434u043bu00a0 routing calls from the source node to the node (sn) - u043fu043eu043bu0443u0447u0430u0442u0435u043bu00a0 (dn) through a communication network containing the source node (sn) u0434u043bu00a0 mr. u0435u043du0435u0440u0430u0446u0438u0438 random numbers depending on the capacity of the u0441u0432u00a0u0437u0438 and free bandwidth, and the source node (sn) provides a choice of at leasta node in the path between the source node (sn) and the recipient (dn) depending on the generated random number, the source node (sn) is constantly u0434u043bu00a0 each selected path independent random numbers.;11. device for u043eu0442u043bu0438u0447u0430u044eu0449u0435u0435u0441u00a0 p.10, so that u0443u043fu043eu043cu00a0u043du0443u0442u043eu0435 u0434u043bu00a0 alarm device using u0441u043eu043eu0431u0449u0435u043du0438u00a0 u0443u0432u0435u0434u043eu043cu043bu0435u043du0438u00a0 on u0441u043eu0441u0442u043eu00a0u043du0438u0438 line u0441u0432u00a0u0437u0438 (lsa) protocol OSPF.