1 / 16

BitHoc: Bittorent for Wireless Ad Hoc networks

BitHoc: Bittorent for Wireless Ad Hoc networks. Why was/is Bittorent hard over wireless networks?. Scarcity of the resources due to their shared nature. TCP performance drops L imited energy, bandwidth and computation power. Mobility Complexity. Design Space.

dirk
Download Presentation

BitHoc: Bittorent for Wireless Ad Hoc networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. BitHoc: Bittorent for Wireless Ad Hoc networks Nitin--7

  2. Why was/is Bittorent hard over wireless networks? • Scarcity of the resources due to their shared nature. • TCP performance drops • Limited energy, bandwidth and computation power. • Mobility • Complexity Nitin--8

  3. Design Space Nitin--9

  4. Nitin--10

  5. Nitin--11

  6. What solution is author Proposing? BitHoc • Bittorent is topology unaware so limit the scope of neighborhood. • In unstructured architectures nodes have to be aware about the scope of the neighborhood. Nitin--12

  7. Nitin--13

  8. Cont.. BitHoc • Balance between content download time and fair sharing. • Modify chocking algorithm • TTL of the message can help in deciding the scope of the neighborhood. Nitin--14

  9. Experimental Observation Nitin--15

  10. Results Piece size is an important factor(Balance!!) Nitin--16

  11. Cont… Nitin--17

  12. Cont… Nitin--18

  13. Cont… Nitin--19

  14. Problems with solutions!! • Reducing the neighborhood comes at the expense of a lower sharing ratio. • New chocking algorithms involves TCP connections with distant peers leading to performance degradation. • NEARBY NEIGHBORS TABLE (NNT) and FAR NEIGHBORS TABLE (FNT)– Extra overhead. Nitin--20

  15. What will be borrow? • Broadcasting is not a good idea. • Small size of pieces. • Central tracker can be effective solution. • Can use DHT like approaches to reduce the complexity. Nitin--21

  16. Questions? Nitin--22

More Related