Abstract: At least one bandwidth-guaranteed segment routing (SR) path through a network is determined by: (a) receiving, as input, a bandwidth demand value; (b) obtaining network information; (c) determining a constrained shortest multipath (CSGi); (d) determining a set of SR segment-list(s) (Si=[sl1i, sl2i . . . slni]) a that are needed to steer traffic over CSGi; and (e) tuning the loadshares in Li, using Si and the per segment-list loadshare (Li=[l1i, l2i . . . lni]), the per segment equal cost multipath (“ECMP”), and the per link residual capacity, such that the bandwidth capacity that can be carried over CSGi is maximized.

Abstract: At least one bandwidth-guaranteed segment routing (SR) path through a network is determined by: (a) receiving, as input, a bandwidth demand value; (b) obtaining network information; (c) determining a constrained shortest multipath (CSGi); (d) determining a set of SR segment-list(s) (Si=[sl1i, sl2i . . . slni]) a that are needed to steer traffic over CSGi; and (e) tuning the loadshares in Li, using Si and the per segment-list loadshare (Li=[l1i, l2i . . . lni]), the per segment equal cost multipath (“ECMP”), and the per link residual capacity, such that the bandwidth capacity that can be carried over CSGi is maximized.

Abstract: Techniques are described for establishing lower priority LSPs on paths determined to be less likely to include bandwidth constrained links. In one example, a router includes a plurality of physical interfaces each having at least one link interconnecting the router as one of a plurality of routers in a network and a processor. The processor is configured to determine whether a link of one of the plurality of physical interfaces is congested based at least in part on an amount of available bandwidth on the link, and, responsive to determining that the link is congested, set a bandwidth subscription for the link, wherein the bandwidth subscription specifies that the amount of available bandwidth on the link for label switched paths having a lower priority is less than the amount of available bandwidth on the link for label switched paths having a higher priority.

Abstract: In general, techniques described are for bandwidth sharing between resource reservation protocol label switched paths (LSPs) and non-resource reservation protocol LSPs. For example, in networks where resource reservation protocol LSPs and non-resource reservation protocol LSPs co-exist within the same domain, resource reservation protocol LSPs and non-resource reservation protocol LSPs may share link bandwidth. However, when non-resource reservation protocol LSPs are provisioned, resource reservation protocol path computation elements computing resource reservation protocol paths may not account for non-resource reservation protocol LSP bandwidth utilization. The techniques described herein provide a mechanism for automatically updating traffic engineering database (TED) information about resource reservation protocol LSPs in a way that accounts for non-resource reservation protocol LSP traffic flow statistics, such as bandwidth utilization.

Abstract: A network device receives configuration information defining one or more abstract hops for which membership is defined as those network devices that satisfy a logical combination of one or more constituent attributes. The network device determines based on network topology information, for each of the defined abstract hops, a set of network devices that qualify for membership in the abstract hop. The network device receives a request to establish a label switched path (LSP) from an ingress network device to an egress network device, wherein the request specifies, as a constraint for the LSP, a plurality of hops in a defined order, including the one or more abstract hops. The network device selects a path from the ingress network device to the specified egress network device based on the ordered abstract hop constraint, and establishes the LSP along the selected path according to the defined order of the request.

Abstract: In general, techniques described are for bandwidth sharing between resource reservation protocol label switched paths (LSPs) and non-resource reservation protocol LSPs. For example, in networks where resource reservation protocol LSPs and non-resource reservation protocol LSPs co-exist within the same domain, resource reservation protocol LSPs and non-resource reservation protocol LSPs may share link bandwidth. However, when non-resource reservation protocol LSPs are provisioned, resource reservation protocol path computation elements computing resource reservation protocol paths may not account for non-resource reservation protocol LSP bandwidth utilization. The techniques described herein provide a mechanism for automatically updating traffic engineering database (TED) information about resource reservation protocol LSPs in a way that accounts for non-resource reservation protocol LSP traffic flow statistics, such as bandwidth utilization.

Abstract: Techniques are described for establishing lower priority LSPs on paths determined to be less likely to include bandwidth constrained links. In one example, a router includes a plurality of physical interfaces each having at least one link interconnecting the router as one of a plurality of routers in a network and a processor. The processor is configured to determine whether a link of one of the plurality of physical interfaces is congested based at least in part on an amount of available bandwidth on the link, and, responsive to determining that the link is congested, set a bandwidth subscription for the link, wherein the bandwidth subscription specifies that the amount of available bandwidth on the link for label switched paths having a lower priority is less than the amount of available bandwidth on the link for label switched paths having a higher priority.