Abstract:
Adaptable resiliency for a virtualized radio access network (vRAN) framework is disclosed. A resiliency management component can determine vRAN topological adaptations that can reflect resiliency requirements of service instance(s). Accordingly, sufficient redundant vRAN components to satisfy the resiliency requirements can be deployed. However, unlike conventional redundancy techniques that can determine a highest level of redundancy and then apply that relative to all supported services, the disclosed subject matter can avoid over-deploying redundant vRAN components, e.g., redundant components exceeding the resiliency requirement of a service instance, resulting in lowered monetary and non-monetary costs to maintain a vRAN. Moreover, as the services change, the topology of the vRAN can be automatically adapted to purge excessive redundancies, add newly required redundancies, etc., which can facilitate propagating an adequate but lean vRAN topology that is sufficiently resilient.
Abstract:
The disclosed technology is directed towards locating and counting unused nodes, such as free Internet Protocol version 4 (IPv4) address blocks. A hierarchical structure of nodes is created from an origin block to a specified lower level, and the hierarchical structure is processed using mapping and eliminating to locate free nodes. A first node group comprises node(s) in use, a second node group identifies intermediate subnets between the first node of the first node group and the specified origin block, and a third node group identifies any subnets hierarchically below node(s) in use. Unused (free) node count information is obtained based on nodes below the origin block that are not in the first node group, the second node group, or the third node group.
Abstract:
The transport latency, processing time, and computing time in virtual functions (VFs) and physical functions (PFs) that are allocated to delay sensitive services may be assessed and stored. The assessment may be used to create latency zones for network planning or design, as well as determining in near real time the available resources to meet the service needs.
Abstract:
Adaptable resiliency for a virtualized radio access network (vRAN) framework is disclosed. A resiliency management component can determine vRAN topological adaptations that can reflect resiliency requirements of service instance(s). Accordingly, sufficient redundant vRAN components to satisfy the resiliency requirements can be deployed. However, unlike conventional redundancy techniques that can determine a highest level of redundancy and then apply that relative to all supported services, the disclosed subject matter can avoid over-deploying redundant vRAN components, e.g., redundant components exceeding the resiliency requirement of a service instance, resulting in lowered monetary and non-monetary costs to maintain a vRAN. Moreover, as the services change, the topology of the vRAN can be automatically adapted to purge excessive redundancies, add newly required redundancies, etc., which can facilitate propagating an adequate but lean vRAN topology that is sufficiently resilient.
Abstract:
The disclosed technology is directed towards locating and counting unused nodes, such as free Internet Protocol version 4 (IPv4) address blocks. A hierarchical structure of nodes is created from an origin block to a specified lower level, and the hierarchical structure is processed using mapping and eliminating to locate free nodes. A first node group comprises node(s) in use, a second node group identifies intermediate subnets between the first node of the first node group and the specified origin block, and a third node group identifies any subnets hierarchically below node(s) in use. Unused (free) node count information is obtained based on nodes below the origin block that are not in the first node group, the second node group, or the third node group.
Abstract:
A method and apparatus for enabling prioritization of signaling messages in a communication network are disclosed. For example, the method receives at least one signaling message, and classifies each of the at least one signaling message. The method schedules each of the at least one signaling message for processing, and discards selectively one or more signaling messages that have been scheduled under an overload condition.
Abstract:
Preemptive based radio access control is facilitated. Queue data is received, wherein the queue data corresponds to a set of requests for highly prioritized communications included on a prioritized queue. The queue data is used to determine whether a set of conditions for involuntarily terminating a radio communication session has been met. Session data corresponding to characteristics for each of a plurality of radio communication sessions are also received and utilized to determine which of the plurality of radio communication sessions to terminate if the set of conditions for involuntarily terminating a radio communication session have been met.
Abstract:
Preemptive based radio access control is facilitated. Queue data is received, wherein the queue data corresponds to a set of requests for highly prioritized communications included on a prioritized queue. The queue data is used to determine whether a set of conditions for involuntarily terminating a radio communication session has been met. Session data corresponding to characteristics for each of a plurality of radio communication sessions are also received and utilized to determine which of the plurality of radio communication sessions to terminate if the set of conditions for involuntarily terminating a radio communication session have been met.
Abstract:
Adaptable resiliency for a virtualized radio access network (vRAN) framework is disclosed. A resiliency management component can determine vRAN topological adaptations that can reflect resiliency requirements of service instance(s). Accordingly, sufficient redundant vRAN components to satisfy the resiliency requirements can be deployed. However, unlike conventional redundancy techniques that can determine a highest level of redundancy and then apply that relative to all supported services, the disclosed subject matter can avoid over-deploying redundant vRAN components, e.g., redundant components exceeding the resiliency requirement of a service instance, resulting in lowered monetary and non-monetary costs to maintain a vRAN. Moreover, as the services change, the topology of the vRAN can be automatically adapted to purge excessive redundancies, add newly required redundancies, etc., which can facilitate propagating an adequate but lean vRAN topology that is sufficiently resilient.
Abstract:
Aspects of the subject disclosure may include, for example, a method in which a processing system determines a location of a failure in a communication network and a cause of the failure. If the failure cannot be resolved using a recovery feature of the network, the processing system identifies a recovery procedure for resolving the failure, and dispatches an automated vehicle to the failure location; the vehicle is provided with instructions for performing the recovery procedure, which may include replacement of a hardware component of the network. The operations also include determining whether the recovery procedure is successful; if the recovery procedure is not successful, the processing system obtains information via the vehicle regarding the failure, to facilitate human intervention to resolve the failure. Other embodiments are disclosed.