Abstract:
Embodiments of the present disclosure provide a set of extensions to enable BGP to setup and maintain flexible Segment Routed Traffic Engineered (SR-TE) policies. Embodiments of the present disclosure further propose a new approach for steering traffic onto SR-TE paths on a per-prefix basis without deploying the existing complex mechanisms.
Abstract:
Utilizing the systems disclosed herein, a network element (in a network) controls, within another network, the constraints of a service, timing of the creation of the service, and selection a service on which a packet is transmitted. For example, a first network element (located in a first network) receives a request associated with initiating a service. The request is received from a second network element located in a second network and includes at least one path constraint. The first network element controls creation of the service in the first network on behalf of the second network element located in the second network by, e.g., identifying a path based, at least in part, on the at least one path constraint; and binding an identifier and an interface to the path, wherein the interface is associated with one or more operation to perform on any traffic that is labeled with the identifier.
Abstract:
In one embodiment, packets are forwarded in a network according to a Segment Routing-based (SR-based) multicast distribution tree identified by a Tree Segment Identifier (Tree-SID). This packet forwarding includes packet replication to cause multiple copies of a same packet to be forwarded to different nodes of the SR-based multicast distribution tree. The Tree-SID is typically a same global value used within the network to identify the SR-based multicast distribution tree. As each packet is being routed through the network according to the SR-based multicast distribution tree, the packet includes the Tree-SID in a Segment List of the packet, with the Segment List being an ordered list of SID's identifying information for forwarding the packet in the network. The Tree-SID provides a lookup key for efficient forwarding of packets by packet switching devices making forwarding decisions, which may including forwarding multiple copies of the packet.
Abstract:
Systems, methods, and computer-readable media for an intelligent load balancer. In some embodiments, a system can analyze activity data for egress links associated with a network. The system can also receive a service request originating from a remote device. Next, the system can select a server in the network for receiving the service request. Based on the activity data, the system can also select an egress link from the egress links for communicating data associated with the service request from the network to a remote destination location, such as the remote device. The system can then send a signal to the selected server which can include the service request and an indication of the egress link to be used for the data associated with the service request. The system can also later change the selected egress link for the service request if the system subsequently identifies a better egress link.
Abstract:
A method is provided in one example embodiment and includes receiving a request to create a path through a network, wherein the path originates on a first network device and terminates on the second network device; identifying a first controller associated with the first network device, wherein the first controller proxies control plane functions for the first network device; identifying a second controller associated with the second network device, wherein the second controller proxies control plane functions for the second network device; and computing the path using the first controller as a source and the second controller as a destination. The first controller installs the computed path on the first network device and the second controller installs the computed path on the second network device.
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:
In one embodiment, a device in a segment routed network identifies an adjacency segment between the device and another device in the network. The device also identifies a merge point in the network. A first network path extends between the device and the merge point via the adjacency segment. A bypass network path that does not include the adjacency segment also extends between the device and the merge point. The device generates an interior gateway protocol (IGP) message that identifies the adjacency segment and the merge point. The device provides the IGP message to one or more other devices in the network.
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, an access component of a local network edge device receives traffic, and generates a frame for the traffic that includes a remote context label that identifies an access component of the remote network edge device to which the traffic is to be forwarded upon arrival at the remote network edge device, and a virtual circuit label corresponding to a particular virtual service of the traffic. The local network edge device forwards the frame towards the remote network edge device. In another embodiment, the frame may be received at a core component of the remote network edge device, an in response to the remote context label identifying an access component of the remote network edge device, forwarded to the access component, which determines the particular virtual service, and forwards the traffic from the frame out the access component towards an endpoint for the traffic.
Abstract:
Aspects described herein include a method for use with a software-defined network controller, as well as an associated computer program product and system. The method comprises assigning a segment identifier to an endpoint node within a destination domain of a plurality of domains. Adjacent domains of the plurality of domains are connected via a respective set of two or more domain border routers. The method further comprises assigning a respective segment identifier to each domain. Each domain border router advertises the segment identifiers of the respective two adjacent domains. The method further comprises, responsive to a request from a headend node within a source domain of the plurality of domains, computing a path from the headend node to the endpoint node. The path includes (i) the segment identifiers of any domains between the headend node and the endpoint node, and (ii) the segment identifier of the endpoint node.