UNIVERSITÉ DE NANTES LABORATOIRE DINFORMATIQUE DE NANTES ATLANTIQUE Chord evaluation Searching type: equality Searching cost: O(log(n)) Update cost: O(log(n)) Node insertion cost: O(log 2 (n)) No storage or routing autonomy Yann Busnel51Structured P2P overlay networks
{}