A formal communication model for lookup operations in a hypercube-based P2P data store

P2P data stores achieve high data availability by introducing replication of data. As a consequence, searching data may require to follow several routing paths introducing additional communication. A formal model of this additional communication is introduced and evaluated based on a hypercube-based P2P data store