Title :
On the graceful degradation of routing given insufficient resources
Author :
Tsuchiya, Paul F.
Author_Institution :
Mitre Corp., McLean, VA, USA
Abstract :
The author explores algorithms where resource-starved nodes can still function to their fullest useful capacity without creating loops. One such algorithm is efficient compared to standard SPF-style algorithms. In nearly all cases, the paths found using the algorithm are the shortest possible for the given insufficient resources
Keywords :
switching networks; telecommunication networks; algorithms; graceful degradation; insufficient resources; resource-starved nodes; routing; ARPANET; Bandwidth; Clustering algorithms; Computer crashes; Degradation; Heuristic algorithms; Radio network; Routing; Steady-state; Topology;
Conference_Titel :
Local Computer Networks, 1989., Proceedings 14th Conference on
Conference_Location :
Mineapolis, MN
Print_ISBN :
0-8186-1968-6
DOI :
10.1109/LCN.1989.65270
