Emc IP Holding Company LLC

Verizon Patent and Licensing Inc.

Emc Corporation

Kevin Xu

Junping Zhao

Philip N Shilane

Abhinav Duggal

Atul Avinash Karmarkar

Valerie Feldmann

Kun Wang

Kenneth Durazzo

Robert Belson

Charles P Szrom

Kenneth J Taylor

Wei Qi

Ricky Yuxi Sun

Jialin Yang

Gang Xie

Mason Ng

Xiangping Chen

Anton Kucherov

Patricia Ruey Chang

Ivan Bassov

Sanping Li

Wei Cui

Chen Gong

Randall Shain

John T Cardente

Sitaram D Pawar

Yingchao Zhou

Mohamed Sohail

Wei Kang

Sen Zhang

Weigang Zhong

Fenghua Hu

Mohan Palat

Rashmitha Sirsi

One or more computing devices, systems, and/or methods for dynamic resource slice allocation are provided. A bidding engine dynamically tracks available network slices and available edge computing resources to generate a current list of resource slices corresponding to combinations of available network slices and available edge computing resources. A bidding auction is conducted for the current list of resource slices. A user equipment device is determined to be a winner of the bidding auction for a resource slice based upon a bidding request from the user equipment device. In this way, the user equipment device is provide with access to the resource slice based upon a determination that the user equipment device won the bidding auction.

Dynamic resource allocation for network slices

A system described herein may identify a particular service provided by a first Edge Computing ('EC') device to a particular User Equipment (“UE”), and may monitor performance information associated with the first EC device and/or a second EC device. The system may determine, based on the monitoring, that the second EC device should provide the service to the particular UE in lieu of the first EC device; and may accordingly cause the service to be provided to the particular UE by the second EC device in lieu of the first EC device. The system may notify the first EC device that the second EC device has been selected to provide the service to the particular UE in lieu of the first EC device, and/or may notify the second EC device that the second EC device has been selected to provide the service to the particular UE.

Systems and methods for dynamic edge computing device assignment and reassignment

A system described herein may provide a technique for receiving a communication session request associated with a particular User Equipment ('UE'). The system may identify locator information associated with an edge discovery system associated with a network that includes a plurality of edge devices, wherein the edge discovery system receives service requests associated with one or more UEs and provides an indication of a respective edge device of the plurality of edge device in response to respective service requests. The system may output, in response to the communication session request, the locator information associated with the edge discovery system, wherein the particular UE communicates with the edge discovery system using the locator information to output a particular service request and receive, from the edge discovery system, an indication of a particular edge device of the plurality of edge devices in response to the particular service request.

Systems and methods for dynamic edge discovery in a wireless network

A system described herein may maintain one or more smart contracts on a distributed ledger. The system may receive a request, associated with a User Equipment ('UE'), for access to a particular network (e.g., a private network), identify one or more attributes of the UE, and select a particular smart contract based on the attributes of the UE. The system may execute the selected particular smart contract, which may include performing operations, indicated by the particular smart contract, using the one or more attributes of the UE as inputs. Executing the particular smart contract may further include identifying outputs that result from performing the particular set of operations using the attributes of the UE as inputs, such as a network access policy for the UE. The system may output a response to the request, indicating the network access policy determined based on executing the particular smart contract.

Systems and methods for network access control using distributed ledgers

A source site includes a controller, a set of source worker nodes, and a message queue connected between the controller and source worker nodes. The message queue receives messages and stores the messages for retrieval. A destination site includes a set of destination worker nodes. Tasks are generated to replicate changes to objects at the source site to the destination site. The controller pushes messages corresponding to the tasks onto the message queue. A source worker node retrieves a message corresponding to a task from the message queue for processing in conjunction with a destination worker node. The message is indicated as having been retrieved from the message queue.

Distributed object replication architecture

A system described herein may determine that a first measure of likelihood of demand for a particular service from a first set of edge computing devices exceeds a first threshold, and may instruct the first set of edge computing devices to provision resources to provide the particular service. The system may subsequently determine that a second measure of likelihood of demand for the particular service from a second set of edge computing devices exceeds a second threshold, the second set of edge computing devices being a subset of the first set of edge computing devices, and may initiate a service state synchronization operation with respect to the second set of edge computing devices. The system may select a particular edge computing device, of the second set of edge computing devices, to provide the particular service to a User Equipment ('UE').

Systems and methods for seamless edge service transfer

A system described herein may provide a technique for selectively granting or revoking/denying access to applications, services, data, etc. to a User Equipment ('UE') based on location-based policies and a network-determined location of the UE. The network-determined location may be determined by elements of a wireless network, such as a Mobility Management Entity ('MME'), Access and Mobility Management Function (&#x201c;AMF&#x201d;), or other suitable element.

Systems and methods for application access control

A system described herein may provide techniques for a geographically-based traffic handling policy. An originating device may mark traffic with geographic restriction information, such as in a header of network traffic, indicating a geographic restriction on the propagation of the traffic. The geographic restriction may indicate a geographic region in which the traffic may be forwarded, or a geographic region in which the traffic is prohibited from being forwarded. Network devices in a path between the originating device and a destination device may determine whether to drop the traffic or perform other policy-related actions based on whether such devices are inside the geographic region in which the traffic may be forwarded. In some implementations a destination device may register as an exception to such policies, based on which an originating device or a router may bypass geographically-based traffic handling policies with respect to marked traffic directed to the destination device.

Systems and methods for restricting network traffic based on geographic information

A source worker node at a source site fetches a task from a message queue. The task specifies replicating a first object at the source site to a destination site. A request for a connection is issued from the source worker node to the destination site. The request is received by a load balancer at the destination site and assigned to a destination worker node. A connection is established between the source and destination worker nodes. A determination is made that the destination site does not include an object that is the same as the first object. Upon the determination, a deduplication is performed between the source and destination worker nodes of segments into which the first object has been divided. Deduplicated segments of the first object are transmitted from the source worker node to the destination worker node for storage at the destination site.

Distributed replication and deduplication of an object from a source site to a destination site

A schedule is stored indicating a frequency of replication from source to destination sites. When a replication job is initiated, information identifying one or more objects at the source site to be replicated is copied into a snapshot without pausing user operations against the one or more objects. The snapshot is compared with a previous snapshot to generate replication tasks for the replication job. The replication tasks are placed onto a message queue at the source site, where a worker node at the source site retrieves a replication task from the message queue and processes the replication task in conjunction with a worker node at the destination site.

Dynamic allocation of worker nodes for distributed replication

A method, system and program is described for providing virtual storage domains for content addressable system. At least one tenant data storage policy is configured for at least one tenant in a storage system. A virtual storage domain is created based on the tenant data storage policy, each virtual storage domain having a unique identifier (ID). The corresponding virtual storage domain ID is tagged to a data request based on a data set policy when data belonging to a data set gets written to the storage system. A hash signature is calculated for the data taking the data content and the storage domain ID as inputs to calculate the hash signature.

Virtual storage domain for a content addressable system

A controller at a source site generates a set of tasks associated with a replication job. Each task includes one or more of copying an object from the source to destination site, or deleting an object from the destination site. The tasks are placed onto a message queue at the source site. Source worker nodes at the source site retrieve the tasks from the source site message queue for processing in conjunction with destination worker nodes at the destination site. A destination worker node, upon receiving a task from a source worker nodes, places the task onto a message queue at the destination site for retrieval by a backend worker node that handles writing to an object store at the destination site.

Tracking status and restarting distributed replication

Techniques are provided for implementing asynchronous checkpointing of in-memory data in a distributed computing system. For example, a method includes processing a stream of data records by an operator executing on a computing node, maintaining in a system memory, an operator state which is generated in response to the operator processing the stream of data records, and performing an asynchronous checkpointing process. The asynchronous checkpointing process includes enqueuing a checkpoint of the operator state in a first queue, wherein the first queue is maintained in the system memory, and executing a background worker thread to dequeue the checkpoint of the operator state from the first queue and store the checkpoint of the operator state in a data store. The operator continues with processing the stream of data records during the asynchronous checkpointing process.

Asynchronous in-memory data checkpointing for distributed computing systems

A source site includes a controller, a set of source worker nodes, and a message queue connected between the controller and source worker nodes. A destination site includes a set of destination worker nodes. The controller identifies differences between a first snapshot created at the source site at a first time and a second snapshot created at a second time, after the first time. Based on the differences, a set of tasks are generated. The tasks include one or more of copying an object from the source to destination or deleting an object from the destination. The controller places the tasks onto the message queue. A first source worker node retrieves the first task and coordinates with a first destination worker node to perform the first task. A second source worker nodes retrieves the second task and coordinates with a second destination worker node to perform the second task.

Growing community of inventors

Warren, NJ, United States of America

Kevin Xu