Proceedings ArticleDOI
Reducing Routing Overhead in a Growing DDN
J. Seeger,A. Khanna +1 more
- Vol. 1, Iss: 1
Reads0
Chats0
TLDR
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.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.read more
Citations
More filters
Book
OSPF: Anatomy of an Internet Routing Protocol
TL;DR: This book focuses on OSPF (Open Shortest Path First), a common TCP/IP routing protocol that provides robust and efficient routing support in the most demanding Internet environments and offers side-by-side comparisons of all the unicast and multicast routing protocols currently in use in the Internet.
Journal ArticleDOI
Loop-free routing using diffusing computations
TL;DR: A family of distributed algorithms for the dynamic computation of the shortest paths in a computer network or internet is presented, validated, and analyzed, and these algorithms are shown to converge in finite time after an arbitrary sequence of link cost or topological changes.
Patent
Method of multicast message distribution
TL;DR: In this article, a multicast message is forwarded along a unique set of pathways through the multicast spanning tree, which is unique to all nodes which can communicate directly by virtue of a list of known nodes.
Proceedings ArticleDOI
A unified approach to loop-free routing using distance vectors or link states
TL;DR: A distributed algorithm that provides loop-free paths at every instant and extends or improves algorithms introduced previously by Chandy and Misra, Jaffe and Moss, Merlin and Segall, and the author is described.
Journal ArticleDOI
Analysis of shortest-path routing algorithms in a dynamic network environment
Zheng Wang,Jon Crowcroft +1 more
TL;DR: In a dynamic network environment under heavy traffic load, shortest-path routing algorithms, particularly those that attempt to adapt to traffic changes, frequently exhibit oscillatory behaviors and cause performance degradation.
References
More filters
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Journal ArticleDOI
The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm
D. Baker,Anthony Ephremides +1 more
TL;DR: A self-starting, distributed algorithm is proposed and developed that establishes and maintains a reliable structure that is especially suited to the needs of the HF Intra-Task Force (ITF) communication network, which is discussed in the paper.
Journal ArticleDOI
Hierarchical routing for large networks Performance evaluation and optimization
Leonard Kleinrock,Farouk Kamoun +1 more
TL;DR: The specification, analysis and evaluation of some hierarchical routing procedures which are effective for large store-and-forward packet-switched computer networks are dealt with, finding that in the limit of a very large network, enormous table reduction may be achieved with essentially no increase in network path length.
Proceedings Article
Fault-Tolerant Broadcast of Routing Information.
TL;DR: An algorithm for the reliable broadcast of routing information throughout a network that anticipates the possibility of long-delayed packets, line and node outages, network partitions, hardware failures, and a history of arbitrarily corrupted databases throughout the network.
Journal ArticleDOI
Fault-Tolerant Broadcast of Routing Information
TL;DR: In this paper, an algorithm is presented for reliable broadcast of routing information throughout a network. But it does not consider the possibility of long-delayed packets, line and node outages, network partitions, hardware failures, and a history of arbitrarily corrupted databases throughout the network.