In distributed routing computation, every packet switch calculates its routing table locally and transmit messages to the neighbors. It also updates information regularly. If a packet or a link switch fails then the network adds its failure. The packet switch then changes the tables to avoid failed hardware.