Routing Table - NETWORK ENCYCLOPEDIA

SOLVED:7. Here is a simple heuristic (approximation algorithm) for routing a message from node A to node B in a reasonable amount of time. The algorithm assumes that every node in the network has at least two outgoing links. Assume A has n outgoing links, n ≥2, with delays to the nodes on the other end of a1 a2, …, an. Select the link with the shortest delay and send the message on that line. If the message arrives at node B, you are done. Otherwise, repeat this process until the message does ar