System Design for SDE-2 and above: [ Ссылка ]
System Design for Beginners: [ Ссылка ]
Redis Internals: [ Ссылка ]
Build Your Own Redis / DNS / BitTorrent / SQLite - with CodeCrafters.
Sign up and get 40% off - [ Ссылка ]
In the video, I discussed the importance of finding the most efficient path for messages in distributed systems. Traditional shortest path algorithms cannot be directly applied due to the lack of centralized information in distributed setups. I explained a variant of the Bellman-Ford shortest path algorithm tailored for distributed settings. Emphasizing the need for a single-source all-node shortest path algorithm, I highlighted factors like congestion, communication overhead, and cost considerations in determining the optimal path. Lastly, I covered the complexity analysis of the approach, focusing on time and communication complexities in distributed systems.
# Recommended videos and playlists
If you liked this video, you will find the following videos and playlists helpful
System Design: [ Ссылка ]
Designing Microservices: [ Ссылка ]
Database Engineering: [ Ссылка ]
Concurrency In-depth: [ Ссылка ]
Research paper dissections: [ Ссылка ]
Outage Dissections: [ Ссылка ]
Hash Table Internals: [ Ссылка ]
Bittorrent Internals: [ Ссылка ]
# Things you will find amusing
Knowledge Base: [ Ссылка ]
Bookshelf: [ Ссылка ]
Papershelf: [ Ссылка ]
# Other socials
I keep writing and sharing my practical experience and learnings every day, so if you resonate then follow along. I keep it no fluff.
LinkedIn: [ Ссылка ]
Twitter: [ Ссылка ]
Weekly Newsletter: [ Ссылка ]
Thank you for watching and supporting! it means a ton.
I am on a mission to bring out the best engineering stories from around the world and make you all fall in
love with engineering. If you resonate with this then follow along, I always keep it no-fluff.
