Automatic route configuration for quasi-associated m3ua connections
OwnerManfred Angermayrinventor
Life of this patent
Estimating the term…
Abstract
The invention relates to a method used in a packet-based telecommunications network that is designed in particular for network nodes that act as signalling transfer points. Said method is used to distribute information concerning the network topology. The network nodes contain information concerning distances between the network nodes and potential target network nodes for future message transmissions. The information can be distributed within the framework of registration requests, for example by means of the M3UA protocol. Said information can be used in the network nodes for establishing a routing database.
Claims27
1-26. (canceled)
A method for determining topological features of a packet-based network having a plurality of network nodes, wherein a distance between two network nodes is determined by the number of sublinks lying between them, the method comprising:
- a.) transmitting a registration message from a first network node to at least one immediately adjacent receiving network node, wherein the message including distance information;
- b.) incrementing a value of the distance information by the at least one receiving network node, with the result that the incremented value is equal to the number of sublinks lying between the message-receiving network node and the message-transmitting first network node;
- c.) locally storing the incremented value of the distance information in the at least one receiving network node;
- and
- d.) forwarding the message with the thus modified distance value to at least one further immediately adjacent network node, wherein
- the steps b.) to d.) being repeated until a defined abort criterion is reached.
A method for setting up a routing database in a packet-based network having a plurality of network nodes, wherein the distance between two network nodes is determined by the number of sublinks located between them, the method comprising the following steps:
- a.) transmitting a registration message having distance information from a first network node to at least one immediately adjacent receiving network node;
- b.) incrementing the value of the distance information by the at least one receiving network node, with the result that the incremented value is equal to the number of sublinks lying between the message-receiving network node and the message-transmitting first network node;
- c.) locally storing the incremented value of the distance information, the network address of the first sending network node, and the network address of the network node from which the distance information was last sent in the at least one receiving network node;
- and
- d.) forwarding the message with the thus modified distance value to at least one further immediately adjacent network node, wherein
- the steps b.) to d.) being repeated until a defined abort criterion is reached.
Dependencies are inferred from the claim text.