Abstract: Disclosed are various embodiments that provide highly available data-processing network functions for radio-based networks. In one embodiment, routing information is received from a plurality of instantiations of a data-processing network function of a radio-based network. Based at least in part on the routing information, a route to a first instantiation of the plurality of instantiations of the data-processing network function is advertised. Based at least in part on the routing information, a backup route to a second instantiation of the plurality of instantiations of the data-processing network function is advertised.

Abstract: Disclosed are various embodiments that provide highly available data-processing network functions for radio-based networks. In one embodiment, a tunnel host consistently routes network traffic associated with a range of network addresses in a radio-based network to a first instance of a data-processing network function instead of a second instance of the data-processing network function. A problem with the first instance of the data-processing network function is then detected. Additional network traffic associated with the range of network addresses is redirected from the first instance of the data-processing network function to the second instance of the data-processing network function.

Abstract: Disclosed are various embodiments that provide highly available data-processing network functions for radio-based networks. In one embodiment, a tunnel host consistently routes network traffic associated with a range of network addresses in a radio-based network to a first instance of a data-processing network function instead of a second instance of the data-processing network function. A problem with the first instance of the data-processing network function is then detected. Additional network traffic associated with the range of network addresses is redirected from the first instance of the data-processing network function to the second instance of the data-processing network function.

Abstract: Respective destination groups are provided to routing intermediaries associated with a packet processing application. The destination group comprises a set of fast-path packet processing nodes of a packet processing service to which the routing intermediaries are to transmit packets to be processed. After a determination is made that the set of fast-path nodes to be included in the destination groups has changed, the destination groups are modified gradually during an update propagation interval.

Abstract: Embodiments are directed towards managing an impact of a plurality of system and/or maintenance tasks distributed across a plurality of nodes. At least one initiator node may provide at least one disk request to at least one disk on at least one participant node. Each disk on each participant node with a workload, such as request wait time, above a maximum threshold and/or below a minimum threshold may be determined. If a disk is determined to have a workload above a maximum threshold and/or below a minimum threshold, then an impact of respective tasks on initiator nodes that provided requests to the determined disks may be reduced and/or increased, respectively. In some embodiments, an initiator node may reduce or increase an impact of a task by reducing or increasing a number of threads executing on that initiator node for that task.

Abstract: Embodiments are directed towards coordinating parallel execution of tasks. An ordered priority for each of a plurality of tracks may be established. Furthermore, each of a plurality of tasks may be assigned a native priority. A track for executing a task may be identified based on a match of the task native priority and a track priority. The task can execute at the identified track if the track is available. If the identified track is not available, then another track with a next higher priority than the previously identified track maybe iteratively identified. Next higher priority tracks may be iteratively identified until an available track is identified. If an available track is identified then the task can execute at the available track; otherwise, the task may be put into a wait mode before re-attempt to execute at the track with a priority that matches the task native priority.