Abstract: The invention relates to a method which is used to adapt link weights or, link costs, for optimized traffic distribution within a communication network. According to said method, a loop is circulated until an interruption criterion is met. The individual iterations comprise the following steps: Routing of traffic within the communication network is calculated based on link cost paths. Parameter values used for opt imization e.g. the link-related volume of traffic, are determined for the individual links by means of the calculated path, and an expected volume of traffic and the link are determined for the parameter having the highest value. When the highest determined value is equal to or less than the valve of the previous step (interruption criterion), the link costs are increased for the determined link. Said method enables link costs and paths for optimized traffic distribution to be determined in an economical manner.

Abstract: A method for shortest path routing, optimized for network utilization is provided. The shortest or optimal paths for routing within the network are calculated from initial values for the link costs. The paths comprise possible path alternatives. The number of originally calculated paths is reduced to the set of unique paths (no path alternative), by changing the link costs as a measure of the loading of the individual links, which leads to an optimized loading of the links, in other words an optimized network utilization. The method provides a simple determination of paths for a single shortest path routing, optimized for network utilization.

Abstract: A method for shortest path routing, optimized for network utilization is provided. The shortest or optimal paths for routing within the network are calculated from initial values for the link costs. The paths comprise possible path alternatives. The number of originally calculated paths is reduced to the set of unique paths (no path alternative), by changing the link costs as a measure of the loading of the individual links, which leads to an optimized loading of the links, in other words an optimized network utilization. The method provides a simple determination of paths for a single shortest path routing, optimized for network utilization.

Abstract: A network node in the communication network is a target network node, connected by a first communication path with at least one first and one second network node, connected to each other by means of a further communication path. A routing table is held in each network node. The direct communication path from the first network node to the target network node is entered in the routing table of the first network node as the primary routing path and the path leading from the first network node to the second network node and then to the target network node is entered as the reserve routing path. An analogous entry is made in the routing table of the second network node. The relevant reserve routing path is only used on disruption of the primary routing path. A disruption in the primary communication path, provided between the first network node and the target network node is reported by the first network node, by means of a message sent to the second network node.

Abstract: The invention relates to a method which is used to adapt link weights or, link costs, for optimized traffic distribution within a communication network. According to said method, a loop is circulated until an interruption criterion is met. The individual iterations comprise the following steps: Routing of traffic within the communication network is calculated based on link cost paths. Parameter values used for opt imization e.g. the link-related volume of traffic, are determined for the individual links by means of the calculated path, and an expected volume of traffic and the link are determined for the parameter having the highest value. When the highest determined value is equal to or less than the valve of the previous step (interruption criterion), the link costs are increased for the determined link. Said method enables link costs and paths for optimized traffic distribution to be determined in an economical manner.

Abstract: Hash-code value ranges are determined for a traffic distribution among the nodes along a multipath route in a packet-oriented network, according to a predefined traffic distribution in the network. Starting from one or more start nodes, the traffic distribution is determined successively as a function of the hash-codes along the multipath route for each node, including branches, and an allocation of value ranges for the hash-codes to the outbound links is defined. The advantage is that it enables a desired distribution of traffic along any number of multipath routes by distribution on the basis of hash-codes.

Abstract: A method for optimization of traffic distribution in a communication network with multipath routing is provided. Distribution weightings are provided for a node of the communication network which has several alternatives or downward links for the routing to a target. The distribution weightings are modified relative to each other as a measure of the traffic loading on the downward links in order to reduce distributed traffic on highly loaded links and to increase distributed traffic on the less loaded links. An even traffic distribution on the communication network is thus achieved.

Abstract: A network node in the communication network is a target network node, connected by a first communication path with at least one first and one second network node, connected to each other by means of a further communication path. A routing table is held in each network node. The direct communication path from the first network node to the target network node is entered in the routing table of the first network node as the primary routing path and the path leading from the first network node to the second network node and then to the target network node is entered as the reserve routing path. An analogous entry is made in the routing table of the second network node. The relevant reserve routing path is only used on disruption of the primary routing path. A disruption in the primary communication path, provided between the first network node and the target network node is reported by the first network node, by means of a message sent to the second network node.

Abstract: In a network node of a packet-based communication network, comprising several network nodes, at least two path searches to a target network node are carried out in at least one network node, in series or parallel and the result of at least one of the path search methods is stored in the routing table.

Abstract: The invention relates to a method which is used to adapt link weights or, link costs, for optimized traffic distribution within a communication network. According to said method, a loop is circulated until an interruption criterion is met. The individual iterations comprise the following steps: Routing of traffic within the communication network is calculated based on link cost paths. Parameter values used for optimization e.g. the link-related volume of traffic, are determined for the individual links by means of the calculated path, and an expected volume of traffic and the link are determined for the parameter having the highest value. When the highest determined value is equal to or less than the valve of the previous step (interruption criterion), the link costs are increased for the determined link. Said method enables link costs and paths for optimized traffic distribution to be determined in an economical manner.

Abstract: The invention relates to method wherein data packets are respectively transmitted between an input network node and a destination network node via various transmission paths which link network nodes in a packet-switching communication network consisting of various network nodes. Multipath transmission paths are determined by initially determining at least two disjunct transmission paths between input and destination nodes. Direct transmission paths are then at least partially established in the direction of the target network nodes between the network nodes contained in the disjunct transmission paths such that at least two paths are respectively created from a network node of a disjunct transmission path in the direction of the target network nodes. Thirdly, other transmission paths leading via other network nodes are at least partially established between the remaining network nodes of the disjunct transmission paths.

Abstract: The invention relates to a method for adjusting distribution weights in a network comprising multiway routing or distribution tiers. Traffic on links or via nodes in which a threshold value for the volume of traffic is exceeded is reduced by adjusting the relative distribution weights within the distribution tiers. The inventive method allows shifting of distribution weights so as to obtain equal traffic distribution in the network. Disclosed are abort criteria in case the volume of traffic exceeds the capacity of the network. Traffic distribution which respects load thresholds of individual links represents a major step towards guaranteeing quality of service characteristics for telecommunication services provided via the Net.

Abstract: Hash-code value ranges are determined for a traffic distribution among the nodes along a multipath route in a packet-oriented network, according to a predefined traffic distribution in the network. Starting from one or more start nodes, the traffic distribution is determined successively as a function of the hash-codes along the multipath route for each node, including branches, and an allocation of value ranges for the hash-codes to the outbound links is defined. The advantage is that it enables a desired distribution of traffic along any number of multipath routes by distribution on the basis of hash-codes.

Abstract: The invention relates to a method, whereby between two adjacent network nodes which together comprise at least two parallel connecting paths and each comprise one routing table containing path information, said connecting paths are operated as independent transmission paths by means of corresponding entries in the routing tables.

Abstract: Data packets are forwarded in the network nodes of the communication network by a multipath routing method and multiprotocol label switching in at least one part of this communication network.

Abstract: A circuit arrangement is disclosed for the summation of products formed from analog signals and digital coefficients. A multiplying digital-analog converter is provided having a reference input for receiving analog signals at successive points in time. A data input of the digital-analog converter receives digital coefficients assigned to the respective analog signals. A summation stage connected to output signals of the digital-analog converter integrates over a predetermined time period the output signals of the digital-analog converter representative of products of the analog signals and digital coefficients.

Abstract: An adaptive or self-adjusting corrector is provided for the correction or equalization of data signals formed with the primary value and a plurality of prior and subsequent oscillations. A plurality of delay members are provided for delaying the data signals. Members for multiplying the data signals by alterable coefficients are provided at outputs of each of the delay members. At least one adder connects with the coefficient members for summing up the multiplied data signals. Either a first coefficient member corresponding to the primary value of the data signal or a second coefficient member corresponding to a first subsequent oscillation of the data signal establish constant coefficients. Alternatively both the first and second coefficients may be made constant. Preferably the constant value is zero.

Abstract: The invention relates to a novel switching circuit for regulating the repetition rate of clock pulses generated by a clock pulse generator. This repetition rate regulation of the clock pulses thereby controls the sampling instants at which a data signal is sampled. The best possible sampling interest is found by sampling at a first zero crossing of a distorted data pulse after its maximum value. The circuit of the invention generates a first signal which corresponds to the sign of the difference between the actual and the desired values of the data signal at the sampling instants; the circuit also generates a second signal which corresponds to the sign of the desired value of the data signal. A delay element delays the second signal by a period of the clock pulse. A multiplier circuit multiplies the first signal by the delayed second signal and produces an output control signal which regulates the repetition rate of the clock pulse generator.

Abstract: The invention relates to a novel filtering circuit whereby a phase detected output control signal is filtered and utilized to provide greater stability in a phase-locked loop. The filtering circuit is placed in the connecting path between a phase detector and an oscillator; the oscillator supplies output signals, having a repetition rate which depends on the instantaneous values of the filtered control signal. The filtering circuit comprises an adder which adds the phase detected control signal to a signal corresponding to the preceding filtered control signal multiplied by a constant factor which is less than unity (<1).

Abstract: A circuit arrangement is described wherein the pulse repetition frequency of a signal is digitally controlled in dependence on the pulse repetition frequency of a controlling signal. A presettable digital counter functioning as a frequency divider operates between preset initial and end counts and is reset to the initial value each time the end value is reached; the initial and end values are set responsive to binary signals applied to control inputs of the counter. A bistable trigger stage assumes either an idle or an operative state in dependence on the value of a control signal derived from the controlling pulse repetition frequency and a timing signal. The trigger stage output is used to control either the setting of the afore-mentioned initial value or the end value to produce either too high or too low values for the pulse repetition frequency of the controlled signal.