P2P applications a) Hash functions are primarily used in hash tables to quickly

Question

P2P applications a) Hash functions are primarily used in hash tables to quickly locate a data record given its search key. Please give some properties of good hash functions. Please list at least three and explain. b) What are some properties that are expected for a distributed hash table? Please list at least three. c) In the circular DHT example in Section 2.6.2, suppose that peer 3 learns that peer 5 has left. How does peer 3 update its success state information? Which peer is now its first successor? Its second successor?

Explanation / Answer

1.Applications op P2P:

1.Fault tolerance

2.Bit Torrent

3.Application and Desktop Deployment:

1.Distribute

2.File sharing Tribler

3.Private file sharing Pando

4.Peer casting

5.Free cast

4.Content Distribution

1.Babelgum

2.BlinkX BBTV

3.BBC iplayer

4.Grid networks

5.Jaman

6.Joost

7.Live station

5.Real time communication

1.skype

6.Adobe flash player

7.Web search engines

1.YaCy

2.FAROO

8.Privacy protection

1.Tor

9.Business

1.coolans Workspace

10.Government

1.P2P -Next

2) Three properties of hash function:

1. Performance: Easy to compute H(m).

2.One-way-property:Given H(m) but not m,its computationally infeasible to find m.

3. Weak collision resistance: Given H(m) but not m its computationally infeasible to find m H(m')=H(m).

3) Distributed hash table properties:

1.Autonomy and decentralization: The nodes collectively from the system without any central coordination.

2.Fault tolerance: The system should be reliable even with nodes continously joining,leaving,failing.

3.Scalability: The system should function efficiently even with thousands of nodes.

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.