You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Aug 3, 2020. It is now read-only.
An interesting idea is whether it would be worthwhile to separate the routing hashes and the naming hashes.
Since the number of nodes is relatively reduced (thousands most probably), the Pastry hashes shouldn't exceed 40-48 bits, otherwise the routing tables become sparse.
However, we could allow longer Scribe hashes to support significantly more topics. In essence only the first N bits of the scribe hash would result in routing and the rest only used for demultiplexing among topics with the same rendezvous point.
The text was updated successfully, but these errors were encountered:
An interesting idea is whether it would be worthwhile to separate the routing hashes and the naming hashes.
Since the number of nodes is relatively reduced (thousands most probably), the Pastry hashes shouldn't exceed 40-48 bits, otherwise the routing tables become sparse.
However, we could allow longer Scribe hashes to support significantly more topics. In essence only the first N bits of the scribe hash would result in routing and the rest only used for demultiplexing among topics with the same rendezvous point.
The text was updated successfully, but these errors were encountered: