DCSC.2021.040

Routing Optimization in Computer Networks

Reem Jafar Ismail

reem.jafar@cihanuniversity.edu.iq

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.

Keywords- shortest path, cost metric, minimum distance

Date: 3/10/2021

Place: Department of Computer Science