Surge routing in ATM networks
A.L. Redey, M.J. Morse, A. Platt · 2002
Most routing algorithms currently proposed for ATM networks are adaptive. A database containing up to date information on the current network status is created and maintained using a suitable flooding algorithm which distributes information on current network status. Acceptable routing algorithms will use efficient flooding algorithms (when, where and what!). This paper presents a fundamentally new approach to the routing problem which uses controlled flooding to discover optimal routes. The new algorithm, surge routing, outperforms current proposals in terms of generating less overhead traffic, producing faster and better routing decisions and demanding less memory and processing resources.