Showing papers on "Optimized Link State Routing Protocol published in 1992"
01 Apr 1992
TL;DR: This paper analysis storage complexity of the IDRP protocol and suggests possible local techniques for reducing it.
Abstract: IDRP is an inter-domain routing protocol that is based on the path-vector routing algorithm. This paper analysis storage complexity of the protocol and suggests possible local techniques for reducing it.
8 citations
01 Apr 1992
TL;DR: The steady-state response of link-state and loop-free distance-vector routing algorithms to multiple changes in the costs of links is investigated and suggests that it may be possible to correlate the performance of the routing algorithms with various parameters that can be used to characterize networks.
Abstract: The steady-state response of link-state and loop-free distance-vector routing algorithms to multiple changes in the costs of links is investigated. A quantitative comparison of an ideal link-state algorithm similar to the one used in the open shortest path first (OSPF) and in the OSI intradomain routing protocol, and a new loop-free distance-vector algorithm, is made for several computer network topologies. A variety of quantities, including the length of messages and the average number of paths affected by routing loops, are computed as a function of time after a link or node change. Probabilities of various conditions, including the existence of loops, are also obtained as a function of time. The results show that in steady state, a loop-free distance-vector algorithm operates with essentially the same communication overhead as the ideal link state algorithm, and requires substantially fewer CPU cycles. The results also suggest that it may be possible to correlate the performance of the routing algorithms with various parameters that can be used to characterize networks. >
5 citations
10 May 1992
TL;DR: The results of performance evaluation of the packet delay show that the MARION protocol is outperformed by the DOR/FRAN protocol, which could therefore be considered to be more suitable for PROMETHEUS applications with real-time requirements.
Abstract: The results of a performance evaluation by analysis using Markov models of the adaptive multihop routing protocols DOR/FRAN and MARION for access from vehicles to an infrastructure network are presented. In the Markov model for the direction-oriented routing protocol (DOR/FRAN) implicit ACKs and retransmissions are taken into account. It is shown that the Markov model of the MARION protocol, which becomes more complex as the number of direct neighbors of a station increases, can be simplified if a large number of direct neighbors is assumed. The probability that a transmitted packet reaches the next beacon is calculated. The results of performance evaluation of the packet delay show that the MARION protocol is outperformed by the DOR/FRAN protocol, which could therefore be considered to be more suitable for PROMETHEUS applications with real-time requirements, and to be an appropriate adaptive multihop routing protocol candidate for the network layer of an integrated vehicle-vehicle and vehicle-beacon communication network. >
4 citations