Composite routing protocols
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A novel routing protocol for computer networks is designed by combining two routing protocols that adapt to changes in the network topology. The first routing protocol is expensive to operate but yields shortest-paths in the networks; therefore, it is best used when changes in the network topology are rare. The second routing protocol is not as costly to operate, but may yield longer paths; hence, it is best used when changes in the network topology are frequent. By combining these two protocols, the resulting protocol has a wide domain of applicability that does not depend on the frequency of changes in the network topology.Keywords
This publication has 7 references indexed in Scilit:
- Adaptive programmingIEEE Transactions on Software Engineering, 1991
- Distributed resetLecture Notes in Computer Science, 1990
- A unified approach to loop-free routing using distance vectors or link statesPublished by Association for Computing Machinery (ACM) ,1989
- Token systems that self-stabilizeIEEE Transactions on Computers, 1989
- Termination detection for diffusing computationsInformation Processing Letters, 1980
- The New Routing Algorithm for the ARPANETIEEE Transactions on Communications, 1980
- Self-stabilizing systems in spite of distributed controlCommunications of the ACM, 1974