Showing papers on "Wireless Routing Protocol published in 1992"
01 May 1992
TL;DR: The authors investigate multicast routing for high-bandwidth delay-sensitive applications in a point-to-point network as an optimization problem and present an efficient approximation algorithm.
Abstract: The authors investigate multicast routing for high-bandwidth delay-sensitive applications in a point-to-point network as an optimization problem. They associate an edge cost and an edge delay with each edge in the network. The problem is to construct a tree spanning the destination nodes, such that it has the least cost, and so that the delay on the path from the source to each destination is bounded. Since the problem is computationally intractable, the authors present an efficient approximation algorithm. Experimental results through simulations show that the performance of the heuristic is near optimal. >
188 citations
01 Apr 1992
TL;DR: In a dynamic network environment under heavy traffic load, shortest-path routing algorithms, particularly those that attempt to adapt to traffic changes, frequently exhibit oscillatory behaviors and cause performance degradation.
Abstract: In a dynamic network environment under heavy traffic load, shortest-path routing algorithms, particularly those that attempt to adapt to traffic changes, frequently exhibit oscillatory behaviors and cause performance degradation. In this paper we first examine the problems from the perspective of control theory and decision making, and then analyze the behaviors of the shortest-path routing algorithms in details.
126 citations
01 Oct 1992
TL;DR: A dynamic multi-path routing scheme that has been considered for connection oriented homogeneous high speed networks to bridge the gap between routing and congestion control as the network becomes congested is described.
Abstract: In this paper we describe briefly a dynamic multi-path routing scheme that has been considered for connection oriented homogeneous high speed networks. The fundamental objective of the scheme is to bridge the gap between routing and congestion control as the network becomes congested. Because propagation delay far out shadows queueing and transmission delay in high speed networks, the proposed routing scheme works as a shortest path (minimum hop) first algorithm under light traffic conditions. However as the shortest path becomes congested, the source node uses multiple paths when and if available in order to distribute the load and reduce packet loss. The scheme is a cross between Alternate Path routing and Trunk Reservation.We compare the performance of the proposed scheme with the Shortest Path Only algorithm, the Alternate Path routing algorithm, the Random Routing algorithm, and the Trunk Reservation scheme. The throughput and packet loss performance are compared via simulations. These have been carried out concentrating on a 5 node network with varying traffic patterns, the intention being to gain insight into the strengths and weaknesses of the various schemes.
105 citations
09 Jun 1992
TL;DR: It is shown that wormhole routing in mesh-connected networks can be deadlock free and adaptive without the addition of channels to the basic topology.
Abstract: It is shown that wormhole routing in mesh-connected networks can be deadlock free and adaptive without the addition of channels to the basic topology. Several partially adaptive routing algorithms for 2-D and 3-D meshes are described and simulated for a variety of conditions. Simulations of policies for selecting input channels show that transmitting extra information in the header flits can reduce communication latencies at high network throughputs. Simulations of policies for selecting output channels show that avoiding turns reduces latencies at high throughputs. Unrestricted nonminimal routing is found to reduce latencies slightly at low throughputs but increase latencies significantly at high throughputs. For nonuniform traffic patterns, a partially adaptive routing algorithm performs better than a nonadaptive one. >
83 citations
01 Sep 1992
TL;DR: This work has used MaRS to evaluate and compare several next-hop routing algorithms and to facilitate the study of the complex dynamics that arises in routing systems (due to delayed feedback).
Abstract: MaRS is a discrete-event simulation testbed for developing routing algorithms for wide-area computer networks. It was developed as a modiied and enhanced version of an existing simulator, NetSim. MaRS allows the user to deene a network connguration consisting of physical network, routing algorithm and workload. The user can control its simulation, log the values of selected parameters, and save, load and modify network conngurations. MaRS provides both steady-state and instantaneous performance measures to facilitate the study of the complex dynamics that arises in routing systems (due to delayed feedback). We have used MaRS to evaluate and compare several next-hop routing algorithms.
64 citations
TL;DR: Simulation results show that the family of state-dependent routing schemes, of which separable routing is a member, is very attractive in terms of blocking rate, built-in network management features, and behavior in the presence of traffic forecast error.
Abstract: Separable routing is the first of a number of routing schemes for circuit switched telephone traffic invented at Bellcore. These routing schemes are state dependent, in the sense that, for each call attempt, a routing decision is made on the basis of the state of the network (defined in terms of the numbers of busy and idle trunks in the various trunk groups at the moment of the call attempt). In this paper, we describe separable routing and its mathematical background. Simulation results we have presented elsewhere show that the family of state-dependent routing schemes, of which separable routing is a member, is very attractive in terms of blocking rate, built-in network management features, and behavior in the presence of traffic forecast error.
62 citations
01 Jun 1992
TL;DR: It is shown, using a recently developed network simulator, MaRS, that a newly proposed distance-vector algorithm (ExBF) performs as well as SPF, suggesting that distance- vector algorithms are appropriate for very large wide-area networks.
Abstract: There are two approaches to adaptive routing protocols for wide-area store-and-forward networks: distance-vector and link-state. Distance-vector algorithms use O(N x e) storage at each node, whereas link-state algorithms use O(N2), where N is the number of nodes in the network and e is the average degree of a node. The ARPANET started with a distance-vector algorithm (Distributed Bellman-Ford), but because of long-lived loops, changed to a link-state algorithm (SPF). We show, using a recently developed network simulator, MaRS, that a newly proposed distance-vector algorithm (ExBF) performs as well as SPF. This suggests that distance-vector algorithms are appropriate for very large wide-area networks.
49 citations
01 May 1992
TL;DR: The authors propose a new scheme for optical signal routing within linear lightwave network (LLN) subnets, based on a new optical agent signal routing scheme, called rooted routing, and shows that when the link and excess losses are small, the optimal power budget is close to thatWhen the original, shortest path routing scheme is used.
Abstract: The authors propose a new scheme for optical signal routing within linear lightwave network (LLN) subnets. They study the synchronization problem that exists in these subnets which prevents efficient implementation of time division multiple access schemes for sharing a common broadcast medium. A solution for this problem is proposed, based on a new optical agent signal routing scheme, called rooted routing. The impact of the rooted routing on power losses is analyzed, and an approach for optimizing the power losses in LLNs with rooted routing is presented. It is shown that when the link and excess losses are small, the optimal power budget is close to that when the original, shortest path routing scheme is used. It is also shown that the power budget in LLNs with rooted routing can be significantly improved using a single optical amplifier. >
30 citations
13 May 1992
TL;DR: The main objectives for having this new method are that in case of one or more failures a frame will be guaranteed: to be removed from the ring-termination property, and to be copied at most once and only by its destinations-safety property.
Abstract: This paper presents a new source routing technique for ring and multi-ring networks, which uses short address labels. The main objectives for having this new method are that in case of one or more failures a frame will be guaranteed: (1) to be removed from the ring-termination property, and (2) to be copied at most once and only by its destinations-safety property. The scheme is based on dividing the label address space of each ring into subspaces, such that the address subspaces are physically disjoint. More specifically, each ring, in a multi-ring network, is divided into two or more parts such that adjacent address subspaces are disjoint. The route of each frame is described by a sequence of short address labels in the frame's header. The current route of a frame is determined by the first address label in its header, and it can be used for routing over at most one subspace of the ring. >
23 citations
11 Oct 1992
TL;DR: The authors presents an architecture composed of additions and modifications to the current ISO/GOSIP standards so they can support mobility.
Abstract: The authors presents an architecture composed of additions and modifications to the current ISO/GOSIP standards so they can support mobility. The structure of the mobile end system (MES) architecture consists of two tiers. One tier is used to support mobility within an intradomain routing environment. The second tier of the MES architecture is used to support mobility in an interdomain routing environment. A logical addressing scheme is used in both tiers of the MES architecture to uniquely identify an MES as it moves from one location to another. >
Book•
02 Jan 1992
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.
01 Jun 1992
TL;DR: Some of the performance issues in routing in ATM networks are addressed and the applicability of the routing concepts developed for today’s low bandwidth public and commercial communicatior s networks to B-ISDN networks is discussed.
Abstract: Asynchronous Transfer Mode (ATM) has been adopted by CCITT as the transport mode for B-ISDN. There are various performance issues that need to be resolved before B-ISDN networks can become a reality. In this paper, some of the performance issues in routing in ATM networks are addressed and the applicability of the routing concepts developed for today’s low bandwidth public and commercial communicatior s networks to B-ISDN networks is discussed.
TL;DR: The design, the implementation, and the performance results of a routing algorithm which provides deadlock-free communication in a tightly coupled message-passing concurrent computer are described.
Abstract: This paper describes the design, the implementation, and the performance results of a routing algorithm which provides deadlock-free communication in a tightly coupled message-passing concurrent computer. The algorithm is adaptive, isolated and uses the store-and-forward technique. It allows message communication between two processes regardless of where they are physically located on the network. The routing algorithm has many positive characteristics including provable deadlock freedom, guaranteed message arrival, and automatic local congestion reduction. It can be used as a basis for the design of high-level communication primitives. An Occam implementation on a network of inmos Transputers is discussed. The experimental results show that the routing algorithm is effective to support process to process communication on a concurrent computer.
13 May 1992
TL;DR: For two example functions, CRC error detection and CBC mode encryption, it is shown that the functions have ordering constraints and new functions are presented that provide similar functionality without ordering constraints.
Abstract: Multipath routing and data retransmission cause datamisordering. Although data could be reordered before processing, it is simpler and more efficient to process data as it arrives. Because existing protocol functions generally cannot process misordered data, we need new functions with minimal ordering constraints. For two example functions, CRC error detection and CBC mode encryption, we show that the functions have ordering constraints and we present new functions that provide similar functionality without ordering constraints. Keyword Codes: C.2.2
06 Dec 1992
TL;DR: LIBRA is shown to converge in a finite time after an arbitrary sequence of link-cost or topological changes and to be loop-free at every instant, with no need for internodal coordination spanning more than one hop, or the specification or computation of complete paths from source to destination.
Abstract: The loop-identification-and-blocking routing algorithm (LIBRA) is introduced for the distributed maintenance of routing information in large internets. According to LIBRA, each node maintains a routing table; each entry in this table contains the length of and next node in the chosen path to each destination, and a path label. Update messages contain a list of updates; each such update specifies the destination node, the length of the selected path, and its path label. A path label consists of a list of node identifiers used to identify and block a loop before it is used for routing. LIBRA is shown to converge in a finite time after an arbitrary sequence of link-cost or topological changes and to be loop-free at every instant, with no need for internodal coordination spanning more than one hop, or the specification or computation of complete paths from source to destination. LIBRA's performance is shown to be better than the performance of other routing algorithms previously proposed or currently used in network and internet routing protocols. >
11 Oct 1992
TL;DR: The results obtained using the enhanced JEB network show that the problem of optimal message routing can successfully by solved through the application of neural networks.
Abstract: The authors investigate the possibility of using an artificial neural network as an adaptive message router to provide optimal or near-optimal routing paths. Two different neural network architectures are implemented and tested against a network simulator to ascertain if their performance is adequate to allow them to be used as routing controllers in a network. A network simulator was written to investigate the performance of the JEB net of Jensen, Eshera, and Barash (1990) and the Hopfield net in routing messages. The results obtained using the enhanced JEB network show that the problem of optimal message routing can successfully by solved through the application of neural networks. >
02 Nov 1992
TL;DR: A new efficient topology update protocol that works in dynamic networks that may never stabilize and has O(m) amortized message complexity per topological change, where m is the number of edges.
Abstract: Topology update is a major component in routing protocols operating in existing communication networks This paper presents a new efficient topology update protocol that works in dynamic networks that may never stabilize Our protocol does not use unbounded counters and has O(m) amortized message complexity per topological change, where m is the number of edges The protocol is very simple and is based on a “hop counter” technique Our protocol uses a novel technique that combines a dynamic protocol (that works under the assumption that the network never stabilizes) and an eventually stable protocol (that works under the assumption that the network stabilizes)
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.
TL;DR: This paper extends the scope of the applicability of the Subnetwork Address Resolution Entity to the IS-IS Intra-domain case and proposes to re-use as much as possible the existing IDRP.
Abstract: In this paper, we present an architecture for the Connection-mode Network Service traffic routing. Basically, we extend the scope of the applicability of the Subnetwork Address Resolution Entity to the IS-IS Intra-domain case. The SNARE concept is flexible since it allows one to design routing as purely centralized or completely distributed. We note that it is possible either to use ISO 10589 or to adapt this protocol in order to ensure routing information distribution. For the inter-domain case, we propose to re-use as much as possible the existing IDRP. Some modifications are either required for a proper operation of the protocol for the CONS support or are desirable to benefit from the native CO capability.
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. >
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. >
01 Jan 1992
01 Jan 1992
TL;DR: In this paper, the authors present the results of the performance evaluation of two multi-hop routing protocols DOR/FRAN and MARION which are protocol candidates for the network layer of an integrated vehicle beacon and inter-vehicle communication network.
Abstract: Presents the results of the performance evaluation of two multi-hop routing protocols DOR/FRAN and MARION which are protocol candidates for the network layer of an integrated vehicle-beacon and inter- vehicle communication network. Markov models were used for both protocols to evaluate the packet delay for transmission of packets from a station to the next beacon being several hops away.
06 Dec 1992
TL;DR: The routing algorithm used by local exchange carrier (LEC) networks supporting switched multimegabit data service (SMDS) is described and the RMP also provides multicasting capabilities and can adapt to changes in topology within the time frames required for SMDS.
Abstract: The routing algorithm used by local exchange carrier (LEC) networks supporting switched multimegabit data service (SMDS) is described. The routing management protocol (RMP) based on the open shortest path first (OSPF) algorithm provides routing of data units within the LEC network and to external networks. The RMP also provides multicasting capabilities and can adapt to changes in topology within the time frames required for SMDS. >
16 Nov 1992
TL;DR: A new flooding routing Pounds -algorithm is designed to be able to keep the life of useful copies and inhibit reproduction of futile copies or eliminate them effectively.
Abstract: All nodes in the network are organized into steps in the source-to-destination direction so as to form several sets of stepped nodes. According to the description there are three types of packet copy, further classified as 'useful copies' and 'futile copies'. A new flooding routing Pounds -algorithm is designed to be able to keep the life of useful copies and inhibit reproduction of futile copies or eliminate them effectively. Thus the number of packet copies will be reduced obviously so as to improve the throughput. The essence of implementing the algorithm is described. >
18 Oct 1992
TL;DR: The authors present SEATER, an environment in which any general telephone traffic routing problem can be set up and simulated by using a variety of routing methods, and showed that learning automata solutions were far superior to any fixed solutions.
Abstract: The authors present SEATER, an environment in which any general telephone traffic routing problem can be set up and simulated by using a variety of routing methods. The routing methods available are the fixed rule, random routing, and routing utilizing a complete assortment of different learning automata. The general telephone traffic routing problem is described, and various existing fixed rule routing schemes supported by the system are explained. Additionally, most learning automata routing techniques are briefly described, and are supported by the system implemented. These schemes have been implemented and compared to the existing fixed rule algorithms in terms of minimizing the blocking probability of the network. The simulations showed that learning automata solutions were far superior to any fixed solutions. The advantage of the former lies in their adaptability to changes in telephone traffic. The system was written in SMALLTALK V and runs on a Mac II. >