Understanding Network Routing Problem and Study of Routing Algorithms and Heuristics through Implementation
Keywords:
routing, throughput, latency, greedy strategy, dynamic programming
Abstract
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.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2017-10-15
Issue
Section
License
Copyright (c) 2017 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.