Synchronoss Technologies, Inc

Michael A Bellomo

Mortimer L Smedley, Iii

Casimir Saternos

Ivan Skuliber

Eric Marshall Fedok

Jay H Colson

Dennis P Mathew

Ryan C O'Hare

A computer implemented method and system for uniform, consistent, stateless, and deterministic consistent hashing for fixed size partitions. The method comprises receiving server information for a plurality of servers in a server pool; ordering the server information for the plurality of servers; calculating a mean number of partitions per server in the server pool; calculating a first maximum allowed number of partitions for a server by applying a floor function to the calculated mean number of partitions per server in the server pool; in the order of the ordered server information, assigning partitions to servers based on a hashing function, using the first maximum allowed number of partitions per server; calculating a second maximum allowed number of partitions for a server by applying a ceiling function to the calculated mean number of partitions per server in the server pool; in the order of the ordered server information, assigning partitions to servers based on a hashing function, using the second maximum allowed number of partitions per server; and assigning unassigned partitions wherein assigning comprises: for each unassigned partition, mapping the partition to a server with the least number of assigned partitions at a time of the mapping.

Method and system for uniform, consistent, stateless and deterministic consistent hashing for fixed size partitions

A computer implemented method and system for secure initial secret delivery for collocated containers with shared resources techniques is disclosed. The method comprises providing an application type identifier and a token for accessing a secrets management service; creating asynchronously, a plurality of collocated containers with shared resources; initiating a request for a creation for an initial secret; validating the request, requesting an identity for the collocated containers; validating the identity; starting an application instance; and using the initial secret to retrieve other secrets for the application instance.

Method and system for initial secret delivery for scalable and restart-able collocated containers with shared resources

A server for providing a generic actor system container application comprising: status and control graphical user interfaces, a listener service, a cluster manager, an actor registry and discovery service, a system configurator, a plurality of handles, a plurality of listeners, and a plurality of generic actors, wherein the generic actor system container application is configured to: receive information associated with a plurality of customized domain specific actors; receive a plurality of domain specific connection information; generate the plurality of domain specific actors based on the information associated with the plurality of customized domain specific actors; register the plurality of domain specific actors; and execute and monitor a domain specific actor system using the domain specific actors based on the domain specific connection information.

System and method for a generic actor system container application

A method for the reorganization of messages in queuing systems is disclosed. The method comprising receiving a statement to reorganize one or more messages within an ordered data structure; translating the statement into a first set of instructions for identifying one or more messages on which to perform one or more operations, a second set of instructions for performing the one or more operations on the identified one or more messages, and a third set of instructions for storing, in a memory, the identified one or more messages after the one or more operations have been performed; executing the first set of instructions, the second set of instructions, and the third set of instructions on each message in the ordered data structure; and transmitting the operated upon messages.

Systems and methods for reorganization of messages in queuing systems

Embodiments of the present invention are directed toward an improved enterprise leasing license algorithm and system thereof. A licensing algorithm for enterprise software configured to support expiring floating licenses obtained from a central license server. Floating licenses that have a user limit but not necessarily an expiration date, are installed to a central license server. A license is assigned to a user upon starting of the software program if a valid license has not yet been assigned. On exiting the software program, the user can return the license, making it immediately available to another user, or can keep the license for later use. A user is able to obtain a license while coupled to a network but is able to advantageously continue using the software program while disconnected from the network.

Enterprise leasing license algorithm

The delay in provisioning telecommunication services and equipment via a network is reduced significantly by performing substantially all of the provisioning processes sequentially on a single server. That is, through the counterintuitive approach of using sequential processing on a single server rather than parallel processing on a plurality of servers, the time required to provision telecommunication services and equipment is reduced. Preferably, telecommunication services and equipment are provisioned through a network by classifying the orders to be provisioned as two types. When the order is of a first type, the provisioning processes are performed on a set of servers (shared), and when the order is of a second type, substantially all of the provisioning processes are performed on a single server.

Growing community of inventors

Coopersburg, PA, United States of America

Michael A Bellomo