Abstract
For a mission critical message oriented middleware application, such as a financial data delivery bank system or an online stock market, both packet loss rate and latency should be guaranteed within a tolerance range. Fast and reliable recovery from link or node failures is essential. This paper presents a novel algorithm for pre-calculating routing tables and condensing them to save space. This algorithm guarantees 100% fast recovery from single link failures or single node failures. In addition, shortest path first (SPF) routing is maintained even after a failure has happened. The algorithm is compared with two other popular fast recovery schemes (i.e. IP Fast Recovery and the Resilient Routing Layers algorithm) and provides favourable results.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
