I'm not entirely sure if this question has been asked before, so apologies if it has.
I'm studying computer science at university and I've had two modules: Data Communication and Networking; Artificial Intelligence.
In networking we've been learning about routing and connecting routers together in order to transfer data (mainly discussing different types of protocols).
In AI, we used the A* Search as a path finding algorithm from a start node to a goal node in a graph with walls and traps.
My main question is: Is it possible for A* Search to be used in routing?
I understand that you would need to identify a form of cost between network nodes and find a suitable heuristic to do so. I'm more interested to know if something like that could work, and if not, then how?