scispace - formally typeset
Search or ask a question

Showing papers on "Hazy Sighted Link State Routing Protocol published in 1990"


Journal ArticleDOI
Peter Key1, G.A. Cope
TL;DR: Schemes that do not explicitly use much information about the state of networks are briefly surveyed, with the focus on dynamic alternative routing (DAR), a simple but highly effective routing method currently planned for the British Telecom Network.
Abstract: Schemes that do not explicitly use much information about the state of networks are briefly surveyed, with the focus on dynamic alternative routing (DAR), a simple but highly effective routing method currently planned for the British Telecom Network. State-dependent routing and how some of the methodology also has bearing on the control issue are discussed. The problem of dimensioning a network that uses dynamic routing (i.e. how much capacity is needed and where it should be put to provide an acceptable performance) is addressed. A practical example, which refers to routing in an international access network, is discussed. Some conclusions are drawn on the benefits and drawbacks of distributed routing. >

40 citations


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
17 Jun 1990
TL;DR: An isolated routing algorithm for adaptive dynamic routing in communications networks that is based on a neural network approach has been developed and has been implemented in a software simulation running on a Sun workstation.
Abstract: An isolated routing algorithm for adaptive dynamic routing in communications networks that is based on a neural network approach has been developed. A neural network is located within each site of a communications network, and it uses the patterns of incoming traffic to maintain and dynamically update an internal representation of the global topology of the communications network. The information stored in the neural network models is updated using various routing paradigms, including Hebbian learning. The scheme has been implemented in a software simulation running on a Sun workstation

13 citations


Proceedings ArticleDOI
03 Jun 1990
TL;DR: An investigation is conducted of a metropolitan area network that is an extension to the Manhattan street network and features a three-connected, regular mesh topology, and it is established through simulation that the increased interconnectivity of the TAC gives a significant boost in performance over the MSN at a cost of more physical links and node complexity.
Abstract: An investigation is conducted of a metropolitan area network that is an extension to the Manhattan street network (MSN) and features a three-connected, regular mesh topology. The design of a triangularly arranged connection (TAC) node is discussed, and the basic layout of the network is examined. The underlying routing approach of the network is explored and explained through a routing example. It is established through simulation that the increased interconnectivity of the TAC gives a significant boost in performance over the MSN at a cost of more physical links and node complexity. >

10 citations


Journal ArticleDOI
TL;DR: A multiorder routing strategy is developed which is loop-free even in the presence of link/node failures and a systematic procedure for striking a compromise between the operational overhead and network adaptability is proposed.
Abstract: A multiorder routing strategy is developed which is loop-free even in the presence of link/node failures. Unlike most conventional methods in which the same routing strategy is applied indiscriminately to all nodes in the network, nodes under this proposal may adopt different routing strategies according to the network structure. Formulas are developed to determine the minimal order of routing strategy for each node to eliminate looping completely. A systematic procedure for striking a compromise between the operational overhead and network adaptability is proposed. Several illustrative examples are presented. >

7 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
03 Jun 1990
TL;DR: The performance of the routing algorithm is studied under both steady-state and nonstationary conditions, and its superiority over the performance of previous schemes in a dynamic load environment is demonstrated.
Abstract: The problem of virtual circuit routing in data communication networks under nonstationary conditions is considered. A state variable modeling approach is adopted to describe the dynamic behavior of the possible paths for the virtual circuit through the network. The state model is developed by representing each link in a path as a set of nonlinear differential equations describing the dynamics of the virtual circuit and the network traffic in terms of time-varying mean quantities. An optimal control problem is formulated to determine the virtual circuit routing path which minimizes the number of packets in the network. The solution of the optimal control problem by Hamilton-Jacobi arguments is discussed leading to a threshold routing policy which can be implemented in a decentralized fashion. The performance of the routing algorithm is studied under both steady-state and nonstationary conditions, and its superiority over the performance of previous schemes in a dynamic load environment is demonstrated. >

6 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. >

Journal ArticleDOI
TL;DR: The theorem is given which asserts that the network performance objectives can be achieved by means of the state dependent shortest route algorithm.