Abstract: The invention relates to a method for storing and passing on multimedia messages for a multimedia call in a packet-switching telecommunication network (TN), with the called subscriber (B subscriber) having network access with a known and predetermined bandwidth to the telecommunication network (TN). In the situation where it is found (1) during the setting up of a multimedia call that the available bandwidth is too narrow (2, 3) because the called subscriber (B subscriber) is currently using a further multimedia service, the multimedia call is diverted (4) to a recording device (ABZ) which is available in the telecommunication network (TN). A calling subscriber (A subscriber) can then leave a multimedia message on the recording device (ABZ), which is then passed (5) to a local recording device (ABL) for the called subscriber (B subscriber) via the network access and using the bandwidth that is still available.

Abstract: According to the present invention, a large scale traffic distribution is carried out in a packet-oriented communication network. The distribution results, in a simple, practical and inexpensive way, for all the services and applications which reliably and efficiently preserve their specific quality of service requirements, in a highly balanced quality of service with best effort character. Preferably, there is in the traffic at least a priority class traffic whereof the traffic concerned is transmitted in distributed manner and in packets with strict priority in the communication network. The observance of specific quality of service requirements is monitored at least for the priority traffic. Classification in the priority class traffic enables to provide an adequate quality of service, even for real-time services and applications.

Abstract: 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.

Abstract: 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.

Abstract: The invention relates to a method for storing and passing on multimedia messages for a multimedia call in a packet-switching telecommunication network (TN), with the called subscriber (B subscriber) having network access with a known and predetermined bandwidth to the telecommunication network (TN). In the situation where it is found (1) during the setting up of a multimedia call that the available bandwidth is too narrow (2, 3) because the called subscriber (B subscriber) is currently using a further multimedia service, the multimedia call is diverted (4) to a recording device (ABZ) which is available in the telecommunication network (TN). A calling subscriber (A subscriber) can then leave a multimedia message on the recording device (ABZ), which is then passed (5) to a local recording device (ABL) for the called subscriber (B subscriber) via the network access and using the bandwidth that is still available.

Abstract: The invention relates to a method, a boundary node and a server for restricting the traffic in a packet-oriented, connectionless network for an efficient QoS transmission of prioritized data packets. According to the invention, reliability checks are carried out that include a reliability check with respect to the network input and the network output. The reliability checks allow to check whether resources meeting the requirements to transmission of a group of data packets of a priority class are available in the network. The invention allows to avoid resource shortages, especially at the network input and network output, thereby safeguarding QoS transmission.

Abstract: Connectionless Internet protocols make use of the principle of routes. The routes implicity lay-down which path the data packets of a communication relation flow will take through the network. When a data packet of a so far unknown flow occurs for the first time, the router selects a route which is used for all subsequent data packets for said flow. These routes usually terminate on the same neighboring node. The aim of the invention is to achieve an adequate quality of service also for connectionless communication networks, by evenly distributing the flows to the routes in the network in order to achieve an as even a distribution of traffic as possible, which conventional distribution fan-out structures have so far been incapable of achieving. According to the invention, a selection of useful routes between the router and the target address via which the information is guided to the target is locally determined in the router.

Abstract: There is described a method and a configuration system for the automatic readjustment of limits for access controls used to restrict the traffic in a communication network formed by links, said communication network comprising control bodies for performing the access controls. The readjustment of limits for access controls is triggered by an event. A traffic matrix of the network is recorded in the configuration system of the communication network, and a recalculation of link weights is carried out by the configuration system by means of a traffic matrix. New limits are determined limits are respectively transmitted to associated control bodies for performing the access restriction and are activated for access controls. The method enables the limits for the access controls to be automatically monitored.

Abstract: At least one queue is provided per current branch pattern in a network node. In this way, a queue can be jointly used for a plurality of distribution compartments which are imaged onto the same branch pattern in said node. Arriving packets are differentiated according to the particular distribution compartment to which they belong (i.e. not according to a particular flow to which they belong inside the distribution compartment). They are then inserted into a corresponding queue accordingly. Said queues are used by the ports belonging to each branch pattern. As soon as a port is free, it selects the next queue to use. The selection thus begins in sufficient time to ensure that no gaps appear on the outgoing line from said port. If a port uses a plurality (in this case fully or partially overlapping) of branch patterns, a search is then carried out for non-empty queues in all of that branch patterns, during the selection.

Abstract: 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.

Abstract: 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.

Abstract: The invention relates to the autonomous, adaptive control of a network element in a packet-oriented and connection-less communication network, and to the coupling of a plurality of network elements.

Abstract: Connectionless Internet protocols make use of the principle of routes. The routes implicitly lay down which path the data packets of a communication relation (flow) will take through the network. When a data packet of a so far unknown flow occurs for the first time, the router selects a route which is used for all subsequent data packets of said flow. These routes usually terminate on the same neighboring node. The aim of the invention is to achieve an adequate quality of service (QoS) also for connectionless communication networks, by evenly distributing the flows to the mutes in the network in order to achieve an as even a distribution of traffic as possible, which conventional distribution fan-out structures have so far been incapable of achieving. According to the invention, a selection of useful routes between the router and the target address via which the information is guided to the target is locally determined in the router.

Abstract: According to the present invention, a large scale traffic distribution is carried out in a packet-oriented communication network. The distribution results, in a simple, practical and inexpensive way, for all the services and applications which reliably and efficiently preserve their specific quality of service requirements, in a highly balanced quality of service with best effort character. Preferably, there is in the traffic at least a priority class traffic whereof the traffic concerned is transmitted in distributed manner and in packets with strict priority in the communication network. The observance of specific quality of service requirements is monitored at least for the priority traffic. Classification in the priority class traffic enables to provide an adequate quality of service, even for real-time services and applications.

Abstract: The invention relates to a method, a boundary node and a server for restricting the traffic in a packet-oriented, connectionless network for an efficient QoS transmission of prioritized data packets. According to the invention, reliability checks are carried out that include a reliability check with respect to the network input and the network output. The reliability checks allow to check whether resources meeting the requirements to transmission of a group of data packets of a priority class are available in the network. The invention allows to avoid resource shortages, especially at the network input and network output, thereby safeguarding QoS transmission.

Abstract: At least one queue is provided per current branch pattern in a network node. In this way, a queue can be jointly used for a plurality of distribution compartments which are imaged onto the same branch pattern in said node. Arriving packets are differentiated according to the particular distribution compartment to which they belong (i.e. not according to a particular flow to which they belong inside the distribution compartment). They are then inserted into a corresponding queue accordingly. Said queues are used by the ports belonging to each branch pattern. As soon as a port is free, it selects the next queue to use. The selection thus begins in sufficient time to ensure that no gaps appear on the outgoing line from said port. If a port uses a plurality (in this case fully or partially overlapping) of branch patterns, a search is then carried out for non-empty queues in all of that branch patterns, during the selection.

Abstract: Components for transmitting ATM cells related to Internet data packets are additionally integrated in an ATM communications system for transmitting data and data packets packed in ATM cells for ATM communications networks which are formed by ATM communications systems. The complete integration of the Internet transmission function into ATM communications systems results in effective traffic and network management of ATM cells related to Internet data packets with a very low level of integration complexity.

Abstract: In a method and network component of a communications network for switching connections of low bit rate between input modules and output modules, the input modules and the output modules form a first switching level, and an ATM switching stage arranged between the input modules and the output modules forms a second switching level. In the first switching level, a number of low bit rate connections at the input module, which are to be transmitted to the same output module, are respectively merged by the input module into at least one ATM connection. In the second switching level, the switching through of the ATM connections for transmitting data in ATM cells ensues by the ATM switching stage. Subsequently, in the first switching level, the ATM connections which have been switched through are converted by the output module into the low bit rate connections.

Abstract: 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.

Abstract: 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.