Open Access
OSPF Version 2
J. Moy
- Vol. 1247, pp 1-189
Reads0
Chats0
TLDR
This memo documents version 2 of the OSPF protocol, a link-state routing protocol designed to be run internal to a single Autonomous System.Abstract:
This memo documents version 2 of the OSPF protocol. OSPF is a link-state routing protocol. It is designed to be run internal to a single Autonomous System. Each OSPF router maintains an identical database describing the Autonomous System's topology. From this database, a routing table is calculated by constructing a shortest- path tree.read more
Citations
More filters
Dynamic Source Routing in Ad Hoc Wireless Networks.
David B. Johnson,David A. Maltz +1 more
TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Book ChapterDOI
Dynamic Source Routing in Ad Hoc Wireless Networks
David B. Johnson,David A. Maltz +1 more
TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Journal ArticleDOI
A scalable, commodity data center network architecture
TL;DR: This paper shows how to leverage largely commodity Ethernet switches to support the full aggregate bandwidth of clusters consisting of tens of thousands of elements and argues that appropriately architected and interconnected commodity switches may deliver more performance at less cost than available from today's higher-end solutions.
Proceedings ArticleDOI
On-demand multipath distance vector routing in ad hoc networks
Mahesh K. Marina,Samir R. Das +1 more
TL;DR: Performance comparison of AOMDV with AODV is able to achieve a remarkable improvement in the end-to-end delay-often more than a factor of two, and is also able to reduce routing overheads by about 20%.
Journal ArticleDOI
An efficient routing protocol for wireless networks
TL;DR: WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties and its performance is compared by simulation with the performance of the distributed Bellman-Ford Algorithm, DUAL, and an Ideal Link-state Algorithm.