scispace - formally typeset
Search or ask a question

Showing papers on "Optimized Link State Routing Protocol published in 1990"


Proceedings ArticleDOI
01 Aug 1990
TL;DR: It is concluded that an architecture based upon source routing, a link state algorithm, and policy information in the link state advertisements, is best able to address the long-term policy requirements of inter-AD routing.
Abstract: Policy Routing (PR) is a new area of development that attempts to incorporate policy related constraints on inter-Administrative Domain (AD) communication into the route computation and forwarding of inter-AD packets.Proposals for inter-AD routing mechanisms are discussed in the context of a design space defined by three design parameters: location of routing decision (i.e., source or hop-by-hop), algorithm used (i.e., link state or distance vector), and expression of policy in topology or in link status. We conclude that an architecture based upon source routing, a link state algorithm, and policy information in the link state advertisements, is best able to address the long-term policy requirements of inter-AD routing. However, such an architecture raises several new and challenging research issues related to scaling.

37 citations


Proceedings ArticleDOI
02 Dec 1990
TL;DR: A novel routing protocol for computer networks is designed by combining two routing protocols that adapt to changes in the network topology that has a wide domain of applicability that does not depend on the frequency of changes inThe network topologies.
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. >

31 citations


Proceedings ArticleDOI
01 Aug 1990
TL;DR: The main idea behind the approach is to use a “dynamic synchronizer”, which transforms a dynamic asynchronous network into static synchronous one, which is an important methodology in design and analysis of communication protocols.
Abstract: In this paper, we survey the existing methods for designing shortest paths routing algorithms for dynamic networks. We compare them based on worst-case communication and message complexity, and suggest new approach that yields a protocol with linear time and polynomial communication.The main idea behind our approach is to use a “dynamic synchronizer”, which transforms a dynamic asynchronous network into static synchronous one. We believe this is an important methodology in design and analysis of communication protocols, that can be applied to other problems as well.

11 citations


Proceedings ArticleDOI
02 Dec 1990
TL;DR: A link status routing algorithm required each node to know the current status of all the links in the network, but the authors describe a link status update protocol designed for a highspeed network that uses the best-effort model of packet delivery, but is fault-tolerant.
Abstract: A link status routing algorithm required each node to know the current status of all the links in the network. Nodes use a link status update protocol that helps in keeping the database at each node up-to-date. The authors describe a link status update protocol designed for a highspeed network. The protocol uses the best-effort model of packet delivery, but is fault-tolerant. It uses an algorithm for fast propagation of link status updates that is optimized for the expected case when no update packets are lost, and no link or node failures occur. The protocol uses a separate mechanism to detect and recover from errors caused by loss of updates and failure of nodes or links. >

7 citations


Proceedings ArticleDOI
30 Sep 1990
TL;DR: A new bridge protocol for route determination in a multiple-ring network is introduced, its main advantage is its communication efficiency: the number of frames used is thenumber of rings plus the numberof bridges in the network, as opposed to the exponential function needed by the existing protocol.
Abstract: The issue of routing in multiple-ring networks is considered. A new bridge protocol for route determination in a multiple-ring network is introduced. Its main advantage is its communication efficiency: the number of frames used is the number of rings plus the number of bridges in the network, as opposed to the exponential function needed by the existing protocol. Some extensions of the protocol are given. The correctness proof for the new protocol is presented. >