Abstract: A network function virtualization (NFV) orchestration manager utilizes characteristics of the particular host, such as the platform itself, the hypervisor and the network interface to determine virtual network function (VNF) deployment. Exemplary platform characteristics are latency, throughput, scalability and migration. Factors are developed for each characteristic to provide positive or negative values used in the determination so that each host receives values for each characteristic. Each VNF is associated with desirable characteristics. When a VNF is to be deployed, the NVF orchestration manager determines the host factors relevant to the VNF. After analyzing the hosts and comparing them to the VNF requirements, a host choice is determined and the VNF is deployed to that host, with a virtual machine (VM) being created if needed. In a similar manner, VNFs can be chosen for inclusion in a service function chain (SFC).

Abstract: A network function virtualization (NFV) orchestration manager utilizes characteristics of the particular host, such as the platform itself, the hypervisor and the network interface to determine virtual network function (VNF) deployment. Exemplary platform characteristics are latency, throughput, scalability and migration. Factors are developed for each characteristic to provide positive or negative values used in the determination so that each host receives values for each characteristic. Each VNF is associated with desirable characteristics. When a VNF is to be deployed, the NVF orchestration manager determines the host factors relevant to the VNF. After analyzing the hosts and comparing them to the VNF requirements, a host choice is determined and the VNF is deployed to that host, with a virtual machine (VM) being created if needed. In a similar manner, VNFs can be chosen for inclusion in a service function chain (SFC).

Abstract: A network device is described that receives information from separate database systems including a physical network inventory system that stores first topology data specifying resources and links within a network and a traffic engineering system that stores second topology data specifying the resources and links that are deployed within the network and data specifying traffic engineered paths configured to forward network traffic through the network. The network device aggregates the received information into a topology resource management system that stores third topology data specifying at least a current role of each of the resources and links. The network device determines a modification to at least one of the traffic engineered paths based on the third topology data, including an adjustment to the current role of at least one of the resources to change the forwarding of the network traffic. The network device outputs provisioning information based on the modification.

Abstract: In general, techniques are described for improving network path computation for requested paths that include a chain of service points that provide network services to traffic flows traversing the requested path through a network along the service chain. In some examples, a controller network device receives a request for network connectivity between a service entry point and a service exit point for a service chain for application to packet flows associated to the service chain. The device, for each pair of the service points in the particular order and using the active topology information, computes at least one end-to-end sub-path through the sub-network connecting the pair of the service points according to a constraint and computes, using the at least one end-to-end sub-path for each pair of the service points, a service path between the service entry point and the service exit point for the service chain.

Abstract: A centralized controller provides dynamic end-to-end network path setup across multiple network layers. In particular, the centralized controller manages end-to-end network path setup that provisions a path at both the transport network layer (e.g., optical) and the service network layer (e.g., IP/MPLS). The centralized controller performs path computation for an optical path at the transport network layer and for a path at the service network layer that transports network traffic on the underlying optical transport path, based on information obtained by the centralized controller from the underlying network components at both layers.

Abstract: In general, techniques are described for improving network path computation for requested paths that include a chain of service points that provide network services to traffic flows traversing the requested path through a network along the service chain. In some examples, a controller network device receives a request for network connectivity between a service entry point and a service exit point for a service chain for application to packet flows associated to the service chain. The device, for each pair of the service points in the particular order and using the active topology information, computes at least one end-to-end sub-path through the sub-network connecting the pair of the service points according to a constraint and computes, using the at least one end-to-end sub-path for each pair of the service points, a service path between the service entry point and the service exit point for the service chain.

Abstract: A centralized controller provides dynamic end-to-end network path setup across multiple network layers. In particular, the centralized controller manages end-to-end network path setup that provisions a path at both the transport network layer (e.g., optical) and the service network layer (e.g., IP/MPLS). The centralized controller performs path computation for an optical path at the transport network layer and for a path at the service network layer that transports network traffic on the underlying optical transport path, based on information obtained by the centralized controller from the underlying network components at both layers.

Abstract: In one embodiment, a method includes receiving, by a provider edge (PE) device, a transport layer status message indicative of a defect on a pseudowire (PW) running across a core of a service provider (SP) network. The status message is translated to a service layer message indicative of the defect. The service layer message is then transmitted across an access domain of the SP network.

Abstract: Optimal automated exploration of hierarchical Multiprotocol Label Switching Label Switch Paths (MPLS LSPs) is disclosed. A path verification message (PVM) is transmitted from an initial router. Each label in the PVM's label stack corresponds to a hierarchy layer and is associated with a time-to-live (TTL) field. The TTL field for the label of a current layer is set so the PVM travels one hop from the initial router. In response, a reply message indicating that the PVM reached its destination is received.

Abstract: Improved detection of specific BFD LSP path failures is herein disclosed. The improved detection described herein allow for faster fault isolation of a failure along a LSP path, which in turn may allow for faster repair of the failure. When opening a BFD session with a LSP egress node, the LSP ingress node provides the LSP egress node a path descriptor along with the BFD Discriminator. If a BFD failure is detected at the LSP egress node, the LSP egress node can signal an alarm that includes a full description of the path.

Abstract: Improved connectivity verification is disclosed. A root in a point-to-multipoint network can establish parameters for a connectivity-verification session with each endpoint in the network. The root then sends verification-request messages to each endpoint in accordance with the parameters. Each endpoint signals an alarm (e.g., sends a reply to the root) if the verification-request messages are not received at the endpoint in accordance with the established parameters. In this manner, endpoints send verification-reply messages to the root much less frequently, greatly reducing the congestion at the root and greatly reducing the chance that the root gets congested or even overwhelmed when the network includes large numbers of endpoints.

Abstract: A pseudowire verification framework gathers and maintains status of individual pseudowires by aggregating the state of the individual node hops defining the pseudowire. The framework provides complete assessment of a network by gathering status feedback from network nodes (forwarding entities) that are inaccessible directly from a requesting node by employing an intermediate forwarding entity as a proxy for inquiring on behalf of the requesting node. Therefore, status regarding inaccessible pseudowires is obtainable indirectly from nodes able to “see” the particular pseudowire. Configurations further assess multihop pseudowires including a plurality of network segments; in which each segment defines a pseudowire hop including forwarding entities along the pseudowire path. In this manner, pseudowire health and status is gathered and interrogated for nodes (forwarding) entities unable to directly query the subject pseudowire via intermediate forwarding entities.

Abstract: Optimal automated exploration of hierarchical MPLS LSPs is disclosed. A path verification message (PVM) is transmitted from an initial router. Each label in the PVM's label stack corresponds to a hierarchy layer and is associated with a time-to-live (TTL) field. The TTL field for the label of a current layer is set so the PVM travels one hop from the initial router. In response, a reply message indicating that the PVM reached its destination is received. These steps are then repeated. For each successive PVM transmitted, the TTL field associated with a label corresponding to the current hierarchy layer is incremented. For any reply message including information describing a non-current layer, modify the next PVM's label stack and increment the TTL field of the label for the described different layer; any other TTL fields are unchanged. If any received reply message indicates a destination router was reached, the process terminates.

Abstract: A mechanism for ASBRs to identify the originating node, or router, in an LSP conversant autonomous system (AS), such as an MPLS VPN environment, maintains the identity of the originating node and successive nodes in subsequent autonomous systems along the path to the node to be pinged. The identity of the transporting nodes is stored in a stack or other object associated with the ping request (ping), such that the pinged node may employ the stored identity as a set of return path routing information. Successive ASBRs store their identity on the stack, in an ordered manner, along the path to the destination. Upon reaching the destination (ping) node, the destination node employs the identity of the first node on the stack to send the acknowledgment, or ping response. Each successive ASBR, therefore, pops (retrieves) the next node identity from the stack and redirects (sends) the ping response to the retrieved node.

Abstract: A method of diagnosing a fault in a network path comprises the steps, performed at a diagnosing node, of initiating a path discovery test. The diagnosing node receives at least one path discovery test response and identifies the diagnosable node on the network path from a path discovery test response. The diagnosing node remotely accesses said diagnosable node and performs a diagnostic routine at said diagnosable node.

Abstract: A system identifies a plurality of probes used for verifying network operation, and classifies the plurality of probes into probe groups, according to at least one parameter associated with the network operation. The system schedules operation of the probe group in accordance with a classification associated with each probe group, and operates the probe group to verify network operation.

Abstract: A system receives a packet at a router, and pushes a label onto a label stack. The label stack is associated with the packet. The system provides a forwarding record containing label bindings for the router, and transmits the forwarding record to a collector. A system receives a forwarding record from a router. The system compares a first record entry type of the forwarding record with a second record entry type of the forwarding record to determine the traffic flow in the network. The system then maps the traffic flow in the network, based on a result of the comparing.

Abstract: To reveal link bundles' component links in an MPLS network, transmit a sequence of request and reply packets. For a router receiving a request packet, the packet identifies that link bundles should be revealed, detect the link bundle links connected to the router, and for each, its component links are added to a downstream mapping field (DMF). A link bundle mapping field (LBMF) is also added to the request packet. Each LBMF specifies the component links of that link bundle by pointing to the component links added to the DMF. For a router responding to a request packet with a reply packet, determine if any links in the DMF are component links, and for each, identify a LBMF containing information regarding that link. Each component link in the DMF is processed. The component links in each LBMF are iterated through to ensure each matches the determined links in the DMF.

Abstract: Conventional network packet traffic loss/drop monitoring mechanisms, such as that employed for pseudowire, IP flow and tunnel traffic monitoring, do not process or diagnose the aggregate counts from both endpoints of a particular pseudowire. A packet loss and detection mechanism periodically exchanges traffic packet counts to maintain an accurate diagnosis of the pseudowire health from either endpoint. Further, the raw packet counts are analyzed to identify misrouted and lost packets, as both should be considered to assess network health and congestion. The pseudowire statistics are maintained for each pseudowire emanating from a particular edge router, providing a complete view of pseudowire traffic affecting a particular edge router. Such statistics are beneficial for problem detection, diagnosis, and for verification of throughput criteria such as those expressed in Quality of Service (QOS) terms and/or SLAs (service level agreements).

Abstract: Systems and methods for assuring consistency between MPLS forwarding and control planes. The control plane can be made aware of forwarding plane anomalies and can respond appropriately. One particular application is assuring consistency between forwarding and control planes of a Fast Reroute backup tunnels used to protect an MPLS Traffic Engineering LSP from a link and/or a node failure. When a backup tunnel forwarding failure is detected, the control plane can react by, for example, rerouting the backup tunnel and/or sending a notification to the operator or head-end of the protected Traffic Engineering LSP.