scispace - formally typeset
Search or ask a question

Showing papers on "Link-state routing protocol published in 1995"


Book
01 Jan 1995
TL;DR: This paper presents an introduction to Routing in the Internet, focusing on RIP and OSPF and the Structure of Interconnections, and the structure of Multicast Routing.
Abstract: 1. Introduction to Routing in the Internet. The Worldwide Internet. How Is It Organized? A Study of Routing. Acknowledgments. I. ARCHITECTURE AND PROTOCOLS 2. The Internet Architecture. Is There an Internet Architecture? The End-to-End Argument. IP over Everything. Connectivity Is Its Own Reward. Developing the Internet Architecture. The Future of the Internet. 3. The Internet Protocol. Model of Operation. The Internet Addresses. The Internet Protocol. ICMP. Sending IP Packets. IP and Companion Protocols. Interconnecting Local Networks. 4. From IPv4 to IPv6. IPv6 Address Architecture. The IPv6 Header Format. ICMP v6. Address Resolution. Automatic Configuration. When Will We Deploy IPv6? II. INTERIOR ROUTING PROTOCOLS 5. Why Is RIP So Simple? Routing Information Protocol. An Introduction to Distance Vector Protocols. RIP, Version 1. RIP, Version 2. Using RIPng for IPv6. Further Improvements. The Cost of Simplicity. 6. Why Is OSPF So Complex? Open Shortest Path First. What Is a Link State Routing Protocol? Why Is a Link State Protocol Better? The Design of OSPF. The Link State Database. The Protocols within OSPF. OSPF for IPv6. Research and Developments. Complexity and Services. 7. Other Routing Protocols. RIP and OSPF Are Not Alone. Routers or Intermediate Systems? IGRP. Enhanced IGRP. Choosing Routing Protocols. III. EXTERIOR ROUTING PROTOCOLS 8. EGP: A First Step Toward The Global Internet. Splitting the Internet into Autonomous Systems. Exchanging Information through EGP. Routes, Distances, and Loops. The Limits of EGP. Developing BGP. 9. With BGP and CIDR Toward the World Wide Internet. Exponential Growth and the Need for CIDR. The Concept of Path Vectors. The Border Gateway Protocol. Synchronizing with the IGP. Growing Pains. 10. Growing Pains: From CIDR to IPv6. Addresses, Networks, and Routing Tables. The Structure of Interconnections. Routing Table Aggregation and Address Allocation. Is IPv6 the Solution? Waiting for the New IP. 11. Policy Routing. The Objectives of Policy Routing. Provider Selection. The IDPR Approach. Multi-Protocol Label Switching. The Future of Policy Routing. IV. NEW DEVELOPMENTS 12. IP Multicast Routing. Benefits of Multicast. Multicast Routing. Multicast Routing Protocols for the Internet. Internet Multicast Today. IP Multicast Deployment Issues. The Future of Multicast Routing. 13. Mobility. Mobile Hosts. The Objectives of IP Mobility. Architecture/Terminology. Protocols and Conventions. Further Refinements. Mobility and IPv6. The Future of Mobility. 14. Network Service Quality and Resource Reservation. Queues and Delays. Queuing and Scheduling. A Reservation Protocol. Do We Need Resource Reservation? Differentiated Services. Future Internet Services. 15. Toward the New IP. The Internet Lives. Address Depletion. Preparing for IPv6. Index.

561 citations


Journal ArticleDOI
TL;DR: A loop-free, distributed routing protocol for mobile packet radio networks intended for use in networks where the rate of topological change is not so fast as to make “flooding” the only possible routing method, but not so slow to make one of the existing protocols for a nearly-static topology applicable.
Abstract: We present a loop-free, distributed routing protocol for mobile packet radio networks. The protocol is intended for use in networks where the rate of topological change is not so fast as to make “flooding” the only possible routing method, but not so slow as to make one of the existing protocols for a nearly-static topology applicable. The routing algorithm adapts asynchronously in a distributed fashion to arbitrary changes in topology in the absence of global topological knowledge. The protocol's uniqueness stems from its ability to maintain source-initiated, loop-free multipath routing only to desired destinations with minimal overhead in a randomly varying topology. The protocol's performance, measured in terms of end-to-end packet delay and throughput, is compared with that of pure flooding and an alternative algorithm which is well-suited to the high-rate topological change environment envisioned here. For each protocol, emphasis is placed on examining how these performance measures vary as a function of the rate of topological changes, network topology, and message traffic level. The results indicate the new protocol generally outperforms the alternative protocol at all rates of change for heavy traffic conditions, whereas the opposite is true for light traffic. Both protocols significantly outperform flooding for all rates of change except at ultra-high rates where all algorithms collapse. The network topology, whether dense or sparsely connected, is not seen to be a major factor in the relative performance of the algorithms.

438 citations


Proceedings ArticleDOI
01 Dec 1995
TL;DR: Simulation results indicate that WRP is the most efficient of the algorithms simulated in a wireless environment.
Abstract: : The authors present a new distance-vector routing protocol for a packet radio network. The new distributed routing protocol, Wireless Routing Protocol (WRP), works on the notion of second-to-last hop node to a destination. WRP reduces the number of cases in which a temporary routing loop can occur and also provides a mechanism for the reliable transmission of update messages. The performance of WRP has been compared quantitatively by simulations with that of distributed Bellman-Ford (DBF), DUAL (a loop-free, distance-vector algorithm), and an ideal link-state algorithm (ILS) that represents the state of the art of Internet routing in a highly dynamic environment. The simulation results indicate that WRP is the most efficient of the algorithms simulated in a wireless environment.

242 citations


Journal ArticleDOI
TL;DR: A call architecture that may be used for QOS matching and a connection management mechanism for network resource allocation and a new rule-based, call-by-call source routing strategy for integrated communication networks are presented.
Abstract: With increasingly diverse QOS requirements, it is impractical to continue to rely on conventional routing paradigms that emphasize the search for an optimal path based on a predetermined metric, or a particular function of multiple metrics. Modern routing strategies must not only be adaptive to network changes but also offer considerable economy of scope. We consider the problem of routing in networks subject to QOS constraints. After providing an overview of prior routing work, we define various QOS constraints. We present a call architecture that may be used for QOS matching and a connection management mechanism for network resource allocation. We discuss fallback routing, and review some existing routing frameworks. We also present a new rule-based, call-by-call source routing strategy for integrated communication networks. >

242 citations


Book
27 Apr 1995
TL;DR: In this article, the authors present a detailed overview of the most important aspects of the current state of the art in wireless networks, including the following: PACKET-SWITCHING NETWORKS.
Abstract: I. CIRCUIT-SWITCHING NETWORKS. AT&Ts Dynamic Routing Network, G.R. Ash Dynamic Alternative Routing, R.J. Gibbens, F.P. Kelly, and P.B. Key II. PACKET-SWITCHING NETWORKS. Distance Vector Routing, G.S. Malkin and M.E. Steenstrup Inter-Domain Routing: EGP, BGP, and IDRP, Y. Rekhter Link State Routing, J. Moy AppleTalk Routing, A.B. Oppenheimer and F. Kuang SNA Routing, A. Garuge III. HIGH-SPEED NETWORKS. Routing in Optical Networks, J. Bannister, M. Gerla, and M. Kovacevic On Routing in ATM Networks, S. Gupta, K.W. Ross, and M. El Zarki Routing in the plaNET Network, I. Cidon and R. Guerin Deflection Routing, F. Borgonovo IV. MOBILE NETWORKS. Routing in Cellular Mobile Radio Communications Networks, J. Ketchum Packet Radio Routing, G.S. Lauder

192 citations


Book
01 Jan 1995
TL;DR: A taxonomy for characterizing adaptive routing protocols for hypercube interconnection networks (HINs) is presented in this paper, which is based on classes of routing decisions common to any HIN.
Abstract: A taxonomy for characterizing adaptive routing protocols for hypercube interconnection networks (HINs) is presented. The taxonomy is based on classes of routing decisions common to any HIN. This taxonomy is used to discuss existing and proposed protocols. Rather than an exhaustive enumeration of related research, the protocols selected for discussion are intended to be representative of the classes defined by the taxonomy. These protocols are candidates for use in massively parallel architectures configured with HINs. To provide some insight into their behavior in very large HINs, results of simulation studies of representative protocols are presented. >

181 citations


Journal ArticleDOI
TL;DR: This paper surveys the on-line routing framework, the proposed routing and admission control strategies, and discusses some of the implementation issues.
Abstract: Classical routing and admission control strategies achieve provably good performance by relying on an assumption that the virtual circuits arrival pattern can be described by some a priori known probabilistic model. A new on-line routing framework, based on the notion of competitive analysis, was proposed. This framework is geared toward design of strategies that have provably good performance even in the case where there are no statistical assumptions on the arrival pattern and parameters of the virtual circuits. The on-line strategies motivated by this framework are quite different from the min-hop and reservation-based strategies. This paper surveys the on-line routing framework, the proposed routing and admission control strategies, and discusses some of the implementation issues. >

180 citations


Journal ArticleDOI
TL;DR: A new class of adaptive routing algorithms-misrouting backtracking with m misroutes (MB-m) is presented, made possible by PCS, and an analysis of the performance and static fault-tolerant properties of MB-m is provided.
Abstract: Our goal is to reconcile the conflicting demands of performance and fault-tolerance in interprocessor communication. To this end, we propose a pipelined communication mechanism-pipelined circuit-switching (PCS)-which is a variant of the well known wormhole routing (WR) mechanism. PCS relaxes some of the routing constraints imposed by WR and as a result enables routing behavior that cannot otherwise be realized. This paper presents a new class of adaptive routing algorithms-misrouting backtracking with m misroutes (MB-m). This class of routing algorithms is made possible by PCS. We provide an analysis of the performance and static fault-tolerant properties of MB-m. The results of an experimental evaluation of PCS and MB-3 are also presented. This methodology provides performance approaching that of WR, while realizing a level of resilience to static faults that is difficult to achieve with WR. >

167 citations


Proceedings ArticleDOI
14 Nov 1995
TL;DR: Two new routing algorithms based on bandwidth and delay metrics are presented and some of their important properties are investigated and their implications on path computation are examined.
Abstract: Multimedia applications often require guaranteed quality of service and resource reservation, which has raised a number of challenging technical issues for routing. We consider two new routing algorithms based on bandwidth and delay metrics. The implications of routing metrics on path computation are examined and the rationales behind the selection of bandwidth and delay metrics are discussed. Two new routing algorithms based on bandwidth and delay metrics are presented and some of their important properties are investigated.

152 citations


Book ChapterDOI
01 Jan 1995
TL;DR: Simulation results over random networks show that unconstrained algorithms are not capable of fulfilling the QoS requirements of real-time applications in wide-area networks.
Abstract: Multicast (MC) routing algorithms capable of satisfying the QoS requirements of real-time applications will be essential for future high-speed networks. We compare the performance of all of the important MC routing algorithms when applied to networks with asymmetric link loads. Each algorithm is judged based on the quality of the MC tree it generates and its efficiency in managing the network resources. Simulation results over random networks show that unconstrained algorithms are not capable of fulfilling the QoS requirements of real-time applications in wide-area networks. One algorithm, reverse path multicasting, is not suitable for asymmetric networks irrespective of the requirements of the application. The three constrained Steiner tree (CST) heuristics reported to date are also studied. Simulations show that all three heuristics behave similarly and that they can manage the network efficiently and construct low cost MC trees that satisfy the QoS requirements of real-time traffic. The execution times of the CST heuristics depend on the MC group size, but they are always larger than those of the unconstrained algorithms.

140 citations


Proceedings ArticleDOI
20 Jul 1995
TL;DR: Analytical and empirical results for ROMM routing on wormhole routed mesh and torus networks show that ROMM algorithms can perform several representative routing tasks 1.5 to 3 times faster than fully randomized algorithms, for medium--sized networks.
Abstract: ROMM is a class of Randomized, Oblivious, Multi--phase, Minimal routing algorithms. ROMM routing offers a potential for improved performance compared to both fully randomized algorithms and deterministic oblivious algorithms, under both light and heavy loads. ROMM routing also offers close to best case performance for many common routing problems. In previous work, these claims were supported by extensive simulations on binary cube networks [30, 31]. Here we present analytical and empirical results for ROMM routing on wormhole routed mesh and torus networks. Our simulations show that ROMM algorithms can perform several representative routing tasks 1.5 to 3 times faster than fully randomized algorithms, for medium--sized networks. Furthermore, ROMM algorithms are always competitive with deterministic, oblivious routing, and in some cases, up to 2 times faster.

Patent
06 Dec 1995
TL;DR: In this article, a plurality of interconnected packet communications networks include routing nodes which utilize the top address element on the destination stack to route the message, and such routing nodes also include stack element editing facilities for popping elements from the stacks, constructing new elements to be pushed onto the stacks and amending the contents of elements on the stack.
Abstract: Packet messages transmitted on a packet communications network include origin and destination addresses in the form of stacked address elements which can be pushed or popped off of the stack. A plurality of interconnected packet communications network include routing nodes which utilize the top address element on the destination stack to route the message. Such routing nodes also include stack element editing facilities for popping elements from the stacks, constructing new elements to be pushed onto the stacks, and amending the contents of elements on the stack. This arrangement allows messages to be launched on the networks where the originating station does not have full knowledge of the destination station, and the routing nodes add the necessary destination information as it becomes necessary for routing.

Patent
29 Aug 1995
TL;DR: In this article, a method and apparatus for assigning link "distance" metrics that result in near optimal routing for a network formed of nodes (routers) and links, where each link has a capacity associated with it, and where source-destination flows are given.
Abstract: The invention discloses a method and apparatus for assigning link "distance" metrics that result in near optimal routing for a network formed of nodes (routers) and links, where each link has a capacity associated with it, and where source-destination flows are given. The routing optimality is measured with respect to some objective function (e.g., average network delay).

Book
02 Jan 1995

Proceedings ArticleDOI
02 Apr 1995
TL;DR: The key idea for the method is to first reduce the original subnetwork topology to a full-mesh representation that consists of a logical link for each pair of border nodes in the subnetwork, and then encode the link state information associated with the full- mesh representation with an appropriate spanning tree.
Abstract: We consider a communication network in which dynamic routing is used for establishing connections that support information transfer between end-users. Link state information is exchanged and maintained up-to-date among network nodes for path computation and network resource allocation. When the population of users is large, the amount of link state information can be overwhelming. A common solution is to use a hierarchical structure. In this paper, we present a method for aggregating link state information in a hierarchical network. We assume that each link state parameter associated with a link is symmetrical in both directions of the link. The key idea for the method is to first reduce the original subnetwork topology to a full-mesh representation that consists of a logical link for each pair of border nodes in the subnetwork, and then encode the link state information associated with the full-mesh representation with an appropriate spanning tree.

Proceedings ArticleDOI
20 Sep 1995
TL;DR: It is concluded that simple methods are adequate for widely distributed groups, but that the addition of group information can be leveraged to improve performance especially when the group is small or exhibits a high degree of locality.
Abstract: Multicast routing is an important topic of both theoretical and practical interest. Several proposed multicast routing algorithms involve the designation of one or more network nodes as the "center" of the routing tree for each multicast group. The choice of this designated router (which we refer to as the "core") influences the shape of the multicast routing tree, and thus influences the performance of the routing scheme. We investigate the relationship between the choice of core and three performance measures. Specifically, we compare various methods of selecting a core with respect to their effect on the bandwidth, delay, and traffic concentration. We conclude that simple methods are adequate for widely distributed groups, but that the addition of group information can be leveraged to improve performance especially when the group is small or exhibits a high degree of locality. We also conclude that core choice can be used to control traffic concentration, in fact traffic concentration effects can be ameliorated by appropriate core choice policies.

Journal ArticleDOI
TL;DR: An exact algorithm for solving the VRP that uses lower bounds obtained from a combination of two relaxations of the original problem which are based on the computation of q-paths and k-shortest paths, which demonstrate the effectiveness of the proposed method in solving problems involving up to about 50 customers and in providing tight lower bounds for problemsUp to about 150 customers.
Abstract: We consider the basic Vehicle Routing Problem (VRP) in which a fleet ofM identical vehicles stationed at a central depot is to be optimally routed to supply customers with known demands subject only to vehicle capacity constraints. In this paper, we present an exact algorithm for solving the VRP that uses lower bounds obtained from a combination of two relaxations of the original problem which are based on the computation ofq-paths andk-shortest paths. A set of reduction tests derived from the computation of these bounds is applied to reduce the size of the problem and to improve the quality of the bounds. The resulting lower bounds are then embedded into a tree-search procedure to solve the problem optimally. Computational results are presented for a number of problems taken from the literature. The results demonstrate the effectiveness of the proposed method in solving problems involving up to about 50 customers and in providing tight lower bounds for problems up to about 150 customers.

Journal ArticleDOI
TL;DR: The authors survey networking solutions that have been proposed for high-speed packet-switched applications and identify the specific problems resulting from very high transmission rates and explain how these problems influence the design of high- speed networks and protocols.
Abstract: The authors survey networking solutions that have been proposed for high-speed packet-switched applications. Using these solutions as examples, they identify the specific problems resulting from very high transmission rates and explain how these problems influence the design of high-speed networks and protocols. They conclude that the solutions based on deflection routing are the most promising ones and suggest a number of directions for their evolution. By a packet-switching protocol we mean the network-specific portion of the third OSI layer (i.e., the network layer) of the protocol stack. One part of a packet-switching protocol (according to our definition) is the routing scheme, i.e., the set of rules that assign incoming packets to output links. In general, we can talk about the following three components of the communication subnetwork which are relevant from our point of view: the routing protocol; the congestion-control mechanisms that can be effectively incorporated into the routing protocol; and the network topology. These components are closely related to each other and together offer a single functionality. We discuss routing protocols and congestion-control mechanisms employed in contemporary packet-switched networks, not necessarily in networks operating at very high transmission rates. Then, following some basic definitions related to the topology component, we investigate the challenges posed by the Gb/s transmission rates. >

Journal ArticleDOI
TL;DR: Link vector algorithms (LVA) are introduced for the distributed maintenance of routing information in large networks and internets using link-state information.
Abstract: We have present a new method for distributed routing in computer networks and internets using link-state information. Link vector algorithms (LVA) are introduced for the distributed maintenance of routing information in large networks and internets.

Book ChapterDOI
01 Jan 1995
TL;DR: In this paper, the authors consider the capacitated arc routing problem, where each vehicle tour (cycle) must observe an explicit capacity constraint, and discuss generic arc routing models and their solution techniques.
Abstract: Publisher Summary The term "arc routing" refers to routing problems where the key service activity is to cover arcs of a transportation network. In contrast to node routing, where the key service activity occurs at the nodes (customer sites) and arcs are of interest only as elements of paths that connect the nodes, arc routing focuses on the traversal of edges. Practical examples include the routing of street sweepers, snow-plowing, salt gritting (covering streets with salt grit), and inspection of streets for maintenance, postal delivery, and meter reading. In all examples, each street segment must be covered in its entirety. In meter reading, postal delivery, and the delivery of telephone books, the density of the customer locations along a street segment is sufficiently high to consider the street segment as a whole as the service entity. The basic methodology of arc routing by discussing generic arc routing models and their solution techniques is discussed. The chapter covers well-known postman problems that can be regarded as the classical problems of arc routing. The basic objective of these problems is to cover all arcs of a given network with an Euler cycle of minimum cost. The chapter considers the capacitated arc routing problem, where each vehicle tour (cycle) must observe an explicit capacity constraint. Two manufacturing problems that can be modeled as rural postman problems and also mentions other routing applications are discussed in the chapter.

Journal ArticleDOI
TL;DR: This paper focuses on the initial route construction phase, assumed to occur during a static “snapshot” of the dynamic topology, and is therefore applicable to fixed networks as well, e.g. the Internet.
Abstract: We propose a combined multicast routing, resource reservation and admission control protocol, termed Reservation-Based Multicast (RBM), that borrows the “Rendez-vous Point” or “Core” concept from multicast routing algorithms proposed for the Internet, but which is intended for operation in mobile networks and routes hierarchically-encoded data streams based on user-specified fidelity requirements, real-time delivery thresholds and prevailing network bandwidth constraints. The protocol exhibits the fully distributed operation and receiver-initiated orientation of these proposed algorithms; but, unlike them, the protocol is tightly coupled to a class of underlying, distributed, unicast routing protocols thereby facilitating operation in a dynamic topology. This paper focuses on the initial route construction phase, assumed to occur during a static “snapshot” of the dynamic topology, and is therefore applicable to fixed networks as well, e.g. the Internet.

Journal ArticleDOI
TL;DR: This paper first establishes the necessary and sufficient condition for deadlock free routing, based on the analysis of the message flow on each channel, and uses the model to develop new adaptive routing algorithms for 2D meshes.
Abstract: In this paper, we introduce a new approach to deadlock-free routing in wormhole-routed networks called the message flow model. This method may be used to develop deterministic, partially-adaptive, and fully-adaptive routing algorithms for wormhole-routed networks with arbitrary topologies. We first establish the necessary and sufficient condition for deadlock free routing, based on the analysis of the message flow on each channel. We then use the model to develop new adaptive routing algorithms for 2D meshes. >

Proceedings ArticleDOI
14 Nov 1995
TL;DR: A topological design and routing problem for low Earth orbit (LEO) satellite communication networks where each satellite can have a limited number of direct inter-satellite links to a subset of satellites within its line-of-sight is investigated.
Abstract: We investigate a topological design and routing problem for low Earth orbit (LEO) satellite communication networks where each satellite can have a limited number of direct inter-satellite links (ISLs) to a subset of satellites within its line-of-sight. First, we model LEO satellite network as a FSA (finite state automaton) using satellite constellation information. Second, we solve a combined topological design and routing problem for each configuration corresponding to a state in the FSA. The topological design (or link assignment) problem deals with the selection of ISLs, and the routing problem handles the traffic distribution over the selected links to maximize the number of carried calls. This NP-complete mixed integer optimization problem is solved by a two-step heuristic algorithm that first solves the topological design problem, and then finds the optimal routing. The algorithm is iterated using the simulated annealing technique until the near-optimal solution is found. The link assignment table and the routing table that are pre-calculated off-line for each state are loaded into the satellites and a new set of these tables are retrieved at each state transition. The simulation result shows that the proposed method is applicable to practical LEO satellite networks.

Patent
22 Nov 1995
TL;DR: In this article, the authors propose a method and apparatus for deadlock-free routing around an unusable routing component in a network reroutes paths between source and destination nodes.
Abstract: A method and apparatus for deadlock-free routing around an unusable routing component in a network reroutes paths between source and destination nodes by initially identifying an unusable routing component. A shadow direction within the network is then determined, the shadow direction being from the unusable routing component to an edge of the network. The paths between nodes are then rerouted so that the paths bypass the unusable routing component and limit the use of any routing components in the network between the unusable routing component and the edge in the shadow direction.

Book ChapterDOI
29 Aug 1995
TL;DR: In this paper, a technique to enhance multicomputer routers for fault-tolerant routing with modest increase in routing complexity and resource requirements is described, which handles solid faults in meshes, including all convex faults and many practical nonconvex faults, for example, faults in the shape of L or T.
Abstract: A technique to enhance multicomputer routers for fault-tolerant routing with modest increase in routing complexity and resource requirements is described. This method handles solid faults in meshes, which includes all convex faults and many practical nonconvex faults, for example, faults in the shape of L or T. As examples of the proposed method, adaptive and nonadaptive fault-tolerant routing algorithms using four virtual channels per physical channel are described.

Proceedings ArticleDOI
22 Jan 1995
TL;DR: A simulation model based on the Intel Paragon is presented that compares several known routing strategies with the proposed strategy to illustrate how local state information can be used to provide a potential network throughput improvement of up to 20%, while achieving fault tolerance.
Abstract: Many massively parallel computers in use today utilize simple deterministic XY wormhole routing to transmit messages between nodes. Because XY routing does not provide any routing adaptability, it lacks the ability to avoid congested links, as well as faults. Therefore, the focus of this paper will be two-fold: improving the performance of wormhole routing and providing fault tolerance for up to N-1 faults in an N/spl times/N two-dimensional mesh. A simulation model based on the Intel Paragon is presented that compares several known routing strategies with the proposed strategy to illustrate how local state information can be used to provide a potential network throughput improvement of up to 20%, while achieving fault tolerance. >

Proceedings ArticleDOI
01 Oct 1995
TL;DR: The unique feature of this approach is the independence of the higher level routing protocol from the subnet addresses, which allows for easy incremental deployment with small changes to existing intra-region protocols.
Abstract: The exponential growth of the Multicast Back-bone (MBone) has resulted in increased routing overhead and processing costs. In this paper we propose a two-level hierarchical routing model as a solution to this problem. This approach involves partitioning the MBone into non-overlapping regions using DVMRP as the inter-region routing protocol; intra-region routing may be accomplished by any of a number of existing multicast protocols. Our design is flexible enough to accommodate additional levels of hierarchy, and protocols other than DVMRP at the higher levels. The unique feature of this approach is the independence of the higher level routing protocol from the subnet addresses, which allows for easy incremental deployment with small changes to existing intra-region protocols.

Patent
25 Oct 1995
TL;DR: In this paper, a technique for permitting continued use of IP (Internet Protocol) routing protocols in an Asynchronous Transfer Mode (ATM) network is implemented in each ATM system having route-computing responsibilities.
Abstract: A technique for permitting continued use of IP (Internet Protocol) routing protocols in an Asynchronous Transfer Mode (ATM) network is implemented in each ATM system having route-computing responsibilities. When a call setup request is received, the routing system determines, from the ATM address of the target system, whether a routing protocol must be implemented. If a routing protocol must be implemented, data in an ACN (ATM Cluster Number) field and an HN (Host Number) field in the target ATM address is read and is imported into an IP-format address. This IP-format address is used in implementing the IP routing protocol.

Proceedings Article
01 Jan 1995

Patent
01 May 1995
TL;DR: In this paper, a topology manager compacts the circuit topology while at the same time optimizing the routing of the interconnections among the circuit elements, standard cells and/or cell blocks of the circuit design.
Abstract: An automated routing tool for routing interconnections between circuit elements, standard cells and/or cell blocks of cell-based designs which incorporates the best features of both currently known gate array routing techniques with currently known cell-based routing techniques. The invention eliminates the disadvantages of permitting the detailed router to adjust the relative positions of the circuit elements, standard cells and/or cell blocks during the detailed routing process. The method employs a topology manager which iteratively compacts the circuit topology while at the same time optimizing the routing of the interconnections among the circuit elements, standard cells and/or cell blocks of the circuit design. The method employs bin-based global routing, which identifies expandable boundaries and which provides input to a compaction routine which expands or contracts the expandable areas in accordance with the result of the global routing process. The detailed routing step is not performed until after the relative positions of the circuit elements, cells and/or cell blocks have been already fixed.