Routing Optimization in Computer Networks

Ismail, Reem Jafar (2021) Routing Optimization in Computer Networks. CihanUniversity-Erbil, CihanUniversity-Erbil.

[thumbnail of Seminar] Slideshow (Seminar)
Seminar-CUE31010.pdf - Presentation
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (1MB)

Abstract

Shortest path routing refers to the process of finding paths through a network that have a minimum of distance or other cost metric. Routing of data packets on the Internet is an example involving millions of routers in a complex, worldwide, multilevel network. Optimum routing on the Internet has a major impact on performance and cost. The seminar explains the routing metrics and different routing algorithms in practical implementation.

Item Type: Other
Uncontrolled Keywords: Shortest Path, Cost Metric, Minimum Distance
Subjects: Q Science > QA Mathematics > QA76 Computer software
Divisions: Department of Computer Science > Seminars
Depositing User: ePrints Depositor
Date Deposited: 10 Oct 2024 09:02
Last Modified: 10 Oct 2024 09:02
URI: https://eprints.cihanuniversity.edu.iq/id/eprint/913

Actions (login required)

View Item
View Item