Telefonaktiebolaget Lm Ericsson (publ)

Csaba Antal

János Farkas

Attila Takács

Lars Westberg

Panagiotis Saltsidis

András Császár

Attila Báder

János Harmatos

Niilo Musikka

Alpár Jüttner

Gábor Tóth

Bengt Henriques

Gergely Matefi

J&oacute;zsef Moln&aacute;r

Jànos Farkas

A registration protocol for setting up and updating a tree that defines the active topology in an Ethernet network includes a plurality of application components and a plurality of attribute declaration components corresponding to the application components, wherein the application components declare and register attribute values and the corresponding attribute declaration components make and withdraw registration of the attributes.

Multiple tree registration protocol

There is disclosed a method and apparatus for facilitating a network, such as an Ethernet LAN, for efficient forwarding of data traffic by collecting neighbor information, generating and distributing link state advertisements, populating a topology database for the network, and calculating trees for each bridge serving as a root bridge. In a preferred embodiment the method and system also prepare one or more backup topologies, and store them for use if they are needed due to a failure condition detected in the network. In a particularly preferred embodiment, probabilities are assigned to various potential failure conditions, and the probability values are used to decide which backup topologies to calculate, store, or use.

Method and system for controlled tree management

A method and arrangement for failure handling in a tree-structured communications network having interconnected edge nodes and switching nodes. VLANs may be established by using spanning trees to provide connectivity in case of a failure in the network. Emitters in the edge nodes periodically broadcast alive messages on the VLANs, and notifiers note the alive messages. A missing alive message indicates a failure on one of the VLANs, and the notifier broadcasts corresponding failure messages on the VLANs. When the alive messages are restored, the notifier broadcasts corresponding repair messages. If a notifier fails to note a failure, one of the edge nodes performs a similar function although somewhat slower.

Method and arrangement for failure handling in a network

The invention relates to techniques for traffic handling in congestion situations in a point-to-multipoint ('PTM') enabled network. A method embodiment of the inventive technique is performed in an egress node of the network and comprises the steps of detecting marked packets, the marking being indicative of a congestion situation in a core node of the PTM-enabled network; selecting, based on the detected markings, a particular PTM flow from one or more PTM flows passing the egress node for termination; and indicating the selected PTM flow in an upstream direction of the selected flow.

Congestion handling in multicast networks

There is disclosed a manner of managing the active topology, that is the scheme for forwarding data, in a computer network such as an Ethernet local area network. A root bridge is selected from a plurality of bridges in the network; the root bridge calculating at least one spanning tree from a topology database that has been populated by bridge neighbor information gleaned from link state advertising messages. The root bridge may also calculate an alternate topology for implementation in the event a failure condition that affects the primary spanning tree is detected. The root bridge then advertises the spanning tree and remotely configures the port states of the bridges in the spanning tree through tree advertising messages that the bridges are arranged to process and set their ports accordingly.

Method and apparatus for network tree management

A method is provided for use at a first node of a network. The first node (B) has an input path for receiving Ethernet frames destined for a second node of the network. The first node (B) also has a first output (working) path for forwarding the received Ethernet frames towards the second node. A failure along the first output (working) path is detected at the first node. Following such failure detection, the received Ethernet frames are caused, at the first node, to be re-routed along a second output (backup) path, different to the first output (working) path, towards the second node. The re-routing is performed by using (e.g. referring to and/or changing) respective indications (VLAN) applied to the Ethernet frames to distinguish those Ethernet frames to be forwarded along the first output (working) path from those Ethernet frames to be forwarded along the second output (backup) path.

Method and apparatus for ethernet protection with local re-routing

A mobile communications network has separation between a user plane (UP) and a control plane (CP). The network includes plural entities, including plural user plane entities (UPEs), which form the user plane and plural mobility management entities (MMEs), which form the control plane. At least one of the entities is configured to transmit advertisement information. The advertisement information includes status information and configuration information of the at least one entity. The network also includes a node or unit configured to use both the advertisement information and transport information transported on the user plane to select a user plane entity for attachment to a wireless station serviced by the network.

Automatic distribution of server and gateway information for pool configuration

A call admission control system and method for Internet Protocol (IP) Differentiated Services (DiffServ) network having at least one node for interpreting signaling messages and controlling traffic load in the network. The method consists of an initialization () and a real-time phase (). In initialization phase (), coefficients of the approximating hyperplanes are computed () and stored (). This phase is repeated when the descriptor of a traffic class changes (), which usually happens when nodes are configured or reconfigured. A traffic mix is admissible (), if for each real-time traffic class both the stability () and the delay () constraints are fulfilled. Stability is tested by evaluating the number of lost packets and comparing it to the tolerated packet loss ratio for each class in that queue. Delay constraint is tested by checking if the traffic mix is below at least one of the approximating hyperplanes in the space of number of sessions for each class.

Call admission control system and method for interpreting signaling messages and controlling traffic load in internet protocol differentiated services networks

In the area of network provisioning, there is a problem of selecting a suitable traffic-provisioning model for large networks due to the high management complexity of the resource-efficient trunk model and the poor bandwidth efficiency of the easy-to-configure hose model. The invention is based on the idea of partitioning at least part of the network into multi-node clusters, and defining traffic limitations on at least two levels, including the intra-cluster level and the inter-cluster level, where the traffic limitations include one or more node-to-cluster traffic limitations for inter-cluster traffic. Subsequently, cluster-based provisioning of the network is performed based on the traffic limitations. The novel node-to-cluster limitations proposed by the invention are preferably applied in a cluster-based trunk or hose model on the inter-cluster level. In other words, for the description of the inter-cluster traffic (traffic between the clusters) cluster-based trunk or hose models can be used, preferably depending on the available information about the traffic. The cluster-based provisioning makes it possible to find a trade-off between management complexity and overprovisioning.

Cluster-based network provisioning

The efficiency of transmitting lower priority data traffic along with higher priority traffic is improved by segmenting a data packet in such a way so as to reduce transmission delay of the higher priority traffic. The data packet is segmented so that all its segments, including the last segment, are approximately the same size. The segment size is set smaller than a maximum permitted segment size. Indeed, it is desirable (though not necessary) to set the segment size as small as design parameters, (e.g., minimize segment header overhead), allow in order to reduce transmission delay of the higher priority traffic. Because the last segment is set at the same size or a larger size than the other segments, delay in transmitting the data packet is also reduced. The last segment may be sized as large as practical to minimize the transmission delay of the data packet. Once segmented, the data packet segments are transmitted along with the higher priority traffic.

Method and apparatus for segmenting a data packet

A dynamic synchronous transfer mode network includes first and second unidirectional buses and , and a plurality of nodes, 0 to N&minus;1. Each node includes a mechanism for selecting a bus. When a first node wishes to initiate a call with a second node, the selected bus is used to communicate with the second node. Each node includes a processor for calculating, for the selected bus, a ratio based on the number of previous reservations made by the node and the number of previous reservations relating to calls to or from the node. If the ratio is below a threshold, then a channel reservation device reserves one or more channels for a call. If the ratio is above the threshold, then the device requests a second node to reserve one or more channels for the call. This overcomes unfair operation of the network caused by the dual-bus topology.

Growing community of inventors

Kiskunlacháza, Hungary

Csaba Antal