Abstract: The systems and methods relate to virtual radio access networks (vRANs). The systems and methods may offload a signal processing task of a physical layer from a vRAN server located at the far edge of a network nearby a base station to a remote location further away from the base station. The remote location may include higher level edge deployments of servers or a cloud deployment of servers. The system and methods may scale the vRAN server capacity by offloading the signal processing task to the remote location without compromising quality of service requirements or latency requirements of the user equipment or the applications.

Abstract: The present disclosure relates to systems and methods for sharing compute resources. The systems and methods may include identifying a plurality of workloads to complete by a deadline. The systems and methods may include generating a performance prediction for each workload of the plurality of workloads. The systems and methods may use the performance prediction to calculate a number of compute resources required for the plurality of workloads to complete by the deadline. The systems and methods may schedule the plurality of workloads across the number of compute resources.

Abstract: A reliable network function virtualization (rVNF) system includes a virtualized network function (VNF) application instance that includes a plurality of physical VNF instances. A load balancer provides an interface between a client and the VNF application instance. A load balancer interface facilitates delivery of packets related to a particular user context to the same physical VNF instance. A communication interface facilitates communication between the client and the VNF application instance. Application storage stores session data associated with the VNF application instance.

Abstract: A reliable network function virtualization (rVNF) system includes a virtualized network function (VNF) application instance that includes a plurality of physical VNF instances. A load balancer provides an interface between a client and the VNF application instance. A load balancer interface facilitates delivery of packets related to a particular user context to the same physical VNF instance. A communication interface facilitates communication between the client and the VNF application instance. Application storage stores session data associated with the VNF application instance.

Abstract: Systems and methods for high availability cloud service provision are disclosed. A server receives, from a remote device, a request to access a specified service, the specified service being associated with a plurality of virtual machines, each of the plurality of virtual machines storing shared states associated with the specified service. The server provides, to the remote device in response to the request, a connection to a first virtual machine of the plurality of virtual machines and identifiers of other ones of the plurality of virtual machines. The server determines to end a data connection the remote device and the first virtual machine while continuing to provide the specified service to the remote device. The server provides, to the remote device in response to determining to disconnect the remote device from the first virtual machine, a connection to a second virtual machine of the plurality of virtual machines.

Abstract: A reliable network function virtualization (rVNF) system includes a virtualized network function (VNF) application instance that includes a plurality of physical VNF instances. A load balancer provides an interface between a client and the VNF application instance. A load balancer interface facilitates delivery of packets related to a particular user context to the same physical VNF instance. A communication interface facilitates communication between the client and the VNF application instance. Application storage stores session data associated with the VNF application instance.

Abstract: Techniques are described for operating a core cellular network stack on a cloud computing environment (e.g., a public cloud infrastructure). For example, virtualized packet gateways can be run on virtual machines of the cloud computing environment and standard load balancers can distribute network traffic of the cellular network among the virtualized packet gateways. The virtualized packet gateways can be setup with a local cache of an external key-value store containing bearers of the cellular network and process received data plane network packets using the local cache. Bearers can be updated within the cellular network using the external key-value store, and virtualized packet gateways can obtain and use updated bearer details.

Abstract: Techniques are described for operating a core cellular network stack on a cloud computing environment (e.g., a public cloud infrastructure). For example, virtualized packet gateways can be run on virtual machines of the cloud computing environment and standard load balancers can distribute network traffic of the cellular network among the virtualized packet gateways. The virtualized packet gateways can be setup with a local cache of an external key-value store containing bearers of the cellular network and process received data plane network packets using the local cache. Bearers can be updated within the cellular network using the external key-value store, and virtualized packet gateways can obtain and use updated bearer details.

Abstract: In various examples there is a telecommunications network access point of a telecommunications network in which the control plane is implemented using a data center comprising a plurality of interconnected computation nodes. The access point comprises a memory holding a log of encapsulated control messages the control messages being messages of a control protocol of the telecommunications network. The access point has a processor configured, for a control message to be sent by the access point to a node in the data center, to: generate a message identifier; encapsulate the control message in a packet of a communications protocol of the data center, add the message identifier to a header of the encapsulated control message; send the encapsulated control message to the node of the data center; and store a record of the encapsulated control message and node of the control plane in the log.

Abstract: Graph partitioning for massive scale graphs is described, such as for graphs having vertices representing people and edges representing connections between people in a social networking system; or for graphs where the vertices represent other items and the edges represent relationships between the items. In various embodiments a graph data allocator receives a graph vertex and its edges and allocates the vertex to one of a plurality of clusters each associated with one or more computing devices. In various embodiments the allocation is made by optimizing an objective function which takes into account both a cost of edges between clusters and a cost related to sizes of the clusters. In some examples the cost related to sizes of the clusters comprises a convex function applied to each of the cluster sizes. In examples, computations on the graph data are carried out with reduced runtimes and communications cost.

Abstract: In various examples there is a telecommunications network access point of a telecommunications network in which the control plane is implemented using a data center comprising a plurality of interconnected computation nodes. The access point comprises a memory holding a log of encapsulated control messages the control messages being messages of a control protocol of the telecommunications network. The access point has a processor configured, for a control message to be sent by the access point to a node in the data center, to: generate a message identifier; encapsulate the control message in a packet of a communications protocol of the data center, add the message identifier to a header of the encapsulated control message; send the encapsulated control message to the node of the data center; and store a record of the encapsulated control message and node of the control plane in the log.

Abstract: Systems and methods for high availability cloud service provision are disclosed. A server receives, from a remote device, a request to access a specified service, the specified service being associated with a plurality of virtual machines, each of the plurality of virtual machines storing shared states associated with the specified service. The server provides, to the remote device in response to the request, a connection to a first virtual machine of the plurality of virtual machines and identifiers of other ones of the plurality of virtual machines. The server determines to end a data connection the remote device and the first virtual machine while continuing to provide the specified service to the remote device. The server provides, to the remote device in response to determining to disconnect the remote device from the first virtual machine, a connection to a second virtual machine of the plurality of virtual machines.

Abstract: Count tracking in distributed environments is described, for example, as in data centers where many sites receive data and a coordinator node estimates a sum of the data received across the sites. Count tracking may be used in database applications, search engines, social networking applications and others. In various embodiments sites and a coordinator node work together to implement a process for summing data received at sites, where the sum takes into account both increments and decrements. In examples, a site decides whether to notify the coordinator node of a new data item according to a sampling probability that is related to an estimate of the current global sum of the data input across sites. In some examples a multi-mode algorithm is implemented which increases or decreases communication between the sites and the coordinator node according to behavior of the estimated global sum such that communications costs are optimized.

Abstract: In various examples there is a telecommunications network access point of a telecommunications network in which the control plane is implemented using a data center comprising a plurality of interconnected computation nodes. The access point comprises a memory holding a log of encapsulated control messages the control messages being messages of a control protocol of the telecommunications network. The access point has a processor configured, for a control message to be sent by the access point to a node in the data center, to: generate a message identifier; encapsulate the control message in a packet of a communications protocol of the data center, add the message identifier to a header of the encapsulated control message; send the encapsulated control message to the node of the data center; and store a record of the encapsulated control message and node of the control plane in the log.

Abstract: Techniques for distributed selection of white space channels are described. According to one or more embodiments, techniques described herein enable fair allocation of available white spaces among entities seeking access to the white spaces, such as base stations and client devices in a particular geographical region. According to one or more embodiments, techniques for distributed selection of white space channels enable individual network components to detect white space network attributes and distribute white space channels based on the detected attributes. Alternatively or additionally, multiple base stations can collaborate to share information about white spaces in a particular region.

Abstract: A dynamic channel selection approach for wireless communication networks is provided by measuring an ineffective communication metric on a currently-used channel. The network can switch channels if the ineffective communication metric from a device on the network satisfies a channel selection condition. To change the wireless communication network to the new channel, all network devices in the wireless communication network are instructed to switch to the new channel. As network communications start on the new channel, the ineffective communication metric measurements begin again on the new channel. Communications on the new channel continue until the channel selection condition is satisfied on the new channel, at which point another random selection of a channel is executed. The process continues in such iterations during the operation of the network and its network devices.

Abstract: Techniques for distributed selection of white space channels are described. According to one or more embodiments, techniques described herein enable fair allocation of available white spaces among entities seeking access to the white spaces, such as base stations and client devices in a particular geographical region. According to one or more embodiments, techniques for distributed selection of white space channels enable individual network components to detect white space network attributes and distribute white space channels based on the detected attributes. Alternatively or additionally, multiple base stations can collaborate to share information about white spaces in a particular region.

Abstract: A multiple independent narrow-channel wireless network and method for transmitting and received data over a wireless network using a fragmented frequency spectrum. The system and method uses a plurality of narrow wireless channels obtained from splitting a wide wireless channel. Each narrow channel performs sending, receiving, and carrier sensing. Moreover, each narrow channel is independent such that data can be sent or received without any interference from other narrow channels and without synchronization. Embodiments of the system and method include a compound radio having a compound receiver and a compound transmitter. The compound transmitter includes an inter-radiolet symbol synchronization module, to permit use of a single inverse fast Fourier transform block, and a dynamically configurable filter array, to mitigate leakage between channels. The compound receiver uses fraction data rate processing to optimize efficiency.

Abstract: A dynamic channel selection approach for wireless communication networks is provided by measuring an ineffective communication metric on a currently-used channel. The network can switch channels if the ineffective communication metric from a device on the network satisfies a channel selection condition. To change the wireless communication network to the new channel, all network devices in the wireless communication network are instructed to switch to the new channel. As network communications start on the new channel, the ineffective communication metric measurements begin again on the new channel. Communications on the new channel continue until the channel selection condition is satisfied on the new channel, at which point another random selection of a channel is executed. The process continues in such iterations during the operation of the network and its network devices.

Abstract: A multiple independent narrow-channel wireless network and method for transmitting and received data over a wireless network using a fragmented frequency spectrum. The system and method uses a plurality of narrow wireless channels obtained from splitting a wide wireless channel. Each narrow channel performs sending, receiving, and carrier sensing. Moreover, each narrow channel is independent such that data can be sent or received without any interference from other narrow channels and without synchronization. Embodiments of the system and method include a compound radio having a compound receiver and a compound transmitter. The compound transmitter includes an inter-radiolet symbol synchronization module, to permit use of a single inverse fast Fourier transform block, and a dynamically configurable filter array, to mitigate leakage between channels. The compound receiver uses fraction data rate processing to optimize efficiency.