Showing papers on "Wireless Routing Protocol published in 1990"
Patent•
09 Jul 1990
TL;DR: In this article, the authors proposed a method for providing an efficient and adaptive management of message routing in a multi-platform, communication system having dynamically changing platform populations and dynamically changing connectivities between platforms where each of the platforms are capable of performing the steps of recognizing at least certain ones of the nodes in the system, deriving from at least one of the recognized nodes the quality of interconnectivities of other nodes, and employing the derived quality of connectivity to make connectivity-based routing decisions using a selective one of a point-to-point routing algorithm.
Abstract: The method for providing an efficient and adaptive management of message routing in a multi-platform, communication system having dynamically changing platform populations and dynamically changing connectivities between platforms where each of the platforms are capable of performing the steps of recognizing at least certain ones of the platforms in the system, deriving from at least one of the recognized platforms the quality of interconnectivities of the recognized platforms and certain others of the platforms in the system; and employing the derived quality of interconnectivities to make connectivity-based routing decisions using a selective one of a point-to-point routing algorithm, a point-to-multipoint routing algorithm and a broadcast routing algorithm.
134 citations
89 citations
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
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
TL;DR: The characteristics of international 24-h traffic profiles are examined, and proposed dynamic routing schemes are described, and results on circuit savings and fault tolerance of international dynamic routing networks are outlined.
Abstract: Major issues that should be examined in evaluating the performance of networks with dynamic routing are reviewed The characteristics of international 24-h traffic profiles are examined, and proposed dynamic routing schemes are described Gain allocation principles are discussed, and results on circuit savings and fault tolerance of international dynamic routing networks are outlined >
34 citations
TL;DR: The evolution of dynamic routing with respect to several future directions is highlighted, including extension to new networks and services, robust design and real-time adaptivity, and extension to interconnecting networks, including the Worldwide Intelligent Network.
Abstract: Dynamic routing concepts are described, and the design and control of dynamic routing networks is discussed. The vastly improved performance of the networks is illustrated with examples from operational experience. The evolution of dynamic routing with respect to several future directions is highlighted. These directions are extension to new networks and services, robust design and real-time adaptivity, and extension to interconnecting networks, including the Worldwide Intelligent Network. >
32 citations
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
TL;DR: The nature of the traffic-routing problem is described, and early studies of state-dependent routing are noted; how the relative costs can be determined for the case of direct routing is shown.
Abstract: The nature of the traffic-routing problem is described, and early studies of state-dependent routing are noted. A state-dependent scheme seeks to route each call so as to minimize the risk of blocking future calls, and thus responds to the current state of the network on the basis of certain assumptions about future traffic demands. State-dependent routing is considered as a Markov decision process. How the relative costs can be determined for the case of direct routing is shown. >
25 citations
CNET1
TL;DR: The evolution of circuit-switched networks is analyzed with respect to the functional innovations that allowed for new traffic controls and the technical alternatives for routing techniques and their integration with congestion and flow control are considered.
Abstract: The evolution of circuit-switched networks is analyzed with respect to the functional innovations that allowed for new traffic controls. The technical alternatives for routing techniques and their integration with congestion and flow control are considered. The performance of dynamically controlled networks is analyzed in the framework of research done at the Centre National d'Etudes des Telecommunications (CNET) together with studies carried out in other research laboratories. Comparisons are made of dynamic routing versus fixed hierarchical routing and time-dependent routing versus adaptive routing. For adaptive routing, centralized and isolated methods are compared. The benefits of advanced control methods are summarized. >
20 citations
01 Apr 1990
TL;DR: A multipath scheme for providing end-to-end fault-tolerance on large networks, which improves routing performance while keeping network latency low and the novel routing component, RN1, which implements this scheme, showing how it can be the basic building block for fault-Tolerant multistage routing networks.
Abstract: As the size of digital systems increases, the mean time between single component failures diminishes. To avoid component related failures, large computers must be fault-tolerant. In this paper, we focus on methods for achieving a high degree of fault-tolerance in multistage routing networks. We describe a multipath scheme for providing end-to-end fault-tolerance on large networks. The scheme improves routing performance while keeping network latency low. We also describe the novel routing component, RN1, which implements this scheme, showing how it can be the basic building block for fault-tolerant multistage routing networks.
17 citations
03 Jun 1990
TL;DR: Admission control and routing in circuit-switched networks are investigated with two types of traffic: wideband with delayed call set up and narrowband operating in loss mode, finding state-dependent routing to be superior to direct routing and load sharing routing.
Abstract: Admission control and routing in circuit-switched networks are investigated with two types of traffic: wideband with delayed call set up and narrowband operating in loss mode. Markov decision theory is used to construct a state-dependent routing policy. Optimality conditions for a load sharing routing are derived from the first-order Kuhn-Tucker equations. These models together with a direct routing scheme are used in a simulation study to determine the best approach for control of traffic with delayed call setup. State-dependent routing is found to be superior to direct routing and load sharing routing, although its operation is much more complex. >
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.
05 Dec 1990
TL;DR: A communication network with stochastic input flows is considered, and each routing node is assigned a multilayer feedforward neural network, which generates the routing variables.
Abstract: A communication network with stochastic input flows is considered. The nodes which route the traffic are required: (i) to react instantaneously to the variations of their incoming flows so as to minimize an aggregate transmission cost, and (ii) to compute or adapt their routing strategies online on the basis of the measured values of the incoming flows and of some local information. Owing to the first requirement, the routing nodes must be considered as the cooperating decision makers of a team organization. The second requirement calls for a computationally distributed algorithm. This fact and the intractability, under general conditions, of team functional optimization problems were the reasons to assign each routing node a multilayer feedforward neural network, which generates the routing variables. For these neural networks the stochastic input flows play the role of training patterns. The weights of the routing neural networks are then adjusted by means of an efficient algorithm based on backpropagation and stochastic approximation. >
01 Apr 1990
TL;DR: A new adaptive flow control algorithm together with learning routing algorithms based on delay measurements that shows the superiority of the new scheme over existing algorithms.
Abstract: We present a new adaptive flow control algorithm together with learning routing algorithms.The key performance measure in both algorithms is packet delay. Window adjustment and route selection are based on delay measurements. Simulation results have shown the superiority of the new scheme over existing algorithms.
16 Apr 1990
TL;DR: An introduction to automatic integrated-circuit routing is presented, with particular attention given to the types of routing algorithm, global and detailed routing, and improving routing and routability.
Abstract: An introduction to automatic integrated-circuit routing is presented. Particular attention is given to the types of routing algorithm, global and detailed routing, and improving routing and routability. >
02 Dec 1990
TL;DR: It is shown that the source routing scheme outperforms the link-by-link routing in all of the following aspects: the call setup delay and capacity, the call looping probability, and the call denial rate.
Abstract: The author presents and comparatively analyzes the virtual-circuit routing control for the ISDN (integrated services digital network) frame-relay networks. The focus is on comparing the performance of the two routing control schemes: source routing and link-by-link routing. It is shown that the source routing scheme outperforms the link-by-link routing in all of the following aspects: the call setup delay and capacity, the call looping probability, and the call denial rate. It is thus recommended that the source routing control strategy with crankback mechanism be used for the ISDN frame-relay networks. >
TL;DR: It is shown that by combining flexible routing with trunk reservation, this paper can introduce flexible routing unilaterally in such a way that it will result in more robust and cost-effective netowrk provisioning for both international carriers.
Abstract: This paper summarizes a deployment strategy for flexible routing in international networks. In an earlier paper, we proposed to define flexible routing for international networks based on Dynamic Nonhierarchical Routing call processing principles, including originating call control, common channel signaling and crankback capabilities, and investigated the problem of dimensioning multiservice bilateral networks assuming that flexible routing is introduced by both international carriers. In reality, however, there will be a period of transition in which most administrations will continue to design and manage international networks based on traditional hierarchical routing principles. Thus, we show that by combining flexible routing with trunk reservation, we can introduce flexible routing unilaterally in such a way that it will result in more robust and cost-effective netowrk provisioning for both international carriers.
Proceedings Article•
[...]
TL;DR: An alternative to minimum-cost routing control, called multiclass routing, is presented, followed by a discussion of special allowances of which the minimum-length criterion provides opportunities to take advantage.
Abstract: An alternative to minimum-cost routing control, called multiclass routing, is presented. Multiclass routing was developed as an extension to a suite of link and network protocols for a mobile-radio environment. These protocols were based on the design of a packet radio that uses spread spectrum whose parameters are controllable in real time. In particular, a link-control protocol takes advantage of these real-time-controllable parameters to establish optimal gains for use on links. Multiclass routing uses these link gains and other link quality measures in the first decision criterion in selecting routes. Minimum-length is the second criterion. The rules for multiclass route updating are presented, followed by a discussion of special allowances of which the minimum-length criterion provides opportunities to take advantage. A comprehensive comparison with the minimum-cost approach is then made. >
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. >