To: Author
Article Fingerprint
ReserarchID
CSTNWSL8R61
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.
Saumya Shandilya. 2018. \u201cUnderstanding Network Routing Problem and Study of Routing Algorithms and Heuristics through Implementation\u201d. Global Journal of Computer Science and Technology - E: Network, Web & Security GJCST-E Volume 17 (GJCST Volume 17 Issue E5): .
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 101
Country: India
Subject: Global Journal of Computer Science and Technology - E: Network, Web & Security
Authors: Saumya Shandilya (PhD/Dr. count: 0)
View Count (all-time): 257
Total Views (Real + Logic): 6190
Total Downloads (simulated): 1518
Publish Date: 2018 01, Fri
Monthly Totals (Real + Logic):
This paper attempted to assess the attitudes of students in
Advances in technology have created the potential for a new
Inclusion has become a priority on the global educational agenda,
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.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.