Understanding Network Routing Problem and Study of Routing Algorithms and Heuristics through Implementation
In this project, we intend to identify, understand and compare various routing algorithms used in real world networks. The various objectives of this research are: 1. Define and understand the concepts of routing. 2. Determine if a Greedy or Dynamic Programming strategy algorithm is more efficient for routing, in general. Identify which strategy is used more in real world networks. 3. Identify the common routing algorithms used in networks. Identify which algorithms are used in which scenarios. 4. Identify the performance metrics for gauging algorithms. 5. Compare existing routing algorithms in various scenarios (on the simulation software). Also note specific phenomena or anomalies during simulation. 6. Think of modifications (if any) in existing routing algorithms, or devise a new routing algorithm.
