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: A technique for controlling network routing in a network (100) is provided. The network (100) includes a first end node (102) and a second end note (104). The end nodes are connectable along a first routing path (106) by at least one link (113). The network (100) further provides a second routing path (108) including the first end node (102) and the second end nodes (104). As to a method aspect of the technique, one or more queues (402) are provided. Each of the queues (402) serves at least one tunnel (Tunnel—1; Tunnel—2) along the first routing path (106). A switching of the tunnel (Tunnel—1) to the second routing path (108) is triggered based on a combination of two pieces of information. A piece of information includes information as to a queue build-up at the queue (504) serving the tunnel (Tunnel—1). Another piece of information includes information as to a capacity of the link (113) of the first routing path (106).

Abstract: A technique for routing data frames in a telecommunications backhaul network (100) is provided. The telecommunication backhaul network (100) includes a plurality of points and links between the points so that at least two different routes for communicating data frames between a pair of end points is provided. A first end point (102) routes data frames that belong to a communication tunnel between the first end point and second end point (104) on a first route (106), which includes one or more intermediate points (100). At least some of the data frames include a continuity check message. The first end point reroutes data frames belonging to the communication tunnel to a second route that is different from the first route (106), if certain data frames including the continuity check message are lost in the network (100). As to a method aspect of the technique, at least one of the links of the first route are switched to a reduced link capacity.

Abstract: A method is presented of transporting data packets over a telecommunications transport network. The data packets are carried by a plurality of bearers. For each of the bearers, independently of the other bearers, bandwidth profiling is applied to the data packets of the bearer to designate as ‘green’ data packets that are conformant with a predetermined maximum Information Rate for the bearer. One or more data packets is buffered for up to a predetermined maximum ‘green’ buffer time, during which if transporting the data packet would not cause the maximum information rate of the bearer to be exceeded, the data packet is designated as a ‘green’ data packet. The data packets are forwarded for transporting over the transport network. If there is insufficient bandwidth available in the transport network to transport all data packets, data packets that are not designated as ‘green’ data packets are discarded, so as not to be transported through the transport network.

Abstract: A method of prioritising packets for delivery over a transport network interconnecting nodes of a mobile network, where a guaranteed minimum information rate over the transport network is specified for the mobile network. The method comprises, for each bearer to be injected into the transport network from the mobile network, specifying a bearer information rate and marking packets up to that rate as conformant with the bearer information rate and marking packets exceeding that rate as non-conformant with the bearer information rate. A plurality of traffic type streams from the mobile network are converged, each traffic type stream comprising a plurality of bearers. Packets of the converged traffic type streams are inspected to identify packets marked as conformant and non-conformant, and re-marking non-conformant packets, or at least a fraction of non-conformant packets, as conformant if the converged rate of conformant packets is less than said minimum information rate.

Abstract: A method of updating conversation allocation in link aggregation is disclosed. The method starts with verifying that an implementation of a conversation-sensitive link aggregation control protocol (LACP) is operational at a network device of a network for an aggregation port. Then it is determined that operations through enhanced link aggregation control protocol data units (LACPDUs) are possible. The enhanced LACPDUs can be used for updating conversation allocation information, and the determination is based at least partially on a compatibility check between a first set of operational parameters of the network device and a second set of operational parameters of a partner network device. Then a conversation allocation state of an aggregation port of the link aggregation group is updated based on a determination that the conversation allocation state is incorrect, where the conversation allocation state indicates a list of conversations transmitting through the aggregation port.

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: The present disclosure provides a technique for ensuring that a service or conversation is carried in a congruent manner on a Link Aggregation Group (LAG). The Service ID (e.g., conversation ID) to link mapping is configured on both sides of the LAG independently of each other. The Service ID to link assignment is stored in a well-defined format, e.g. in an assignment table. A digest is then prepared on the assignment table. The digest is exchanged between the two sides of the LAG. If there is a mismatch between the digests, then the service is transmitted on a predefined and agreed-upon default link if congruency has to be enforced for that particular service. Furthermore, the digest exchange allows verification on the configuration to check whether all services to be handed-off are configured on both sides.

Abstract: An upgraded edge node (e.g., enhanced PBB edge node, enhanced IP/MPLS edge node) and a method are described herein for providing a VLAN service for a customer in a metro network. In addition, a metro network is described herein which includes the upgraded edge nodes, traditional PB edge nodes, and a PB domain that has PB core nodes located therein.

Abstract: A method is provided for transporting data packets over a telecommunications transport network. The data packets are carried by a plurality of bearers, the bearers each carrying data packets that relate to different ones of a plurality of services. In the method a multi-level bandwidth profiling scheme is applied to the data packets of each bearer. A series of information rates are assigned to a bearer, the profiling scheme identifying and marking each data packet of the bearer based on a desired resource sharing according to the minimum information rate with which the packet is conformant. The marked data packets are forwarded for transport through the transport network. If there is insufficient bandwidth available in the transport network to transport all data packets, data packets identified by the profiling and marked as only being conformant with a higher information rate are discarded before any data packets marked as being conformant with a lower information rate.

Abstract: The present disclosure relates to a technique for forwarding frames received by a network interconnect node (114) of an internal network (112) having the network interconnect node (114), one or more internal network nodes (118, 120) and one or more other internal network interconnect nodes (116), the network interconnect node (114) having a network interconnect interface for communicating with an external network interconnect node (104) of an external network (102) and a network interface for communicating with one or more of the other internal network interconnect nodes (116) and with one or more of the internal network nodes (118, 120), wherein the frames are related to a service provided by at least one of the external network (102) and the internal network (112).

Abstract: Methods and apparatus are disclosed for applying multiple Link Aggregation Group (LAG) entities on the same set of physical links, thus making bundling of individual services or conversations possible by the different LAG entities within Link Aggregation. Each LAG entity is configured such that a single physical link is Active and all the other links are Standby. Each LAG entity may be regarded as a “bundle.” Thus the services/conversations are bundled into a LAG entity and are handed-off on the Active link during normal operation. If service hand-off is not possible on the Active link (e.g., due to a failure), then the LAG entity switches over to a Standby link thus the service/conversation is handed-off on that formerly Standby link. Bundling may simplify operations of control and signaling.

Abstract: A system and method for in-service migration for a Virtual Local Area Network, VLAN, service if a Provider Bridge Metro Ethernet Network, PB MEN, is upgraded to a Provider Backbone Bridge, PBB, MEN or an Internet Protocol/Multi Protocol Label Switching, IP/MPLS, MEN. After the deployment of the new PBB or IP/MPLS technology, a sequence of management actions are performed to configure PBB or IP/MPLS edge nodes to use the new technology as well as the old PB-based technology to support the VLAN service. Both old and new connectivity structures are maintained in the edge nodes during the entire migration process. Customer traffic is then redirected per edge node to the new technology. When each edge node entirely provides the VLAN service under the new technology, the migration is complete.

Abstract: A method and network are described herein for provisioning Operations, Administration, and Maintenance (OAM) entities for a connection when setting-up the connection between an ingress edge node and an egress edge 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 and network are described herein for provisioning Operations, Administration, and Maintenance (OAM) entities for a connection when setting-up the connection between an ingress edge node and an egress edge node.

Abstract: A method and network are described herein for provisioning Operations, Administration, and Maintenance (OAM) entities for a connection when setting-up the connection between an ingress edge node and an egress edge node.

Abstract: A method for determining the capacity that is needed on an lub link to fulfill Grade of Service (GoS) requirements in a Universal Mobile Telecommunications System (UMTS) Terrestrial Radio Access Network (UTRAN) for both Dedicated Channel (DCH) traffic and High-Speed Downlink Packet Access (HSDPA) traffic. The method includes determining the bandwidth demand of the HSDPA traffic (ElasticDim); calculating an average bandwidth of the DCH traffic on the lub interface (BW use,avg); setting an initial capacity (Capacity) to the capacity need of the DCH traffic (Capacity DCH), wherein at least the initial capacity will be provided for the DCH traffic in the dimensioned system; and, increasing the value of Capacity until a quality requirement of the HSDPA traffic is fulfilled, the maximum value of Capacity reached being the capacity that is needed for DCH and HSDPA traffic for the lub interface.

Abstract: A method of configuring link-scope-type managed objects in IP-based networks from a centralized management node. An IP-based network includes at least one management station, a set of network nodes, and communication links between the network nodes and between the management station and the network nodes. Preferably, an Open Shortest Path First (OSPF) topology graph of the network is prepared, and a set of target links to be configured is identified. The target links are then classified into N disjoint subsets, T1-TN. The links in each subset are then configured in parallel, starting with subset T1 and sequentially handling each subset one-by-one. The target links may be classified by removing non-target links that are not to be configured from the OSPF topology graph, building a LinkGraph to determine the dependencies between the links remaining in the OSPF topology graph, and building a LinkTree from the LinkGraph to classify the target links into the subsets based upon the dependencies between the links.