December 19, 2006 at 15:35Grid mobility: a problematic aspect
In addition to the topic about grid mobility .
The question arose: how in the system without centralization will be assigned the ID of the user who has just registered ?
One of the considerations: keep the base of all IDs in the base of each point. Cons: updating the database will be very difficult (on the scale of all users), and in the case of several new users logging in between updates, conflicts can occur by ID.
Another option: assign the ID “not immediately”. When registering on the Web, we take the nearest numbers and see which digits are already precisely clogged. If, say, surrounded by neighboring points there is a digit (in binary representation) number 32, then the ID starts with bit 33, the request says “32nd is zero”, and the request is transmitted to the next points. Where the absence of a filled discharge is detected, the corresponding discharge is written in the ID.
I myself feel that the idea is crude, but it looks like an algorithm for catching a lion in Africa: divide Africa in half, discard the one in which there is no lion, repeat until capture ...
The question arose: how in the system without centralization will be assigned the ID of the user who has just registered ?
One of the considerations: keep the base of all IDs in the base of each point. Cons: updating the database will be very difficult (on the scale of all users), and in the case of several new users logging in between updates, conflicts can occur by ID.
Another option: assign the ID “not immediately”. When registering on the Web, we take the nearest numbers and see which digits are already precisely clogged. If, say, surrounded by neighboring points there is a digit (in binary representation) number 32, then the ID starts with bit 33, the request says “32nd is zero”, and the request is transmitted to the next points. Where the absence of a filled discharge is detected, the corresponding discharge is written in the ID.
I myself feel that the idea is crude, but it looks like an algorithm for catching a lion in Africa: divide Africa in half, discard the one in which there is no lion, repeat until capture ...