Routing protocols
Routing protocol goal is to determine “good” paths (equivalently, routes), from sending hosts to receiving host, through network of routers:
- Path: sequence of routers packets will traverse in going from given initial source host to given final destination host
- “good”: least “cost”, “fastest”, “least congested”
Routing algorithms use graph abstractions of the network.
Figure 12 A graph abstraction of a network
-
Project
Contact
This resource was developed as part of an Erasmus+ project, funded with support from the European Commission under grant agreement 2016-1-SE01-KA203-22064.
The project was a collaboration between:
- The University of Borås, Sweden
- The University of the Highlands and Islands, Scotland
- The University of Alcalá, Spain
- Digital Connections, Scotland
This resource has been released under Creative Commons license CC-BY-SA 4.0.
Disclaimer
If you would like more information on this resource please contact:
- Academic content – The University of Alcalá (https://www.uah.es/en/)
- Technical resource development – The University of the Highlands and Islands Educational Development Unit - EDU (edu@uhi.ac.uk)
Except where otherwise noted, this website is licensed under Creative Commons license CC-BY-SA 4.0. All images used under permission remain the copyright of the license holder.
Download a copy of this resource in PDF format.
You can also print individual pages by printing directly from the browser.
-
