THE GRAPHS AND C++ LANGUAGE APPLIED TO ROUTING PROTOCOLS

In this article we will study some basic problems defined on graphs and computer networks. In particular we propose to examine the analogies between networks and the mathematical theory of weighted and unweighted graphs, applied to routing protocols. In a network a sending host is directly connected to the so-called default router origin (or first hop) present in its network segment and transfers all the packets it has to send to it. The problem to be solved, which is that of routing a packet between the source and destination hosts, can clearly be traced back to the problem of routing the packet between these two routers.Routing a packet over a network is the same as finding a "path" between source and destination: moreover, the path sought must be as short as possible, i.e. we are looking for a minimum path.