Abstract:
In one embodiment, a source transmits one or more data packets to a destination over a primary pseudowire (PW). When a device on the primary PW detects a downstream failure of the primary PW, and in response to receiving one or more data packets from a source from the failed primary PW, the device adds a loopback packet identifier to the one or more received data packets, and returns the one or more data packets with the loopback packet identifier to the source upstream on the primary PW. Accordingly, in response to receiving the data packet returned with a loopback packet identifier from the primary PW (in response to the downstream failure), the source retransmits the one or more data packets to the destination over a backup PW.
Abstract:
A system and method for advertising out-of-resources (OOR) conditions for entities, such as nodes, line cards and data links, in a manner that does not involve using a maximum cost to indicate the entity is “out-of-resources.” According to the technique, an OOR condition for an entity is advertised in one or more type-length-value (TLV) objects contained in an advertisement message. The advertisement message is flooded to nodes on a data network to inform them of the entity's OOR condition. Head-end nodes that process the advertisement message may use information contained in the TLV object to determine a path for a new label switched path (LSP) that does not include the entity associated with the OOR condition.
Abstract:
A method is described and in one embodiment includes receiving a packet of a traffic flow at an ingress node of a communications network; routing the packet to an egress node of the communications network via a first path comprising a tunnel if the packet was received from a node external to the communications network; and routing the packet to the egress node of the communications network via a second path that does not traverse the tunnel if the packet was received from a node internal to the communications network. The first path is identified by a first Forwarding Information Base (“FIB”) entry corresponding to the flow and the second path is identified by a second FIB entry corresponding to the flow.
Abstract:
First data indicative of information that a packet is part of a DDoS attack is received at a management network device. A DDoS remediation network device to be used for remediation of packets associated with the DDoS attack is determined from the first data. Second data, indicative of the DDoS attack and indicative of the DDoS remediation network device, is transmitted from the management network device to an edge network device. The second data is configured to cause the edge network device to route packets associated with the DDoS attack to the DDoS remediation network device.
Abstract:
A method for teleprotection over a segment routed network comprises receiving network requirements for communication between a first teleprotection relay and a second teleprotection relay, the first teleprotection relay associated with a first router of the segment routed network, and the second teleprotection relay associated with a second router of the segment routed network, identifying a primary path from the first router to the second router satisfying the network requirements, determining a congruent reverse of the primary path satisfies the network requirements, sending, to the first router, the primary path, the first router routing traffic from the first teleprotection relay to the second teleprotection relay using the primary path, and sending, to the second router, the congruent reverse of the primary path, the second router routing traffic from the second teleprotection relay to the first teleprotection relay using the congruent reverse of the primary path.
Abstract:
Particular embodiments described herein provide for a communication system that can be configured to identify a system that includes network traffic, where at least a portion of the network traffic includes packets, at least a portion of the packets include a stack, and at least a portion of each stack includes one or more previously allocated labels. The communication system can further be configured to determine a synonymous label that triggers an action and to replace a label from the one of the one or more previously allocated labels in a specific stack of a specific packet with the synonymous label. In an example, the synonymous label can be used to identify a subset of packets in the network traffic or a source of the specific packet.
Abstract:
A method is described and in one embodiment includes receiving a packet of a traffic flow at an ingress node of a communications network; routing the packet to an egress node of the communications network via a first path comprising a tunnel if the packet was received from a node external to the communications network; and routing the packet to the egress node of the communications network via a second path that does not traverse the tunnel if the packet was received from a node internal to the communications network. The first path is identified by a first Forwarding Information Base (“FIB”) entry corresponding to the flow and the second path is identified by a second FIB entry corresponding to the flow.
Abstract:
Methods and systems are disclosed for enabling centralized path definition and policy with distributed path setup, and centralized path setup control with distributed path utilization constraints. In one example, a path computation client (PCC) requests, utilizing opaque PCE profile identifiers, path computation from a path computation element (PCE). The PCE profile identifier corresponds to path computation constraints, stored local to PCE, and are unknown to the PCC. Advantageously, the PCE profile identifiers allow the PCC to initiate path computation requests based on information local the PCC while leveraging centralized computation by the PCE. In another example, a PCE requests, utilizing opaque PCC profile identifiers, that a PCC initiate a path. The PCC profile identifier corresponds to path usage constraints, stored local to PCC, and are unknown to the PCE. Advantageously, the PCC identifiers allow the PCE to marshal path initiation while leveraging distributed resources to enforce compliance with usage parameters.
Abstract:
In one embodiment, a source transmits one or more data packets to a destination over a primary pseudowire (PW). When a device on the primary PW detects a downstream failure of the primary PW, and in response to receiving one or more data packets from a source from the failed primary PW, the device adds a loopback packet identifier to the one or more received data packets, and returns the one or more data packets with the loopback packet identifier to the source upstream on the primary PW. Accordingly, in response to receiving the data packet returned with a loopback packet identifier from the primary PW (in response to the downstream failure), the source retransmits the one or more data packets to the destination over a backup PW.
Abstract:
Methods and systems are disclosed for enabling centralized path definition and policy with distributed path setup, and centralized path setup control with distributed path utilization constraints. In one example, a path computation client (PCC) requests, utilizing opaque PCE profile identifiers, a path computation from a path computation element (PCE). The PCE profile identifier corresponds to path computation constraints, stored local to PCE, and are unknown to the PCC. Advantageously, the PCE profile identifiers allow the PCC to initiate path computation requests based on information local the PCC while leveraging centralized path computation by the PCE. In another example, a PCE requests, utilizing opaque PCC profile identifiers, that a PCC initiate a path. The PCC profile identifier corresponds to path usage parameter constraints, stored local to PCC, and are unknown to the PCE. Advantageously, the PCC identifiers allow the PCE to marshal path initiation while leveraging distributed resources to enforce compliance with usage parameters.