Abstract
This paper introduces a rerouting algorithm for ATM networks — called the Pro-Active Search Protocol — which enables efficient rerouting in a simple and uncomplicated way. Therefor the protocol performs as many tasks as possible in advance to reduce the complexity. Basically this comes to working with shortest path algorithms based on a known network topology. In order to increase the rerouting performance this is combined with real-time actions after a rerouting trigger, by collecting accurate information about the network load. This is achieved by means of a simplified distributed approach.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35388-3_42
Chapter PDF
Similar content being viewed by others
References
Han Yang, C. and Hasegawa, S. (1988) FITNESS: Failure Immunization Technology for Network Survivability. Globecom ‘88, 1549–54.
Komine, H., Chujo, T., Ogura, T., Miyazaki, K. and Soejima, T. (1990) A Distributed Restoration Algorithm for Multiple-link and Node Failures of Transport networks. IEEE 1990, 459–63.
Struyve, K., Demeester, P., Nederlof, L. and Van Hauwermeiren, L. (1996) Design and Evaluation of distributed link and path restoration algorithms for ATM meshed networks. Proceedings International Zurich Seminar on Digital Communications, ETH Zurich, Switzerland, Vol. 1044.
Lievens, I. and Demeester, P. (1996) The use of distributed restoration in intelligent routing. Proceedings of IEEE Fourth Symposium on Communications and Vehicular Technology in the Benelux.
Kawamura, R., Sato, K. and Tokizawa, I. (1992) Self-healing ATM Networks Based on Virtual Path Concept. Networks, 129–34.
Chen, S. and al. (1997) An Integrated Restoration Approach (IRA) in the ATM Network. Globecom 1997, 1388–92.
The ATM Forum Technical Committee. (1996) Private Network-Network Interface Specification Version 1.0 (PNNI 1.0). af-pnni-0055.000, March 1996.
Yen, J.Y. (1971) Finding the k shortest loopless paths in a network. Management Science, Vol. 17, 712–16.
Shier, D.R. (1979) On Algorithms for Finding the k Shortest Paths in a Network. Networks, Vol. 9, 195–214.
Grover, W.D. (1987) The Self-Healing Network: a fast distributed restoration technique for networks using digital cross-connect machines. Globecom 1987, 1090–5.
ITU Recommendation Z.100 SDL-88. (1989) Functional Specification and Description Language.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Lievens, I., Cattrysse, T., Demeester, P. (1998). Fast Rerouting in ATM Networks: Pro-Active Search protocol. In: van As, H.R. (eds) High Performance Networking. HPN 1998. IFIP — The International Federation for Information Processing, vol 8. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35388-3_11
Download citation
DOI: https://doi.org/10.1007/978-0-387-35388-3_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5397-4
Online ISBN: 978-0-387-35388-3
eBook Packages: Springer Book Archive