consistent_hash.m

来自「best routing protocol」· M 代码 · 共 11 行

function b_k = consistent_hash(node, beacons, n)
% beacons: beacon id
% node \in [beacons(b_k), beacons(b_k+1)), assuming beacons are sorted!!!!
if node<beacons(1)
  b_k = length(beacons);
  return
end

x = find(beacons<=node);
b_k = x(length(x));