Abstract: A method for transmitting data in a wireless radio network having a multiplicity of base stations for wirelessly sending and receiving data, wherein the base stations are wirelessly networked such that each base station can communicate wirelessly with one or more adjacent base stations. Broadcast messages are transmitted between a mobile station for wirelessly sending and/or receiving data and the base stations and broadcast messages are also forwarded between the base stations. These broadcast messages do not have an associated explicit connection between two units in the radio network. Moreover, the mobile station which receives a broadcast message can process this message regardless of the base station from which it originates. This avoids so-called “hand offs,” which are used in the prior art to associate a mobile station with a new base station when the mobile station moves out of range of the earlier base station.

Abstract: A method defines shared risk link groups in optical transport systems, in which two optical links sharing at least one single point of failure are considered to be non-disjoint. For each optical link there is measured and recorded a polarization state characteristic and two links having the same characteristic are judged to be non-disjoint and to be in the same shared risk link group.

Abstract: The aim of the invention is to provide a method, network control unit and a communication network for optimising the traffic in a communication network that is configured from network components, these entities permitting a degradation of service quality caused by the non-availability of network components to be at least temporarily averted.

Abstract: A method for transmitting data in a wireless radio network having a multiplicity of base stations for wirelessly sending and receiving data, wherein the base stations are wirelessly networked such that each base station can communicate wirelessly with one or more adjacent base stations. Broadcast messages are transmitted between a mobile station for wirelessly sending and/or receiving data and the base stations and broadcast messages are also forwarded between the base stations. These broadcast messages do not have an associated explicit connection between two units in the radio network. Moreover, the mobile station which receives a broadcast message can process this message regardless of the base station from which it originates. This avoids so-called “hand offs,” which are used in the prior art to associate a mobile station with a new base station when the mobile station moves out of range of the earlier base station.

Abstract: In one aspect, a method for estimating the bandwidth requirements for a transmission between an input node and an output node of a network with access controls is provided. According to the method, with respect to a time period, the sum of the value of the average bandwidth of the traffic that has been transmitted between the nodes during the time period and the weighted value of the accumulated bandwidth of the declined reservation requests is calculated. An efficient, approximate determination of the traffic matrix of the network and thus an optimal new definition of the limits for the access controls is permitted. This provides particular advantages in terms of efficiency and resources for applications in networks with a dynamic adaptation of the access controls to modified traffic situations.

Abstract: According to one embodiment, traffic load is redirected in reaction to traffic overload or a link failure in a packet-based network that is formed by nodes and links, packets being distributed along multiple paths to other links of an associated array of paths. The redistribution is performed autonomously by the node which is located immediately upstream of the affected link. According to a further development of the method, nodes that are located upstream of the concerned node are notified and are made to perform a redistribution that relieves the concerned node if the array of paths is not made overload-free by the redistribution performed by the node. A mechanism that protects against overload and failures and reacts in a significantly more flexible and less error-prone manner than networks having a central control body due to the nodes being autonomous is provided.

Abstract: A method establishes a connection between a source node and a sing node of a communication network. One or several additional nodes represent nodes of the connection in addition to the source node and the sink node. An end-to-end availability of the connection is determined from one respective availability value of at least the additional node/s of the connection and each individual connection between two respective nodes of the connection.

Abstract: In one aspect, a method for estimating the bandwidth requirements for a transmission between an input node and an output node of a network with access controls is provided. According to the method, with respect to a time period, the sum of the value of the average bandwidth of the traffic that has been transmitted between the nodes during the time period and the weighted value of the accumulated bandwidth of the declined reservation requests is calculated. An efficient, approximate determination of the traffic matrix of the network and thus an optimal new definition of the limits for the access controls is permitted. This provides particular advantages in terms of efficiency and resources for applications in networks with a dynamic adaptation of the access controls to modified traffic situations.

Abstract: In one aspect method and device for tracking network parameters of a communications network, which is formed by links, with access controls for the purpose of limiting the traffic load are provided. The traffic matrix of the network is regularly determined and probabilities of the blocking of traffic are determined based on the traffic matrix. If the blocking probabilities exceed a criterion, typically a maximum blocking probability, the access controls are oppositely controlled in an automatic manner by resetting the limits for the access controls. This resetting can precede a resetting of link weights for optimizing the distribution of traffic in the network. Automatic continuous adaptation of network parameters for optimizing the probability of authorization is enabled for the traffic flows to be transmitted.

Abstract: According to one embodiment, traffic load is redirected in reaction to traffic overload or a link failure in a packet-based network that is formed by nodes and links, packets being distributed along multiple paths to other links of an associated array of paths. The redistribution is performed autonomously by the node which is located immediately upstream of the affected link. According to a further development of the method, nodes that are located upstream of the concerned node are notified and are made to perform a redistribution that relieves the concerned node if the array of paths is not made overload-free by the redistribution performed by the node. A mechanism that protects against overload and failures and reacts in a significantly more flexible and less error-prone manner than networks having a central control body due to the nodes being autonomous is provided.

Abstract: An inter-domain multipath routing method, for extending multipath routing beyond the limits of packet-oriented networks or autonomous systems is provided. A traffic distribution over several links, outgoing from a packet-oriented network with multipath routing, is carried out. For the determination of alternative paths, leading to neighboring networks, the edge nodes of neighboring networks, by means of which a target can be reached, can be combined as a virtual end point. The virtual edge nodes then permit alternative paths between a starting point and the virtual end point to be determined by means of conventional methods, for example, multipath MPLS. Packets are then distributed over the paths, whereby a distribution beyond the network limit is also induced.