摘要:
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. It is emphasized that this abstract is provided to comply with the rules requiring an abstract that will allow a searcher or other reader to quickly ascertain the subject matter of the technical disclosure.
摘要:
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.
摘要:
A method and computer system for auto-routing of multi-hop pseudowires is presented. A first Provider Edge (PE) device receives an advertisement from a layer 2 (L2) capable network device, the advertisement including routing state for reaching the L2 device. A first Border Gateway Protocol (BGP) table is populated with the routing state for the L2 capable network device which is reachable by way of an address family reserved for L2 end point reachability information. The first PE device advertises the first BGP table information within a first Service Provider (SP) network such that a multi-hop Pseudowire is capable of being established which includes the L2 capable device.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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).
摘要:
A traceroute mechanism enables responses to the traceroute to reach the originating router (originator) along a multihop pseudowire (PW). A traceroute message includes an accumulator operable to count hops along a MH-PW, implemented as a time-to-live (TTL) field, as is known in the art. An originator router employs multiple TTL values, and decrements one of the TTL “accumulators” for each hop. At the ultimate (terminal) router defining the end of the multihop PW, a TTL in the return message is set to the number of hops traveled by the traceroute. The difference between the accumulator and the initial TTL value determines the number of hops traveled by the traceroute message, and hence the number of hops back to the originating node. The traceroute return message, now having a TTL set to the number of hops of the counterpart traceroute, reaches the originator when the TTL value is decremented to zero.