Networking Assignment help sample of COMP3300 - Computer Networks

You are tasked with designing and implementing an efficient Distributed Hash Table (DHT) for a peer-to-peer (P2P) file-sharing application. In the application, each peer stores pieces of files, and clients (peers) need to locate the file pieces from other peers using the DHT.

The challenge is to ensure that the DHT implementation is scalable, fault-tolerant, and efficient in terms of query latency and load balancing. In your solution, you must consider the following aspects:

• DHT Structure: Describe the type of DHT you would choose (e.g., Chord, Kademlia, or another DHT) and explain why.
• Data Distribution and Load Balancing: Explain how you would distribute the data across peers in a way that ensures load balancing and minimizes the risk of certain peers being overwhelmed while others remain idle.
• Fault Tolerance: How would you handle the failure of peers in the system? What strategies would you employ to ensure that the system remains functional even with frequent peer churn?
• Efficiency: Describe how you would optimize the DHT for query latency and overall system performance.