Abstract: Reducing congestion in an IP domain wherein congested data flows arriving at an egress edge node of the network are identified. Total congestion represented by the congested flows is determined, and a congestion extent notification is sent from the egress edge node to its ingress edge node peer. The congestion extent notification includes information regarding the total congestion and is sent on a per-class basis. Congested core routers in the network insert DSCPs into data packets passing through them to enable the egress edge nodes to identify the affected flows. The core routers may also send congestion metric messages, designed to follow the same path as the marked packets, to inform the egress edge nodes of the extent of congestion. In an alternative method, the egress edge nodes inform their ingress peers that congestion is present, without initially identifying the extent. The ingress edge node sends a query downstream with a congestion metric.

Abstract: A method and apparatus for providing a Spanning Tree to nodes on an Ethernet network. A Spanning Tree topology is calculated, and a Resource Reservation Protocol Traffic Extension path message is generated. The path message contains at least a part of the Spanning Tree topology. The path message is sent to bridges on the Ethernet network. The bridge nodes that receive the path message configure their port states depending on the information contained in the path message, and may also configure port Virtual Local Area Network membership.

Abstract: A system, method, and node for identifying non-Multiple Spanning Tree Protocol control planes. The method includes the steps of identifying a specific non-Multiple Spanning Tree Protocol control plane instance, associating a General Control Plane Identification, GCPID, with the specific control plane instance, wherein the GCPID binds a Virtual Local Area Identifier, VID, with the specific control plane, and advertising the GCPID to identify the specific control plane instance.

Abstract: A method for establishing a downstream multicast and a upstream and downstream unicast connections between a root and at least one leaf, the root and the at least one leaf being in a tree-type configuration, comprises: creating a downstream unicast label; and distributing the created downstream unicast label in a same signaling message as downstream multicast and upstream unicast labels from the root to the at least one leaf. A network node comprising such a downstream unicast label is used to carry out the method.

Abstract: A network arranged to implement label switched paths, comprising: an ingress label edge router (LER), atleast one label switching router (LSR), and an egress LER, in which the ingress LER is connected to the egress LER via one or more of the LSRs. In said network the ingress LER is arranged to transmit, in use, a path message for setting up a bidirectional label switched path (LSP) from the ingress LER to the egress LER via at least one LSR in response for a request for such an LSP. The path message is transmitted over the path of the LSP to be created, in which the path message comprises a first parameter indicative of the bandwidth to be assigned to data traversing the LSP in a first, downstream, direction from ingress LER to egress LER and a second parameter indicative of the bandwidth to be assigned to data traversing the LSP in an opposite, upstream, direction, in which the upstream and downstream bandwidths are different.

Abstract: A mobile communications network (20) has separation between a user plane (UP) and a control plane (CP). The network comprises plural entities, including plural user plane entities (UPE 23) (comprising the user plane) and plural mobility management entities (MME 25) (comprising the control plane). At least one of the entities is configured to transmit advertisement information. The advertisement information comprises status information and configuration information of the at least one entity. The network further comprises a node or unit (44) configured to use both the advertisement information and the transport information to select a user plane entity for attachment to a wireless station serviced by the network.

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

Abstract: An egress node is proposed for a network domain that comprises at least one ingress node for receiving and routing data units belonging to a plurality of flows into said network domain, a plurality of interior routers for routing said data units through said network domain, and said egress node(s). One or more of the interior routers is arranged to detect whether it is subject to a congestion condition and to congestion mark routed data units if it is subject to said congestion condition. The egress node comprises a control element arranged for performing a congestion handling function that comprises a part for detecting the presence of congestion marked data units arriving at said edge node, and a part for reacting to the detection of the presence of congestion marked data units by invoking a congestion control process.

Abstract: To achieve sophisticated adaptation mechanisms in a packet switched communication environment for service delivery according to the present invention, there is generated descriptor information (LID) on an application level. The descriptor information (LID; 16) describes media stream control options and is provided to the packet switched communication environment prior to media streaming. Also, there is provided a method of controlling media streaming in a network apparatus operated in the communication environment using the descriptor information.

Abstract: A network node for reserving resources for data flows in a communication network. The node detects a request for resource reservation for a new data flow and computes an admission test count based on descriptors of the new data flow and reservation counts, which represent reservation functions of descriptors of previously admitted data flows and which specify resources of the admitted data flows. The new data flow is admitted if the admission test count is smaller than a maximum allowable count. The reservation counts are then updated based on the descriptors of the new data flow. A plurality of admission formulas may thus be used to maintain aggregated reservation counts for data flows, the number of counts being independent from the number of flows.

Abstract: Methods, edge routers and an edge-router-refresh network signalling message used to update state information in edge routers. A data session is established on a path from a source towards a destination connected from the source via a plurality of Autonomous Systems (AS). The edge-router-refresh network signalling message is created by an edge router acting an ingress edge router. The edge-router-refresh network signalling message comprises an identifier of the data session, an identifier of the edge router, which issued the edge-router-refresh message and an indication that the edge-router-refresh message is meant to be used by the edge routers present on the modified path. Optionally, the edge-router-refresh network signalling message further comprises a list of the plurality of AS traversed by the path before the modification.

Abstract: A system a core (104), an edge node (102, 103) and a method are provided for congestion handling in a packet switched network domain. In case of congestion overload is measured, the data packets in proportion to the overload are marked and the signaled overload is stored. At least one egress node (103) receives marked and not marked packets, decodes and counts the overload from the marked packets in a counting interval. Congestion report messages are sent to ingress nodes (102) where flows are terminated. A core node (104) comprises a storage means (314) taking into account the previously signaled overload, which are already being handled in a congestion handling control loop. An edge node (103) comprises means for adding new flows to the set of affected flows, means for identifying affected flows to be terminated so that the number of identified affected flows should generate together traffic equal to the overload, and means for removing flows to be terminated from set of affected flows.