Reducing Routing Overhead in a Growing DDN
- 1 October 1986
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 15.3.1-15.3.13
- https://doi.org/10.1109/milcom.1986.4805715
Abstract
The Defense Data Network (DDN), based on ARPANET technology, is expanding rapidly. One segment of the DDN, the MILNET, will include 250 packet switching nodes by the end of 1987 and as many as 700 by 1991. One obstacle that must be overcome to allow this growth is the overhead associated with the current ARPANET dynamic routing mechanism. Both link utilization due to routing updates and routing computational load are roughly proportional to network size. This paper presents three approaches to reducing routing overhead and includes both modifications to the existing routing scheme and a design for a hierarchical extension.Keywords
This publication has 11 references indexed in Scilit:
- Hierarchical networks and the subnetwork partition problemComputer Networks and ISDN Systems, 1985
- Hierarchical Routing for Very Large NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Fault-tolerant broadcast of routing informationComputer Networks (1976), 1983
- A hierarchical scheme for multiobjective adaptive routing in large communication networksProceedings of the IEEE, 1983
- The Architectural Organization of a Mobile Radio Network via a Distributed AlgorithmIEEE Transactions on Communications, 1981
- Optimal clustering structures for hierarchical topological design of large computer networksNetworks, 1980
- Stochastic performance evaluation of hierarchical routing for large networksComputer Networks (1976), 1979
- A design study of a hierarchically connected packet-switching network using simulation techniquesComputer Networks (1976), 1979
- Hierarchical routing for large networks Performance evaluation and optimizationComputer Networks (1976), 1977
- A note on two problems in connexion with graphsNumerische Mathematik, 1959