A Point of Local Repair (PLR) network element includes one or more ports and circuitry connected thereto for forwarding and control, wherein the circuitry is configured to receive a PATH message for a Label Switched Path (LSP) tunnel in a Multiprotocol Label Switching (MPLS) network with a specified DiffSery Traffic Engineering (DSTE) Class Type, determine the DSTE Class Type based on the PATH message, and store the DSTE Class Type for the LSP tunnel to ensure a Facility Bypass tunnel used for the LSP tunnel supports the specified DSTE Class Type. The circuitry can be further configured to, responsive to a failure of the LSP tunnel, select the Facility Bypass tunnel for the LSP tunnel such that the Facility Bypass tunnel supports the specified DSTE Class Type.

In accordance with some aspects of the present disclosure, an apparatus is disclosed. In some embodiments, the apparatus includes a processor and a memory. In some embodiments, the memory includes programmed instructions that, when executed by the processor, cause the apparatus to receive a request from a client; determine family of metrics; schedule the request based on the family of metrics; and in response to satisfying one or more scheduling criteria, send the request to a backend server.

Implementations are described herein for automatic deployment of function block application programs (FBAPs) across process automation nodes of a process automation system. In various implementations, one or more constraints associated with execution of a FBAP may be identified. Based on the one or more constraints, a process automation system that includes a plurality of process automation nodes may be analyzed. Based on the analysis, a subset of two or more process automation nodes on which to distributively deploy the FBAP may be selected from the plurality of processing node. In response to selecting the subset, the FBAP may be distributively deployed across the two or more process automation nodes of the subset.

Resource allocation limitations include resource limits and resource guarantees. A consumer is vulnerable to interruption by other consumers if using more resources than guaranteed. Resources are designated and/or assigned to consumers based on resource limits and resource guarantees. A constraint programming (CP) solver determines resource limits and resource guarantees that minimize vulnerability and/or vulnerability cost based on resource usage data. A CP data model includes limit elements, guarantee elements, and vulnerability elements. The CP data model further includes guarantee-vulnerability constraints, which relies on exceedance distributions generated from resource usage data for the consumers. The CP data model declaratively expresses combinatorial properties of a problem in terms of constraints. CP is a form of declarative programming.

Resource allocation limitations include resource limits and resource guarantees. A consumer is vulnerable to interruption by other consumers if using more resources than guaranteed. Resources are designated and/or assigned to consumers based on resource limits and resource guarantees. A constraint programming (CP) solver determines resource limits and resource guarantees that minimize vulnerability and/or vulnerability cost based on resource usage data. A CP data model includes limit elements, guarantee elements, and vulnerability elements. The CP data model further includes guarantee-vulnerability constraints, which relies on exceedance distributions generated from resource usage data for the consumers. The CP data model declaratively expresses combinatorial properties of a problem in terms of constraints. CP is a form of declarative programming.

A method and an apparatus for processing a low-latency service flow, where the method includes that a first forwarding device obtains a low latency identifier corresponding to a first service flow, and obtains a second data packet based on the first data packet and the low latency identifier after determining that a received first data packet belongs to the first service flow, where the second data packet includes the first data packet and the low latency identifier, the low latency identifier instructing a forwarding device that receives the first service flow to forward the first service flow in a low-latency forwarding mode, and the low-latency forwarding mode is a mode in which fast forwarding of the first service flow is implemented under dynamic control, and the first forwarding device sends the second data packet to a second forwarding device in the low-latency forwarding mode.

A method and an apparatus for processing a low-latency service flow, where the method includes that a first forwarding device obtains a low latency identifier corresponding to a first service flow, and obtains a second data packet based on the first data packet and the low latency identifier after determining that a received first data packet belongs to the first service flow, where the second data packet includes the first data packet and the low latency identifier, the low latency identifier instructing a forwarding device that receives the first service flow to forward the first service flow in a low-latency forwarding mode, and the low-latency forwarding mode is a mode in which fast forwarding of the first service flow is implemented under dynamic control, and the first forwarding device sends the second data packet to a second forwarding device in the low-latency forwarding mode.

Computer systems and methods for managing resources are described. In an aspect, a method includes: providing, to a client device associated with an authenticated entity, an intraday transfer interface, the intraday transfer interface including a selectable option to issue a future-dated borrowed resource reservation request to set aside an amount of borrowed resources; receiving, from the client device, a signal representing the future-dated borrowed resource reservation request, the future-dated borrowed resource reservation request associated with an amount of borrowed resources to set aside and a date of release of such borrowed resources; detecting a trigger condition, the trigger condition including an end-of-day reconciliation of resource tracking data and, in response to detecting the trigger condition, evaluating the future-dated borrowed resource reservation request based on a current amount of borrowed resources; and when the evaluation of the future-dated borrowed resource reservation request indicates that the future-dated borrowed resource reservation request cannot be implemented, generating an error by sending an error message to a computing device and rejecting the future-dated borrowed resource reservation request.

At a router, at least one memory and computer program code stored therein are configured to, with at least one processor, cause the router to: determine source router identification information for a tunnel traversing the router based on a routable source IP address for the tunnel; determine destination router identification information for the tunnel based on a routable destination IP address for the tunnel; program a bit string entry for the tunnel in a Bit Index Forwarding Table (BIFT) for tunnels from a source router to a plurality of destination routers, the BIFT being indexed based on the source router identification information and at least a portion of the destination router identification information; and route packet data received at the router according to the BIFT.

At a router, at least one memory and computer program code stored therein are configured to, with at least one processor, cause the router to: determine source router identification information for a tunnel traversing the router based on a routable source IP address for the tunnel; determine destination router identification information for the tunnel based on a routable destination IP address for the tunnel; program a bit string entry for the tunnel in a Bit Index Forwarding Table (BIFT) for tunnels from a source router to a plurality of destination routers, the BIFT being indexed based on the source router identification information and at least a portion of the destination router identification information; and route packet data received at the router according to the BIFT.