Question: Communication networks engineering. (Question 5) ################ ============================================================================== ---------------------------------------------------------------------------------------------------------------------------------------- Question 5 [25 pts] Assume a distributed database in a p2p network implemented through a circular Distributed
Communication networks engineering. (Question 5) ################
==============================================================================
----------------------------------------------------------------------------------------------------------------------------------------
![Communication networks engineering. (Question 5) ################ ============================================================================== ---------------------------------------------------------------------------------------------------------------------------------------- Question 5 [25 pts]](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f39072a0031_25766f390720062e.jpg)
Question 5 [25 pts] Assume a distributed database in a p2p network implemented through a circular Distributed Hash Table (DHT) with 8 users. Suppose that each user identifier is a number in the range [0,2A(40-1]. Now suppose that the database contains entries of the type (filename, IP address) where the filename is an integer number between 0 and 49999. 1. Give an example of simple hash function that can be used to design such a distributed database. 2. Suppose that the peers in the distributed database have the following identifiers: 2, 5, 6, 8, 10, 12, 13, 15. Peer 13 wants to find the IP address of the peer from where to download the file with filename 697. Describe the steps that will be taken by the peers according to your proposed hash function
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
