28/02/2008. MAESTRO/PLANETE INFORMEL SEMINARY. BitHoc: BitTorrent for wireless ad hoc networks. Mohamed Karim Sbaï. Jointly with: Chadi Barakat Jayeoung Choi Anwar Al Hamra Thierry Turletti. EPI PLANETE. Wireless ad hoc networks.
Mohamed Karim Sbaï
Anwar Al Hamra
How will such applications perform in wireless ad hoc networks ? What are the modifications (namely in overlay construction) to be made to ameliorate both download time and sharing ratios ?
Only 4 simultaneous connections:
3 best uploaders + 1 a random peer (discovering new upload capacities )
Enforce cooperation and reciprocity among peers
This increases the entropy of pieces in the network and then the chance to replicate pieces after downloading them.
Ad hoc scenario
q = number of slots near / number of slots far
Goal: send a copy of each piece to the end of the network and wait for it to return to the middle of the network.
αi : average number of pieces sent at i hops in a choking slot.
q = 1 for 40 nodes
q = 3 for 80 nodes
Comparing static to dynamic choice of q: average finish timeBitHoc: dynamic choice of q
Comparing static to dynamic choice of q: average sharing ratioBitHoc: dynamic choice of q