Alcatel Sel Aktiengesellschaft

Siemens Aktiengesellschaft

Alcatel N.v.

Nokia Siemens Networks Gmbh & Co Kg

Alcatel Alsthom Compagnie Generale D'electricite

Gert Willmann

Karl Schrodi

Matthias Wippenbeck

Joachim Charzinski

Wolfgang Staiger

Christoph Reichert

Johannes Conradt

The invention relates to the routing of data packets comprising a target address in a packet switching data network. According to the invention, a first and second transmission path are assigned respective traffic distribution weightings in a routing table for individual target addresses that is assigned to a network node, said weightings indicating the respective allocated traffic load per transmission path. The maximum traffic distribution weighting is assigned to the respective first transmission path and the minimum traffic distribution weighting is assigned to the second transmission path. During undisturbed operation, data packets are routed via the first transmission path and if said path is interrupted, the packets are routed via the second transmission path.

Method and arrangement for routing data packets in a packet-switching data network

The invention relates to the routing of data packets in a packet-switched network, e.g. in an autonomous system, having traffic distribution. According to the invention, the forwarding or the routing of data packets occurs via the access interface based on an item of information and via the output interface of the data packet based on an item of information. Both these items of information are, for example at the input interface, placed in front of the data packet in the form of information fields or labels. The invention enables, with a moderate expense and limited degree of complexity, a flexible and loop-free routing under the terms of a traffic distribution.

Efficient intra-domain routing in packet-switched networks

The invention concerns a method of establishing a multichannel connection comprising N channels, two switching facilities, a communications network, and a transmit-side and a receive-side access facility to a communications network. When a multichannel connection (SLOT3, SLOT7; SLOT5, SLOT28) is established through a switching network (DSN), first the transit times (T1, T2, T3) of more than N channels through the switching network (DSN) are determined (MONIT). Then N channels are selected from said more than N channels by means of an algorithm (CONTR), which uses the determined transit times (T1, T2, T3) as input values. Subsequently the selected N channels are assigned as channels to the multichannel connection (SLOT3, SLOT7; SLOT5, SLOT28), and for their synchronization the channels are delayed in accordance with the determined transit times (T1, T2, T3). This method is also applicable to end-to-end multichannel connections and single channel connections.

Method of establishing a multichannel connection, as well as switching

Data packets (D1, D2) each assigned to one of at least two priority classes (P1, P2) are stored in a buffer (MEM2) designed to hold data on a threshold value for each priority class wherein, instead of having the threshold fixed for each priority class whereby the data packets of the corresponding priority class will no longer be written into the buffer (MEM2) when the threshold is exceeded ('partial buffer sharing'), one or more thresholds are dynamically controlled. The current loss probability of the highest priority class (P1) is determined, and the threshold (MEM1) of the lowest priority class (P2) is then raised or lowered (REG1). This results in improved buffer utilization in applications which require a given loss probability for high priority classes, and calculation of a threshold value is no longer necessary.

Method of controlling access to a buffer and a device for temporary

A method is provided for temporarily storing data packets, in which incoming data packets (D1, D2, D3) are distributed to and temporarily stored in two or more logic queues (QU1, QU2) on the basis of data (P1, P2) contained in the incoming data packets (D1, D2, D3), and in which all of the logic queues (QU1, QU2) share a common buffer memory (MEM) having locations that are dynamically allocated to the logic queues (QU1, QU2) only when required. The method features the steps of rejecting individual data packets (D1, D2, D3) if proper treatment is not ensured for all data packets, determining queue length data on the lengths of the logic queues (QU1, QU2), determining queue allocation data on which of the logic queue (QU1, QU2) an incoming data packet (D1, D2, D3) will be allocated, and selecting the incoming data packets (D1, D2, D3) to be rejected on the basis of the queue length data and the queue allocation data.

Method and facility for temporarily storing data packets, and exchange

A random distribution of a traffic stream to several traffic streams is carried out by a cyclic shifting and swapping of elements of an allocation list with at least one random operation. A switching element is implemented according to this approach, wherein incoming cells are distributed to several outputs on the basis of the periodic processing of an allocation list which is changed after each cycle by shifting and randomly swapping two list elements. This results in a simple algorithm, suitable for implementation in hardware. Such can generate all possible permutations with settable minimum and maximum delays. This solution is also usable for problems in other areas, such as efficient allocation of multiprocessor resources.

Growing community of inventors

Stuttgart, Germany

Gert Willmann