*** 22 Sept 2022 - This Course is under Development ***

This Course aims at Explaining and Implementing the Data Structures Required to Implement IPV4 Routing Table and Access Control Lists. Both these features are ubiquitously used in Networking/Embedded/Distributed System/Cloud Computing etc, and hence we decided to throw a course on explaining the internal design and implementation.

We shall be going to build a Library called mtrie library, which will form the foundation for implementing IPV4 Routing Table and Access Control List framework. Trie is a popular standard data structure and its variant is used to solve different types of industry problems.

We shall be building Cisco like Access Control List which is used for Security, Controlling the traffic flow Or restricting the access & permissions to the user to certain resources over the network. Below is Cisco Example. We shall be going to re-invent the wheel.

access-list allow_traffic permit UDP 122.1.1.1 255.255.255.255 40.1.1.1 255.255.255.255

access-list allow_traffic permit UDP 122.1.1.0 255.255.255.0 40.1.1.0 255.255.255.0

access-list allow_traffic permit UDP 122.1.0.0 255.255.0.0 40.0.0.0 255.255.0.0

access-list allow_traffic deny any 0.0.0.0 0.0.0.0

This Course is Data Structure and Algorithmic Intensive, and We shall be showing all demonstrations in C/C++. However, you are free to implement the explained concepts in the language of your choice.

𝐏𝐫𝐞-𝐑𝐞𝐪𝐮𝐢𝐬𝐭𝐞

It's desirable you understand how Subnet Masks work, and a very basic Networking background is required. This Course is exclusively designed for Intermediate to advanced developers only. If you are still struggling with programming basics, pls excuse this course. The complexity level of this course is intermediate, and not for beginners. You will need to do a lot of Bit-Level Programming in this course.

𝐄𝐧𝐝 𝐏𝐫𝐨𝐝𝐮𝐜𝐭

The end product of this course is that you will have fully working Routing Table and Access Control List Libraries which you can further integrate into your other projects readily or decorate your resume with these milestones.

𝐓𝐚𝐛𝐥𝐞 𝐨𝐟 𝐂𝐨𝐧𝐭𝐞𝐧𝐭𝐬

1. 𝐖𝐡𝐚𝐭 𝐢𝐬 𝐀𝐜𝐜𝐞𝐬𝐬 𝐂𝐨𝐧𝐭𝐫𝐨𝐥 𝐋𝐢𝐬𝐭 𝐚𝐧𝐝 𝐡𝐨𝐰 𝐝𝐨𝐞𝐬 𝐢𝐭 𝐰𝐨𝐫𝐤?

2. 𝐖𝐡𝐚𝐭 𝐢𝐬 𝐭𝐡𝐞 𝐋𝐨𝐧𝐠𝐞𝐬𝐭 𝐩𝐫𝐞𝐟𝐢𝐱 𝐌𝐚𝐭𝐜𝐡?

3. 𝐓𝐫𝐢𝐞 𝐃𝐚𝐭𝐚 𝐒𝐭𝐫𝐮𝐜𝐭𝐮𝐫𝐞

4. 𝐎𝐩𝐭𝐢𝐦𝐢𝐳𝐢𝐧𝐠 𝐓𝐫𝐢𝐞 𝐭𝐨 𝐜𝐨𝐧𝐬𝐭𝐫𝐮𝐜𝐭 𝐑𝐨𝐮𝐭𝐢𝐧𝐠 𝐓𝐚𝐛𝐥𝐞 𝐃𝐚𝐭𝐚 𝐒𝐭𝐫𝐮𝐜𝐭𝐮𝐫𝐞 ( 𝐜𝐚𝐥𝐥𝐞𝐝 𝐦𝐭𝐫𝐢𝐞 )

• 𝐑𝐨𝐮𝐭𝐞 𝐈𝐧𝐬𝐞𝐫𝐭𝐢𝐨𝐧 𝐀𝐥𝐠𝐨𝐫𝐢𝐭𝐡𝐦
• 𝐑𝐨𝐮𝐭𝐞 𝐃𝐞𝐥𝐞𝐭𝐢𝐨𝐧 𝐀𝐥𝐠𝐨𝐫𝐢𝐭𝐡𝐦
• 𝐑𝐨𝐮𝐭𝐞 𝐒𝐞𝐚𝐫𝐜𝐡 𝐀𝐥𝐠𝐨𝐫𝐢𝐭𝐡𝐦
• 𝐋𝐨𝐧𝐠𝐞𝐬𝐭 𝐏𝐫𝐞𝐟𝐢𝐱 𝐌𝐚𝐭𝐜𝐡 𝐀𝐥𝐠𝐨𝐫𝐢𝐭𝐡𝐦

<< 𝐃𝐞𝐥𝐢𝐯𝐞𝐫𝐞𝐝 𝐓𝐢𝐥𝐥 𝐡𝐞𝐫𝐞 𝐚𝐬 𝐨𝐧 22 𝐒𝐞𝐩𝐭 2022 >>

5. 𝐁𝐮𝐢𝐥𝐝𝐢𝐧𝐠 𝐑𝐨𝐮𝐭𝐢𝐧𝐠 𝐓𝐚𝐛𝐥𝐞 𝐂𝐑𝐔𝐃 𝐀𝐏𝐈𝐬 𝐨𝐯𝐞𝐫 𝐌𝐭𝐫𝐢𝐞 𝐃𝐚𝐭𝐚 𝐒𝐭𝐫𝐮𝐜𝐭𝐮𝐫𝐞  

6. 𝐈𝐦𝐩𝐥𝐞𝐦𝐞𝐧𝐭𝐢𝐧𝐠 𝐀𝐜𝐜𝐞𝐬𝐬 𝐂𝐨𝐧𝐭𝐫𝐨𝐥 𝐋𝐢𝐬𝐭 𝐎𝐯𝐞𝐫 𝐌𝐭𝐫𝐢𝐞 𝐃𝐚𝐭𝐚 𝐒𝐭𝐫𝐮𝐜𝐭𝐮𝐫𝐞

• 𝐂𝐨𝐦𝐩𝐢𝐥𝐢𝐧𝐠 𝐀𝐂𝐋 𝐑𝐮𝐥𝐞 𝐢𝐧𝐭𝐨 𝐓𝐂𝐀𝐌 𝐞𝐧𝐭𝐫𝐲 𝐟𝐨𝐫𝐦𝐚𝐭
• 𝐈𝐧𝐬𝐭𝐚𝐥𝐥𝐢𝐧𝐠 𝐀𝐂𝐋 𝐑𝐮𝐥𝐞
• 𝐔𝐧𝐢𝐧𝐬𝐭𝐚𝐥𝐥𝐢𝐧𝐠 𝐀𝐂𝐋 𝐑𝐮𝐥𝐞
• 𝐀𝐂𝐋 𝐥𝐨𝐨𝐤𝐮𝐩 𝐛𝐚𝐬𝐞𝐝 𝐨𝐧 𝐋𝐨𝐧𝐠𝐞𝐬𝐭 𝐏𝐫𝐞𝐟𝐢𝐱 𝐌𝐚𝐭𝐜𝐡

7. 𝐓𝐞𝐬𝐭𝐢𝐧𝐠 𝐨𝐮𝐫 𝐂𝐨𝐝𝐞𝐬 𝐚𝐧𝐝 𝐋𝐢𝐛𝐫𝐚𝐫𝐢𝐞𝐬

𝐂𝐮𝐫𝐫𝐢𝐜𝐮𝐥𝐮𝐦