Abstract:
Routing packet traffic using hierarchical forwarding groups is disclosed. In an embodiment, a packet is received at a packet router. Data related to the packet is received at a first forwarding group. Based on a first forwarding policy associated with the first forwarding group, a particular second forwarding group is selected from a set of forwarding groups that are members of the first forwarding group. Each forwarding group of the set of forwarding groups that are members of the first forwarding group is associated with a unique set of paths. Data related to the packet is provided to the particular second forwarding group. Based on a second forwarding policy associated with the particular second forwarding group, a particular path is selected from a set of paths that are associated with the particular second forwarding group. The packet is forwarded to a network node via the particular path.
Abstract:
A network device is provisioned with a first data model of a first type and that models first properties for the network device, a second data model of a second type and that models second properties for the network device, and mappings that indicate mapped first properties among the first properties that are mapped to mapped second properties of the second properties. Upon receiving a request from a network for data for the first data model, the network device retrieves first data for the first properties of the first data model. The network device determines, based on the mappings, unmapped second properties of the second properties that are not mapped to any of the first properties. The network device retrieves, as dynamically augmented data, data for the unmapped second properties. The network device sends a request response including the first data and the dynamically augmented data.
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:
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:
A network device is provisioned with a first data model of a first type and that models first properties for the network device, a second data model of a second type and that models second properties for the network device, and mappings that indicate mapped first properties among the first properties that are mapped to mapped second properties of the second properties. Upon receiving a request from a network for data for the first data model, the network device retrieves first data for the first properties of the first data model. The network device determines, based on the mappings, unmapped second properties of the second properties that are not mapped to any of the first properties. The network device retrieves, as dynamically augmented data, data for the unmapped second properties. The network device sends a request response including the first data and the dynamically augmented data.
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:
Routing packet traffic using hierarchical forwarding groups is disclosed. In an embodiment, a packet is received at a packet router. Data related to the packet is received at a first forwarding group. Based on a first forwarding policy associated with the first forwarding group, a particular second forwarding group is selected from a set of forwarding groups that are members of the first forwarding group. Each forwarding group of the set of forwarding groups that are members of the first forwarding group is associated with a unique set of paths. Data related to the packet is provided to the particular second forwarding group. Based on a second forwarding policy associated with the particular second forwarding group, a particular path is selected from a set of paths that are associated with the particular second forwarding group. The packet is forwarded to a network node via the particular path.
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.
Abstract:
Selecting remote path using forwarding path preferences is disclosed. In an embodiment, a message of a first network node identifying one or more forwarding path preferences in association with one or more destination addresses is received at a packet router. A particular path corresponding to a particular forwarding path preference from among the one or more forwarding path preferences received in the message is determined and in response a particular label is determined. A forwarding entry associating the particular label with the particular forwarding path preference and the particular path is stored. The particular label is forwarded to a second network node. A packet including the particular label is received at the packet router and the particular path associated with the particular label included with the packet is selected based on the forwarding entry associated with the label. The packet is forwarded to a network node via the selected path.
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.