Reducing communication costs in robust peer-to-peer networks

Several recent research results describe how to design Distributed Hash Tables (DHTs) that are robust to adversarial attack via Byzantine faults. Unfortunately, all of these results require a significant blowup in communication costs over standard DHTs. For example, to perform a lookup operation, all such robust DHTs of which we are aware require sending O(log3 n) messages while standard DHTs require sending only O(log n), where n is the number of nodes in the network. In this paper, we describe protocols to reduce the communication costs of all such robust DHTs. In particular, we give a protocol to reduce the number of messages sent to perform a lookup operation from O(log3 n) to O(log2 n) in expectation. Moreover, we also give a protocol for sending a large (i.e. containing (log4 n) bits) message securely through a robust DHT that requires, in expectation, only a constant blowup in the total number of bits sent compared with performing the same operation in a standard DHT. This is a...

• Type: Journal
• Year: 2008
• Where: IPL
• Authors: Jared Saia, Maxwell Young
• Keywords: Communication Costs, IPL 2008, Robust Dhts, Standard Dht