Abstract: The invention refers to operating a first node of a communication network comprising a plurality of nodes which are interconnected by communication links and wherein data traffic is provided over the communication links to provide a data stream to the nodes, wherein the first node (15) performs the steps of: detecting a data traffic interruption with respect to a second node (16), determining, if the data traffic is still received, and forwarding the data traffic to the second node (16) if the first node (15) receives the data traffic, and otherwise notifying a third node (17) of the plurality of network nodes about the data traffic interruption.

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 of routing packets across a packet switched network domain, comprising a multiplicity of nodes. Each node comprises an ingress interface and an egress interface. For each destination node a default and a detour branching are defined, each specifying a route to the destination node. For each two-edge connected node the default and detour branchings do not share a common ingress interface.

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 system, method, and node for implementing lightweight Not-via Internet Protocol fast reroutes of a packet in a telecommunications network between a first node and a destination node. The method determines a shortest path between the first node and the destination node and two redundant trees between the first node and the destination node. Each redundant tree provides an alternate path from the first node and the destination node. When a failure in a link between the first node and the destination node is detected, the packet is forwarded to the destination node via a first redundant tree, and if not available, via a second redundant tree. If the second redundant tree is not available, the packet is dropped. If no failure in the link between the first node and the destination node is detected, the packet is sent via the determined shortest path to the destination node.

Abstract: A method of managing quality of service in an IP network is provided. The method comprises identifying, at an egress edge node of the network, that congestion is present in one or more routers within the network. Data flows for termination to remove the congestion are selected. At least one flow termination notification is sent from the egress edge node to an ingress edge node of the network, the at least one flow termination notification identifying the selected data flows. Low priority flows from the selected data flows are terminated at the ingress edge node immediately. High priority flows are terminated only if congestion is still present after a predetermined delay period. The delay may be applied in the ingress edge node or the egress edge node. The invention also provides a method for admitting low priority flows into the network only if the network has resources available for a number of high priority flows above a dynamically determined threshold.

Abstract: In an access network, a tunnel gateway (TGW) managed network caching architecture is proposed. The proposed TGW receives a terminal request directed to a data server for a flow of data. The terminal request is forwarded to the TGW through a tunnel from a tunnel endpoint located below the TGW. The TGW selects a network cache to handle the data traffic of the flow requested by the requesting terminal. The TGW then redirects the terminal request to the selected network cache to provide the requested service. The TGW redirects the terminal request through a tunnel whose endpoint is the selected network cache.

Abstract: A method for setting up a VPN is described. The VPN is set up in a backbone network having a plurality of PE routers for controlling the transfer of IP traffic to and from CE routers in satellite networks. In a PE router, a VRF is configured for the VPN and populated with local routes for the VPN. A VRF IP loopback address is assigned for the VRF, and a PE IP loopback address is assigned for the ingress PE router. A local route with the VRF and PE IP loopback addresses is then advertised to other PE routers in the backbone network.

Abstract: A system and a method are described herein which provide for congestion handling in a packet switched network domain. In case of congestion overload is measured by a core node, the data packets in proportion to the overload are marked and the signaled overload is stored. At least one egress node 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 where flows are terminated.

Abstract: A method is provided of reducing traffic in or relating to a service provider network. The service provider network comprises a core packet network, a plurality of first access points (6) off the core network to an external packet network (7), and a plurality of second access points (4) off the core network to local subscribers. A cache (T1, T2) is provided at each of the access points (6, 4) for caching content passing through. In response to a request received from the external network (7) at any of the first access points (6) for content from a local subscriber, it is attempted to serve the request from content previously cached at that first access point (6) or another of the first access points (6). If unable to serve the request from any of the first access point caches (T1), it is attempted to serve the request from content previously cached at the second access point (4) serving the local subscriber.

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 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: The present invention relates to a solution for handling mobility and attachment of users in a wireless communication network (10). User equipment (1) is connected logically to an attachment node (14) at initial attachment and this attachment is determined from an analysis of stored historical mobility patterns of the user equipment. For instance, a mobility management device may be responsible for handling the attachment and for handling the determination of suitable attachment node, e.g. a gateway (5, 7, 8).

Abstract: Method and apparatus for controlling the routing of data packets in an IP network (200). A DNS system (202) stores a packet admission policy configured for a first end-host (B) that dictates conditions for allowing other end-hosts to get across data packets to the first end-host or not. A routing voucher is defined which is required for routing data packets to the first end-host. The routing voucher is distributed to routers (R) in the IP network. When an address query is received at the DNS system (202) from a second end-host, the voucher is supplied to the second end-host if the configured policy allows the second end-host to convey data packets. Otherwise, the voucher is not supplied. If allowed, the second end-host will add the routing voucher to any data packets directed to the first end-host. When a valid routing voucher is present in a packet at a router (204) in the network, the packet will be forwarded to the next router in the IP network. The router will otherwise discard the packet.

Abstract: A failure detection mechanism provides enhancements to PIM-SM based fast re-route techniques. A network node upon detecting a loss of connection determines whether it can re-route multicast data traffic. If the network node does not have a failure-free secondary path, it can originate a notification packet and send it to the downstream parts of a multicast tree. The notification packet can trigger one or more downstream nodes to switch-over to redundant secondary paths to re-route the multicast data traffic.

Abstract: A technique of operating a network node of a multicast communication network comprising a plurality of network nodes which are interconnected with each other by communication links is provided, wherein the network node is associate with a common source network node. A method implementation of the technique comprises: determining a first path which connects the network node to the common source network node along a primary network tree, and determining a second path which connects the network node to the common source network node along a secondary network tree, wherein the first path and the second path show redundancy with respect to each other; receiving, at the network node, multicast data from the common source network node via the first path; triggering, by the network node, reception of multicast data from the common source network node via the second path if the network node detects a failure of the first path (e.g., determines that no multicast data is received via the first path).

Abstract: A failure detection mechanism provides enhancements to PIM-SM based fast re-route techniques. A network node upon detecting a loss of connection determines whether it can re-route multicast data traffic. If the network node does not have a failure-free secondary path, it can originate a notification packet and send it to the downstream parts of a multicast tree. The notification packet can trigger one or more downstream nodes to switch-over to redundant secondary paths to re-route the multicast data traffic.

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