Method for traffic routing in a communications network
First Claim
1. A method for traffic routing in a communications network having a plurality of switching nodes interconnected such that a connection can be established between two neighboring switching nodes via a plurality of connecting paths so that if a direct path between an originating switching node and a neighboring destination switching node is not available, a second path leading via an intermediate switching node can be determined, comprising the steps of:
- providing in the originating switching node data relating to both achievability of direct paths connecting the originating switching node to its neighboring nodes, and achievability of direct paths connecting the neighboring destination switching nodes to their respective neighboring nodes, this being achieved by data periodically updated in the switching nodes and relating to the direct paths connected to these switching nodes being combined in node-specific priority lists which are ordered in terms of degree of achievability, and wherein each switching node sends its own priority list to all of its neighboring nodes so that node-specific priority lists of all the neighboring nodes are available in each switching node;
for identifying a second path which has as high a probability as possible of successful switching, the priority list of the originating node is compared with the priority list of the neighboring destination node, and the neighboring node whose direct paths to the originating and destination nodes promises the highest switching probability is selected as said intermediate switching node for said second path; and
upon successful switching, storing the second path and, as long as the previous priority lists continue to be valid, using the second path directly for a subsequent corresponding call request without a determination procedure.
1 Assignment
0 Petitions
Accused Products
Abstract
In order to determine the second path in the case of non-availability of a direct path between neighboring switching nodes, there are held in the individual switching nodes priority lists in which, ordered in terms of the degree of loading, the direct paths to the neighboring nodes and the direct paths from these neighboring nodes to the neighboring nodes thereof are identified by comparing the priority list of the originating node with that of the neighboring destination node, that neighboring node whose direct paths to the originating and destination nodes promise the highest switching probability being selected as an intermediate switching node of a second path.
-
Citations
8 Claims
-
1. A method for traffic routing in a communications network having a plurality of switching nodes interconnected such that a connection can be established between two neighboring switching nodes via a plurality of connecting paths so that if a direct path between an originating switching node and a neighboring destination switching node is not available, a second path leading via an intermediate switching node can be determined, comprising the steps of:
-
providing in the originating switching node data relating to both achievability of direct paths connecting the originating switching node to its neighboring nodes, and achievability of direct paths connecting the neighboring destination switching nodes to their respective neighboring nodes, this being achieved by data periodically updated in the switching nodes and relating to the direct paths connected to these switching nodes being combined in node-specific priority lists which are ordered in terms of degree of achievability, and wherein each switching node sends its own priority list to all of its neighboring nodes so that node-specific priority lists of all the neighboring nodes are available in each switching node; for identifying a second path which has as high a probability as possible of successful switching, the priority list of the originating node is compared with the priority list of the neighboring destination node, and the neighboring node whose direct paths to the originating and destination nodes promises the highest switching probability is selected as said intermediate switching node for said second path; and upon successful switching, storing the second path and, as long as the previous priority lists continue to be valid, using the second path directly for a subsequent corresponding call request without a determination procedure. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
Specification