In one embodiment, a primary tunnel is established from a head-end node to a destination along a path including one or more protected network elements for which a fast reroute path is available to pass traffic around the one or more network elements in the event of their failure. A first path quality measures path quality prior to failure of the one or more protected network elements. A second path quality measures path quality subsequent to failure of the one or more protected network elements, while the fast reroute path is being used to pass traffic of the primary tunnel. A determination is made whether to reestablish the primary tunnel over a new path that does not include the one or more failed protected network elements, or to continue to utilize the path with the fast reroute path, in response to a difference between the first path quality and the second path quality.

A device may identify a plurality of first values associated with network traffic of a label-switched path of a plurality of label-switched paths. The device may determine an adjustment policy based on the plurality of first values. The adjustment policy may include one or more factors associated with a plurality of second values. The plurality of second values may be determined based on the plurality of first values. The device may implement the adjustment policy in association with the label-switched path. A bandwidth reservation of the label-switched path may be adjusted based on the adjustment policy. The adjustment policy may be implemented for fewer than all of the plurality of label-switched paths.

Techniques are described for automatic discovery of two or more virtual service instances configured to apply a given service to a packet in a software-defined networking (SDN)/network functions virtualization (NFV) environment. Virtual service instances may be deployed as virtual entities hosted on one or more physical devices to offer individual services or chains of services from a service provider. The use of virtual service instances enables automatic scaling of the services on-demand. The techniques of this disclosure enable automatic discovery by a gateway network device of virtual service instances for a given service as load balancing entities. According to the techniques, the gateway network device automatically updates a load balancing group for the given service to include the discovered virtual service instances on which to load balance traffic for the service. In this way, the disclosed techniques provide auto-scaling and auto-discovery of services in an SDN/NFV environment.

In general, techniques described are for bandwidth sharing between resource reservation protocol label switched paths (LSPs) and non-resource reservation protocol LSPs. For example, in networks where resource reservation protocol LSPs and non-resource reservation protocol LSPs co-exist within the same domain, resource reservation protocol LSPs and non-resource reservation protocol LSPs may share link bandwidth. However, when non-resource reservation protocol LSPs are provisioned, resource reservation protocol path computation elements computing resource reservation protocol paths may not account for non-resource reservation protocol LSP bandwidth utilization. The techniques described herein provide a mechanism for automatically updating traffic engineering database (TED) information about resource reservation protocol LSPs in a way that accounts for non-resource reservation protocol LSP traffic flow statistics, such as bandwidth utilization. Path computation elements may thus rely on an accurate TED for LSP path computation.

Presented herein are techniques performed in a network comprising a plurality of network nodes each configured to apply one or more service functions to traffic that passes the respective network nodes in a service path. At a network node, an indication is received of a failure or degradation of one or more service functions or applications applied to traffic at the network node. Data descriptive of the failure or degradation is generated. A previous service hop network node at which a service function or application was applied to traffic in the service path is determined. The data descriptive of the failure or degradation is communicated to the previous service hop network node.

A computer implemented method and system comprising receiving a data packet from a network source, extracting source and destination data from the received data packet, determining a user from the extracted source and destination data from the received data packet. If a label does not exist for the extracted source and destination data from the received data packet, creating a label for the data packet, the label comprising the extracted source data and historic source data for the determined user, calling a chaotic function with the label for the received data packet. If the chaotic function returns false, calling an alternative function for an output with the label for the received data packet. If the chaotic function returns true, capturing the output of the chaotic function, and updating the label with the output of the chaotic function or with the output of the alternative function.

The present disclosure relates to multi-MAC controllers and single PHY systems and methods. An example method may include receiving, at a remote PHY device and from a first MAC device located at a headend of a network, a first data packet, including a first identifier. The example method may also include determining, by the remote PHY device and using the first identifier included in the first data packet, a first output of the PHY device onto which to transmit the first data packet, the first output including a first group of customer devices. The example method may also include receiving, at the remote PHY device and from a second MAC device located at the headend, a second data packet, including a second identifier. The example method may also include determining, by the remote PHY device and using the second identifier included in the second data packet, a second output of the PHY device onto which to transmit the second data packet, the second output including a second group of customer devices.

The present disclosure discloses a message transmission method, including: carrying a routing label and segment list information in a message, and transmitting the routing label and the segment list information along with the message in a message transmission process; the routing label being used for indicating that the message carries the segment list information, and the segment list information being used for representing a transmission path of the message. The present disclosure further discloses four nodes, two path management servers and a storage medium at the same time.

A method for communication includes configuring a router to forward data packets over a network in accordance with Multiprotocol Label Switching (MPLS) labels appended to the data packets. At least first and second entries, corresponding to respective first and second labels, are stored in a Next Hop Label Forwarding Entry (NHLFE) table in the router, such that each of the first entries contains a respective pointer to at least one of the second entries. Upon receiving in the router a data packet from the network, a first entry is selected from among the first entries in the NHLFE table and, responsively to the pointer in the first entry, a second entry is selected. The respective first and second labels from the selected first and second entries are pushed onto an MPLS label stack of the data packet.

A method is provided in one embodiment and includes receiving at a network element an encapsulated packet and determining whether both an ECMP/LAG Existing (“ele”) flag and an Entropy Label Capability (“elc”) flag are set for an egress node of the packet in a Label Distribution Protocol (“LDP”) database of the network element. If both the ele and elc flags are set for the egress node of the packet in the LDP database, the method further includes determining whether the network element is an ingress node for the packet and, if the network element is the ingress node for the packet, pushing an Entropy Label (“EL”) and an Entropy Label Indicator (“ELI”) onto an MPLS stack of the packet.