Abstract: According to one aspect of the present disclosure, a method of operating a network node of a communication network is provided, the network node being connected to a downstream network node, and to a non-downstream loop free alternate (LFA) network node comprising a load balancing identifier indicating whether it is allowed to load balance the data packet via a non-downstream LFA net-work node or not; changing, if the load balancing identifier indicates that it is allowed to load balance the data packet via a non-downstream LFA network node, and if the network node decides to load balance the data packet via the non-downstream LFA network node, the load balancing identifier of the data packet such that it indicates that a further load balancing of the data packet via a further non-downstream LFA network node is not allowed; and forwarding the thus modified data packet to the non-downstream LFA network node.

Abstract: A technique for informing nodes in a communications net work about changes in a state of the communications network using notification packets is described. In that technique, the communications network is reconfigured using a fast reroute protocol responsive to the state change. A method aspect of the technique comprises generating, upon a network state change, a notification packet. Generating the notification packet includes adding a unique identifier to the notification packet.

Abstract: There is provided a method for use by a router in a communications network. Forwarding information is maintained (S1) which specifies the next hop node for each of a plurality of possible destination nodes. Update information is maintained (S1) which specifies how, if at all, the next hop nodes specified in the forwarding information are to be updated for a plurality of possible network resource failures. Known failure information is maintained (S1) which relates to a known network resource failure or which specifies that there is no known network resource failure. A failure notification is received (S2) relating to a network resource failure. In response to receipt of the failure notification, it is determined (S3) from the failure notification how, if at all, the known failure information is to be updated, and the known failure information is updated, if required, based on the determination (S4). A communications packet is received (S5).

Abstract: A system for managing congestion within a network domain includes an ingress node, an interior node, and an egress node. The ingress node receives and routes data units entering the network domain. The interior node detects whether a load exceeds one or more load thresholds and generates congestion marked data units. The egress node detects the presence of congestion marked data units and reacts to the detection of the presence of congestion marked data units by invoking a congestion control process.

Abstract: A method forward Ethernet frames at a node in a network supporting an implementation of shortest path bridging (SPB) protocol is disclosed. The method starts with a shortest path computation for the node (referred to as the computing node). The shortest path computation selects at least a shortest path to each destination node in the network, where a neighboring node on the shortest path to reach each node is recorded. Then it computes a downstream loop-free alternate (LFA) node for a destination node, where the LFA node is downstream of the computing node but not on the selected shortest path to the destination node from the computing node. Then when connectivity to the neighboring node on the computed shortest path is detected to be abnormal, the node forwards an Ethernet frame with a destination media access control (MAC) address corresponding to the destination node through the LFA node.

Abstract: A method of allowing a nomadic terminal to access a home network on the Layer 2 level. The method comprises connecting said terminal to a remote access network via an access point, the remote access network being connected to an operator's backbone network via a remote access router. Signalling is exchanged between the access point and an authentication server within the backbone network in order to authenticate the terminal to the authentication server and, following successful authentication, a Layer 2 tunnel extending across the backbone network is established for the purpose of connecting said nomadic terminal to the home network.

Abstract: A technique of processing network traffic that is sent on a tunnel between a first tunnel and a second tunnel node in a communication network is provided.

Abstract: An enhanced fast re-route mechanism provides increased failure coverage to a multicast communication network. If a network node detects a failure and determines that it cannot re-route multicast data, the network node sends a downstream fast notification packet (DFNP) in the network. The DFNP causes a downstream merge node to switch reception of the multicast data to its secondary path. The network node then receives an upstream fast notification packet (UFNP) from the merge node. The network node modifies its forwarding information upon receipt of the UFNP such that the multicast data is to be received by the network node from its downstream via which the UFNP was received. The DFNP and the UFNP cause the multicast data to reverse its flow direction between the network node and the merge node.

Abstract: A method forward Ethernet frames at a node in a network supporting an implementation of shortest path bridging (SPB) protocol is disclosed. The method starts with a shortest path computation for the node (referred to as the computing node). The shortest path computation selects at least a shortest path to each destination node in the network, where a neighboring node on the shortest path to reach each node is recorded. Then it computes a downstream loop-free alternate (LFA) node for a destination node, where the LFA node is downstream of the computing node but not on the selected shortest path to the destination node from the computing node. Then when connectivity to the neighboring node on the computed shortest path is detected to be abnormal, the node forwards an Ethernet frame with a destination media access control (MAC) address corresponding to the destination node through the LFA node.

Abstract: Disclosed is a method of selecting a data source node from a plurality of data source nodes, the selected data source node being used to send data to a data requesting node over a packet data network. The method includes, at an intermediate node of the network, intercepting at least one message sent to or from the data requesting node, the message(s) relating to data source node suitability, determining a cost of communication between the data requesting node and each of the data source nodes to which the message(s) relate, and influencing data source node suitability information sent to the data requesting node to take account of the cost to enable the data requesting node to use the information to select a data source node.

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: A method for adapting the data traffic of a communication between a user equipment and a communication network. The user equipment includes an entity for providing a service associated to the communication. The method includes determining actual operational status information of the service providing entity and creating an usage indicator based on said operational status information. Further the method includes the steps of sending the usage indicator to the communication network and adapting the data traffic of the communication in accordance with the usage indicator. A related user equipment provides the usage indicator to the communication network. A related traffic controller of a communication network adapts the data traffic of a communication between the user equipment and the communication network.

Abstract: A computing device or control plane device functioning as or implementing the functions of a network node in a multi cast communication network. The multi cast communication network includes a multi cast tree to provide connectivity from a common source node to one or more multi cast recipient nodes. The multi cast communication network further includes a set of secondary paths to provide redundancy to the multi cast tree. The computing device executes a plurality of virtual machines for implementing network function virtualization (NFV), wherein a virtual machine from the plurality of virtual machines is configured to implement a method for an enhanced fast re-route mechanism to provide increased failure coverage to the multi cast communication network.

Abstract: The present invention relates to a method for controlling downloading of video segments or segmented video stream to a subscriber client unit, and a subscriber client unit adapted to perform said method. One object of the invention is to guarantee seamless playback and the optimal server load. Said object is by a method and a subscriber client unit that is controlled by a segment selector (SSA) and a server bandwidth control (SBC) algorithm.

Abstract: A method performed by a network node. The method includes detecting a loss of connection at an incoming interface to an upstream neighbor of the network node, where the network node is in a multicast communication network that includes a multicast tree to provide connectivity from a common source node to one or more multicast recipient nodes. The multicast communication network further includes a set of one or more secondary paths to provide redundancy to the multicast tree, and sending a notification packet downstream toward the one or more multicast recipient nodes when the network node cannot re-route the multicast data traffic to allow the multicast data traffic to be received by the multicast recipient nodes, wherein the notification packet causes one or more downstream nodes to switch multicast reception to one or more of the set of one or more secondary paths to re-route the multicast data traffic.

Abstract: A method is implemented by a network element or controller for determining a backup path for a fast reroute process to be utilized in response to a network event invalidating a primary path to a destination node. The method identifies at least one intermediate node that has a backup loop free alternative (LFA) path to a destination node in a network where no path meeting LFA conditions can be found for a point of local repair (PLR).

Abstract: An upstream activation mechanism provides enhancements to PIM-SM based fast re-route in a multicast communication network, where secondary paths provides redundancy to a multicast tree and are on standby to reduce bandwidth usage when there is no failure in the network. Upon receiving an indication of a loss of connection to the primary path of the multicast tree network, a network node that has a failure-free secondary path to a common source node of the multicast tree sends an activation packet upstream toward the common source node via the failure-free secondary path. The activation packet causes one or more upstream nodes to unblock their respective outgoing interfaces to thereby activate transmission of the multicast data traffic on the failure-free secondary path.

Abstract: An enhanced fast re-route mechanism provides increased failure coverage to a multicast communication network. If a network node detects a failure and determines that it cannot re-route multicast data, the network node sends a downstream fast notification packet (DFNP) in the network. The DFNP causes a downstream merge node to switch reception of the multicast data to its secondary path. The network node then receives an upstream fast notification packet (UFNP) from the merge node. The network node modifies its forwarding information upon receipt of the UFNP such that the multicast data is to be received by the network node from its downstream via which the UFNP was received. The DFNP and the UFNP cause the multicast data to reverse its flow direction between the network node and the merge node.

Abstract: A method is described to be implemented by a node in a network. The method is for selecting an endpoint for a maximally redundant tree-fast reroute (MRT-FRR) detour path to optimize detour path cost or length across the network. The method defines a set of steps including selecting a destination node and next hop failure to calculate detour paths. A clean set of nodes for the network is then calculated, where the clean set of nodes are nodes in the network that are not impacted in reaching the destination node by the failure in the given next hop. A candidate node for the endpoint of the detour p path is selected from the set of clean nodes based on any one of a plurality of configured options and forwarding of data packets is configured to the selected candidate as the endpoint of the detour path to the destination node.

Abstract: A method supports incremental deployment of maximally redundant trees-fast reroute (MRT-FRR) by supporting MRT-FRR within an island of nodes in the network. A destination node and next hop failure selected to calculate detour paths. The clean set of nodes is calculated. The clean set of nodes is expanded with extended island candidate nodes that are reachable by a border node within the island via shortest path first (SPF) to the destination node that does not pass through the failed next hop. The extended island candidate nodes that are reachable by the border node within the island via SPF are part of an extended island. An MRT is calculated for each extended island candidate node. A candidate node is selected from the clean set of nodes according to a configured optimization option to serve as the endpoint of detour path to a destination node.