The routing strategy is generally based on parameters such as knowledge of the network topology, type and status of the intermediate links in the network, congestion, time delays being faced in the network, and the data load. Still, there are routing strategies that do not require any information about the network and can successfully route the packets to the destination by flooding or some other routing strategies. In the case of a centralized route controller, it receives knowledge of the network from each node in the network. However, in the case of a distributed routing scenario, various options are possible. In the case of distributed routing, each routing node may use the information locally available to it$,$ i$.$e$.$ the information related to the links directly connected to it to forward the packet to the appropriate link. Alternatively, the node may obtain information from its immediate neighbor and also gain information about all the links connected to its neighbor, and this adds to its knowledge of the link status and congestion in all the links associated with its neighbors. Still further, each routing node may exchange information related to its link to the nodes beyond its immediate neighbor. This may finally lead to a complete or a partially complete knowledge of the network topology and affect the routing decision. In this context described above, discuss an effective routing strategy for networks with heavy traffic. Provide examples with APA format. Read the Discussion Forum requirements under "Modules" menu item.