Method and arrangement for forming routing information in a communication network

• US 5,675,582 A
• Filed: 12/21/1995
• Issued: 10/07/1997
• Est. Priority Date: 12/21/1994
• Status: Expired due to Term

• Current Assignee: Transpacific Silica LLC (Intellectual Ventures LLC)
• Original Assignee: Siemens AG
• Inventors: Tietsch, Michael, Hummel, Heinrich
• Primary Examiner(s): HSU, ALPUS
• Application Number:
  US08/576,317
• Time in Patent Office: 656 Days
• Field of Search: 370/235, 370/237, 370/238, 370/252, 370/254, 370/255, 370/351, 370/400, 370/401, 370/410, 370/389, 370/392, 340/825.03, 340/826, 340/827, 379/219, 379/220, 379/221, 379/271, 379/272, 379/273, 395/200.01, 395/200.1, 395/200.15
• US Class Current: 370/255
• CPC Class Codes: H04Q 3/66 Traffic distributors

Abstract

The method provides for routing traffic relations (vb) in a communication network (KN) having arbitrary topology with n network nodes (NK) and m trunks (VL). The switching of traffic relations (vb) from network node (NK) to network node (NK) via one through maximally r optimum routes (R) can ensue paritized, prioritizing or in arbitrary mixtures. This is effected by routing information (ri) formed network node-associated and traffic relation-associated and by random numbers formed in the framework of the setup of traffic relations (vb) via which the traffic relations (vb) are statistically distributed over the one through maximally r routes (R) of a traffic relation (vb) via the affected network nodes (NK).

Claims

1. A method for forming routing information for traffic relations in a communication network with arbitrary topology having n network nodes and m trunks with a respective, predetermined trunk traffic flow, whereby one through a maximum of r bidirectional optimum routes are identified for every traffic relation from each of the n network nodes to each of further n-1 network nodes, whereby a traffic relation traffic flow is defined for every traffic relation, comprising the steps of:

allocating a traffic flow quantum to each trunk involved in first optimum routes and subtracting the traffic flow quanta from a respective traffic relation traffic flow;

repeatedly implementing the allocation and subtraction of the traffic flow quanta;

summing per trunk the allocated traffic flow quanta;

allocating, given upward transgression of the summed traffic flow quanta above one of the trunk traffic flows, a following traffic flow quanta of the affected traffic relation to trunks involved in a respectively following optimum route;

ending, given downward transgression of a respective traffic relation traffic flow below a predetermined value, the allocation of traffic flow quanta for the respectively affected traffic relation;

summing per route the traffic flow quanta of a traffic relation allocated to the routes to form traffic distribution values;

summing the traffic distribution values individually associated to traffic relations to form route sequences for every originating network node and every transit network node relevant to a traffic relation and norming the traffic distribution values to form routing information corresponding to statistical lower and upper values.

2. The method according to claim 1, wherein a size of the traffic flow quantum is matched to a capacity of the trunks and to a size of the traffic relation traffic flow.

3. The method according to claim 1, wherein given parity switching of all communication relations in the communication network, a value of a common size is allocated to the traffic flow quanta of the traffic relations to be allocated.

4. The method according to claim 1, wherein given prioritizing switching of traffic relations in the communication network, a value that is higher than the traffic flow quanta of the non-prioritized traffic relations is allocated to the allocatable traffic flow quanta of the traffic relations to be prioritized.

5. The method according to claim 1, wherein the routing information represents switching-oriented routing information that defines the trunk allocated to a selected route and that defines a direction of a destination network node.

6. The method according to claim 1, wherein the routing information is switching-oriented routing information that selects one of a bidirectional route and a unidirectional route.

7. The method according to claim 1, wherein the one through maximally r optimum routes are defined as a function of a minimum or maximum quality of trunks, a maximum transmission capacity of the individual trunks, a maximum plurality of serially arrangable trunks and/or network nodes.

8. The method according to claim 1, wherein, before an information switching from an originating network node to a destination network node within a call setup for traffic relations, a random distribution value that lies between the static upper distribution value and lower distribution value is defined in the originating and in the transit nodes and is compared to the routing information;

and wherein dependent on a result of this comparison, the information is switched to a trunk identified by the random distribution value.

9. An arrangement for forming routing information for traffic relations in a communication network with arbitrary topology having n network nodes and m trunks with a respective, predetermined trunk traffic flow, comprising:

one through a maximum of r bidirectional optimum routes identified for every traffic relation from each of the n network nodes to each of further n-1 network nodes;

traffic relation traffic flow defined for every traffic relation;

a traffic flow quantum allocated to each trunk involved in first optimum routes, a respective traffic flow being subtracted from a respective traffic relation traffic flow;

a summed traffic flow quanta determined by repeated implementation of the allocation and subtraction of the traffic flow quanta and summation of the allocated traffic flow quanta per trunk;

respective traffic distribution values formed by allocating, given upward transgression of the summed traffic flow quanta above one of the trunk traffic flows, a following traffic flow quanta of the affected traffic relation to the trunks involved in a respectively following optimum route, by ending, given downward transgression of a respective traffic relation traffic flow below a predetermined value, the allocation of traffic flow quanta for the respectively affected traffic relation, and by summing per route the traffic flow quanta of a traffic relation allocated to the routes;

routing information corresponding to statistical lower and upper values formed by summing the traffic distribution values individually associated to traffic relation to form route sequences for every originating network node and every transit network node relevant to a traffic relation and norming the traffic distribution values.

10. A method for forming routing information for traffic relations in a communication network with arbitrary topology having n network nodes and m trunks with a respective, predetermined trunk traffic flow, whereby one through a maximum of r bidirectional optimum routes are identified for every traffic relation from each of the n network nodes to each of further n-1 network nodes, whereby a traffic relation traffic flow is defined for every traffic relation, comprising the steps of:

defining the one through maximally r optimum routes as a function of a minimum or maximum quality of trunks, a maximum transmission capacity of the individual trunks, a maximum plurality of serially arrangable trunks and/or network nodes;

allocating a traffic flow quantum to each trunk involved in first optimum routes and subtracting the traffic flow quanta from a respective traffic relation traffic flow;

repeatedly implementing the allocation and subtraction of the traffic flow quanta;

summing per trunk the allocated traffic flow quanta;

allocating, given upward transgression of the summed traffic flow quanta above one of the trunk traffic flows, a following traffic flow quanta of the affected traffic relation to trunks involved in a respectively following optimum route;

ending, given downward transgression of a respective traffic relation traffic flow below a predetermined value, the allocation of traffic flow quanta for the respectively affected traffic relation;

summing per route the traffic flow quanta of a traffic relation allocated to the routes to form traffic distribution values; and

summing the traffic distribution values individually associated to traffic relations to form route sequences for every originating network node and every transit network node relevant to a traffic relation and norming the traffic distribution values to form routing information corresponding to statistical lower and upper values.

11. The method according to claim 10, wherein a size of the traffic flow quantum is matched to a capacity of the trunks and to a size of the traffic relation traffic flow.

12. The method according to claim 10, wherein given parity switching of all communication relations in the communication network, a value of a common size is allocated to the traffic flow quanta of the traffic relations to be allocated.

13. The method according to claim 10, wherein given prioritizing switching of traffic relations in the communication network, a value that is higher than the traffic flow quanta of the non-prioritized traffic relations is allocated to the allocatable traffic flow quanta of the traffic relations to be prioritized.

14. The method according to claim 10, wherein the routing information represents switching-oriented routing information that defines the trunk allocated to a selected route and that defines a direction of a destination network node.

15. The method according to claim 10, wherein the routing information is switching-oriented routing information that selects one of a bidirectional route and a unidirectional route.

16. The method according to claim 10, wherein, before an information switching from an originating network node to a destination network node within a call setup for traffic relations, a random distribution value that lies between the static upper distribution value and lower distribution value is defined in the originating and in the transit nodes and is compared to the routing information;

and wherein dependent on a result of this comparison, the information is switched to a trunk identified by the random distribution value.