Concurrent ID allocation in a service-based architecture
AssigneeTelefonaktiebolaget LM Ericsson (publ)
InventorsAndrás Zahemszky, Gergely Pongrácz, Balázs Pinczel, Dinand Roeland
Life of this patent
Estimating the term…
Abstract
A method and control plane node capable of receiving, from a requester, a request for a unique identifier, selecting an identifier from a pool comprising a plurality of unique identifiers held by the control plane node, creating a key representing the selected identifier in the pool, attempting to write to an initial version of a value of the created key in order to create a key-value pair in the key-value store, wherein the writing is successful if no write previously has been performed to said initial version of the value, and if so returning, to the requester, the selected identifier as an allocated identifier.
Claims14
A method of a control plane node of allocating, for a communication device accessing a network in which the control plane node is arranged, a unique identifier using a key-value store, the method comprising:
- receiving, from a requester, a request for a unique identifier;
- selecting an identifier from a pool comprising a plurality of unique identifiers held by the control plane node;
- creating a key representing the selected identifier in the pool;
- attempting to write to an initial version of a value of the created key in order to create a key-value pair in the key-value store, wherein the writing is successful if no write previously has been performed to said initial version of the value;
- and if so;
- returning, to the requester, the selected identifier as an allocated identifier.
A control plane node configured to allocate, for a communication device accessing a network in which the control plane node is arranged, a unique identifier using a key-value store, the control plane node comprising a processing unit and a memory, said memory containing instructions executable by said processing unit, whereby the control plane node is operative to:
- receive, from a requester, a request for a unique identifier;
- select an identifier from a pool comprising a plurality of unique identifiers held by the control plane node;
- create a key representing the selected identifier in the pool;
- attempt to write to an initial version of a value of the created key in order to create a key-value pair in the key-value store, wherein the writing is successful if no write previously has been performed to said initial version of the value;
- and if so;
- return, to the requester, the selected identifier as an allocated identifier.
A non-transitory computer-readable storage medium comprising a computer program product including instructions to cause at least one processor to:
- receive, from a requester, a request for a unique identifier;
- select an identifier from a pool comprising a plurality of unique identifiers held by the control plane node;
- create a key representing the selected identifier in the pool;
- attempt to write to an initial version of a value of the created key in order to create a key-value pair in the key-value store, wherein the writing is successful if no write previously has been performed to said initial version of the value;
- and if so;
- return, to the requester, the selected identifier as an allocated identifier.
Dependencies are inferred from the claim text.