Route recovery schemes for link and node failure and link congestion

Link/Node failure occurs frequently causing service disruption in computer networks. Hardware techniques have been developed to protect the network from Link/Node failure. These techniques work in physical layer, therefore their convergence time is very small. On the other hand, many schemes have been proposed to mitigate the failure influence on the network. These schemes work in upper layers such as the network layer. However, hardware solutions faster than other schemes, but they are expensive. Link/Node failure causes all flows which were using the failed link/node are temporarily interrupted till a new path reestablished. Three recovery algorithms have been proposed that mitigate the changes occur in the network. These changes are link/node failure and link congestion. The algorithms mainly pre-compute a backup next hop for each destination in the network. This path is feasible to accommodate re-routed traffic when a failure occurs without causing congestion or loops. Simulations have been conducted to show the performance of the proposed algorithms using ns2 network simulation tool. The results show fast recovery for all flows were using the link/node failure. Furthermore, the throughput per node also increases due to decrease interruption service time.

Name thesis:degree_name

Master of Science in Computer Engineering - (M.S.)

Discipline thesis:degree_discipline

Electrical and Computer Engineering

Year

2007

Author dc:creator

• Takouna, Ibrahim

Contributors dc:contributor

• Roberto Rojas-Cessa
• Nirwan Ansari
• Edwin Hou

• Recovery algorithms
• Link failure
• Node failure
• Link congestion
• Computer networks
• Computer Engineering

Repository record dc:identifier

https://digitalcommons.njit.edu/theses/398

OAI identifier oai:identifier

oai:digitalcommons.njit.edu:theses-1397