Arpit’s Newsletter
Subscribe
Sign in
Home
Career Growth
System Design
Deep Dives
Papers and Musings
Outage Dissections
About
Deep Dives
Latest
Top
Discussions
Exploiting and stealing from the BitTorrent network
P2P networks are prone to exploitation as there is no central authority to keep track of the activity. BitTorrent is not different, and it is easy for…
Sep 24, 2022
•
Arpit Bhayani
1
Share this post
Exploiting and stealing from the BitTorrent network
arpit.substack.com
Copy link
Facebook
Email
Note
Other
Kademlia - a Distributed Hash Table implementation to power the overlay network of BitTorrent
Kademlia is a P2P Distributed Hash Table implementation that distributes the KV stores across nodes in a network and retrieves them without any central…
Sep 22, 2022
•
Arpit Bhayani
1
Share this post
Kademlia - a Distributed Hash Table implementation to power the overlay network of BitTorrent
arpit.substack.com
Copy link
Facebook
Email
Note
Other
The Piece Selection algorithm that makes BitTorrent fault tolerant
In a BitTorrent network, the file is split into pieces and then distributed across the network. A piece is a unit of transmission and when a peer has…
Sep 20, 2022
•
Arpit Bhayani
4
Share this post
The Piece Selection algorithm that makes BitTorrent fault tolerant
arpit.substack.com
Copy link
Facebook
Email
Note
Other
The Choke Algorithm that powers BitTorrent
In a P2P network, every peer would want to download the file as fast as possible but this would lead to a skewed load on some peers. BitTorrent…
Sep 17, 2022
•
Arpit Bhayani
2
Share this post
The Choke Algorithm that powers BitTorrent
arpit.substack.com
Copy link
Facebook
Email
Note
Other
Overview of the BitTorrent architecture
The BitTorrent Architecture BitTorrent architecture consists of the following entities Torrent File Tracker Leecher Seeders Each torrent is independent…
Sep 15, 2022
•
Arpit Bhayani
2
Share this post
Overview of the BitTorrent architecture
arpit.substack.com
Copy link
Facebook
Email
Note
Other
Understanding the Torrent File Format and Bencoding
A torrent file is an independent session of transfer. To distribute a file, say an Ubuntu image, we would create a torrent holding the meta information…
Sep 13, 2022
•
Arpit Bhayani
3
Share this post
Understanding the Torrent File Format and Bencoding
arpit.substack.com
Copy link
Facebook
Email
Note
Other
Introduction to BitTorrent and the problem it beautifully solves
BitTorrent is a peer-to-peer protocol that makes the distribution of large files easier, faster, and more efficient. Need for BitTorrent To download a…
Sep 10, 2022
•
Arpit Bhayani
5
Share this post
Introduction to BitTorrent and the problem it beautifully solves
arpit.substack.com
Copy link
Facebook
Email
Note
Other
Implementing Hash Maps with Hash Tables
A map, when implemented with Hash Tables, is called a Hash Map; and just like a regular map it supports operations like put, get, and iterate. Key…
Sep 8, 2022
•
Arpit Bhayani
2
Share this post
Implementing Hash Maps with Hash Tables
arpit.substack.com
Copy link
Facebook
Email
Note
Other
Implementing Hash Sets with Hash Tables
The set data structure, when implemented with Hash Tables, is called a Hash Set; and just like a regular set, it supports operations like Union…
Sep 6, 2022
•
Arpit Bhayani
1
Share this post
Implementing Hash Sets with Hash Tables
arpit.substack.com
Copy link
Facebook
Email
Note
Other
Implementing Resize of a Hash Table
Resizing a Hash Table is important to maintain consistent performance and efficiency, but how do we actually implement it? Resize is all about…
Sep 3, 2022
•
Arpit Bhayani
Share this post
Implementing Resize of a Hash Table
arpit.substack.com
Copy link
Facebook
Email
Note
Other
Why are Hash Tables always doubled?
To maintain consistent performance, the hash table has to be resized - be it growing or shrinking. The trigger to resize depends on the load factor…
Sep 1, 2022
•
Arpit Bhayani
Share this post
Why are Hash Tables always doubled?
arpit.substack.com
Copy link
Facebook
Email
Note
Other
Getting the best performance from the Hash Table
Hash Tables are designed to give a constant time performance and to do this, it needs to have many slots available. Since we cannot allocate a huge…
Aug 30, 2022
•
Arpit Bhayani
1
Share this post
Getting the best performance from the Hash Table
arpit.substack.com
Copy link
Facebook
Email
Note
Other
Share
Copy link
Facebook
Email
Note
Other
This site requires JavaScript to run correctly. Please
turn on JavaScript
or unblock scripts