In Baran’s model, each switching node contained a routing table that behaved as a sort of transport coordinator or dispatcher. The routing table at each node reflected how many hops, or links, were required to reach every other node in the network. The table indicated the best routes to take and was constantly updated with information about neighboring nodes, distances, and delays—much
