Question

2. (15pts) In a Peer-to-Peer system, "peers" are computers/devices which are connected to each other via the Internet. Files can be shared directly between peers without the need of a central server. Consider the scenario where every peer exchanges with its neighbors to obtain n distinct segments, i.e., segment 1, n, to reconstruct a file. Suppose that time is chopped into slots of uniform interval. Under certain strategy, in each slot, peer v receives one segment out of the n distinct segments uniformly at random. Let T be the number of slots peer v needs to wait until it receives all then distinct segments. Compute Etn. (Note: n Ση:1 Asninn.)

Answer 1

Answer:

In a peer to peer system

"peers" are computers/devices (connected to each other via the internet)

Files can be shared directly between peers with out the need of a central server

• peer to peer networks connect many end hosts in an ad-hoc manner. P2P networks have been typically used for file sharing applications, which enable peer to share digitized content such as general documents, audio, video, elctronic books etc.
• More advanced applications such as real tme conferences, online gaming and media streaming have been deployed over such networks.