公开(公告)号：US20210073043A1

公开(公告)日：2021-03-11

申请号：US16567473

申请日：2019-09-11

Applicant: Synchronoss Technologies, Inc.

Inventor： Ivan Skuliber ,  Dennis P. Mathew ,  Michael A. Bellomo

IPC: G06F9/50 ,  G06F3/06

Abstract: 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.

公开(公告)号：US11804958B2

公开(公告)日：2023-10-31

申请号：US17137479

申请日：2020-12-30

Applicant: Synchronoss Technologies, Inc.

Inventor： Ivan Skuliber ,  Ryan C. O'Hare ,  Michael A. Bellomo

IPC: H04L9/08 ,  H04L9/32

CPC classification number: H04L9/085 ,  H04L9/0861 ,  H04L9/0894 ,  H04L9/3213

Abstract: 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.

公开(公告)号：US20220209939A1

公开(公告)日：2022-06-30

申请号：US17137479

申请日：2020-12-30

Applicant: Synchronoss Technologies, Inc.

Inventor： Ivan Skuliber ,  Ryan C. O'Hare ,  Michael A. Bellomo

IPC: H04L9/08 ,  H04L9/32

Abstract: 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.

公开(公告)号：US12210912B2

公开(公告)日：2025-01-28

申请号：US16567473

申请日：2019-09-11

Applicant: Synchronoss Technologies, Inc.

Inventor： Ivan Skuliber ,  Dennis P. Mathew ,  Michael A. Bellomo

IPC: G06F7/00 ,  G06F3/06 ,  G06F9/50 ,  G06F15/173 ,  G06F17/00

Abstract: 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.