Finger Table question
I have a question regarding the finger tables.
Lets say our id space is 3 bit, so identifiers can be 0..7
Let's say node 7 is calculating its finger table:
i target ID successor
But in this id space it would be impossible to have an id=8, or an id=9, or an id=11, so how to get the successors?. How we shall calculate that in those "extreme" cases ?
Would the successors be 0 (in case 0 is a node?)
And if 0 is not a node, the next node that exists after 0?