McQuillan, J. et.al. The New Routing Algorithm for the Arpanet. IEEE Transactions on Communications, May 1980.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... Introduction The advent of fiber optic media has pushed the transmission speed of communication links to over a Gigabit (10 bits) per second, representing a three to four order of magnitude increase over typical links in todays data networks [KMS87] Todays packet switching nodes (e.g. ARPANET [MRR80]) implement most of the packet handling protocols in software executed in general purpose computers. Typically, thousands of instructions are needed for a computer to deal with a message [G87] We use the terms packet and message interchangeably. The increase in the communication link speeds ....

....consequences of the new model we examine three problems, two of which have been extensively studied in the literature. The first, which is of major practical impor3 tance in networks, is the problem of maintaining network topology. The best known solution to this problem was used in the ARPANET [MRR80], wherein each node periodically broadcasts local topology (its adjacent links states and loads) The broadcast takes O(m) messages and O(n) time, where m is the number of communication links and n is the number of nodes. These complexities do not change under our new measures. In this paper we ....

[Article contains additional citation context not shown here]

J. M. McQuillan, I. Richer and E. C. Rosen, The New Routing Algorithm for the ARPANET, IEEE Transactions on Communications, Vol. COM-28, May 1980, pp. 711-719.

....small state at each node is essential, even when the number of deployed sensors in a network is vast. 1. 2 Traditional Shortest Path Algorithms The two main categories of shortest path routing algorithms, Distance Vector (DV, also known as Distributed Bellman Ford, DBF) 14] and Link State (LS) [28] algorithms, require continual distribution of a current map of the entire network s topology to all routers. 4 DV s Bellman Ford approach constructs this global picture transitively; each router includes its distance (the sum of the edge weights between it and the destination) from all network ....

MCQUILLAN, J. M., RICHER, I., AND ROSEN, C. The new routing algorithm for the ARPANET. IEEE Transactions on Communications 28, 5 (1980), 711--719.

....resource utilization, in this chapter we propose performing dynamic routing and load balancing among the best k shortest paths between source and destination. In this context, one of the first dynamic routing algorithms, which uses the link delay as metric, was the ARPANET shortest path first [71]. Unfortunately, the sensitivity of this metric when the link utilization approaches unity resulted to relatively poor performances. Various routing algorithms based on congestion control information were proposed elsewhere [43, 46] The unique aspect of our algorithm is that it combines dynamic ....

J. M. McQuillan, I. Richer, and E. Rosen. The new routing algorithm for the arpanet. IEEE Transaction on Communication, 28(5):711--719, May 1980.

....the algorithm from time to time. The problem, and the model, in [HLL99] are a current instance of a problem that is inherent in distributed networks: The topology may change. In order to solve topology related problems, an algorithm is required to learn about the new topology. See, e.g. [CGKK95, MRR80]. The separation between the logical graph, and the underlying communication graph (e.g. CGK95] is becoming common for current fast networks. This logical graph represents the nodes knowledge about the topology of the underlying communication network. In [HLL99] the notion of topology ....

J. McQuillan, I. Richer, and E. Rosen. The new routing algorithm for the arpanet. IEEE Transactions on Communications, 28(5):711-719, May 1980.

....administrators who can use additional heuristic and on #eld knowledge they have about tra#c workloads. SPF #adaptive, link state#: is the prototype of link state algorithms with dynamic metric for link costs evaluations. A similar algorithm was implemented in the second version of ARPANET #McQuillan, Richer, Rosen, 1980# and in its successive revisions #Khanna Zinky, 1989#. Our implementation uses the same #ooding algorithm, while link costs are assigned over a discrete scale of 20 values by using the ARPANET hop normalized delay metric 12 #Khanna Zinky, 1989# and the the statistical window average method ....

McQuillan, J. M., Richer, I., & Rosen, E. C. #1980#. The new routing algorithm for the ARPANET. IEEE Transactions on Communications, 28, 711#719.

....considerable oscillations, a large positive constantwas added to stabilize them. Unfortunately, this solution dramatically reduced the sensitivity to tra#c congestion situations. These problems led in 1980 to a second version of the routing algorithm in ARPANET, known as Shortest Path First #SPF##McQuillan, Richer, Rosen, 1980#, a link state routing algorithm. A dynamic link cost metric was still used, based on the statistics of the delays experienced by data packets. Delays for each single link were computed summing the queuing and the transmission and propagation delays. This new class of algorithms exhibited more ....

....the BSD version of Unix. SPF: is the prototype of link state algorithms with dynamic metric for link costs evaluations. It has been implemented respecting the indications of sections 2.2 and 2.2.1 for link state algorithms. A similar algorithm was implemented in the second version of ARPANET #McQuillan et al. 1980# and in its successive revisions #Khanna Zinky, 1989#. We implemented it with state of the art link costs evaluation and #ooding algorithms. SPF 1F: is the same as SPF but with #ooding limited to the #rst neighbors. As far as we know, this is the #rst time that a similar algorithm is presented ....

McQuillan, J. M., Richer, I., & Rosen, E. C. #1980#. The New Routing Algorithm for the ARPANET. IEEE Transactions on Communications, 28, 711#719.

....the SmartBridges form a distributed system, some technique must be used to ensure that the SmartBridges knowledge of the network topology and host locations converges to a consistent state in the absence of further changes. One approach to ensure convergence would be to use a link state protocol [13], in which each bridge regularly emits a packet describing its connections and these packets are flooded to all segments. In the absence of further changes in the network topology, eventually all bridges knowledge of the network topology will converge. A similar method could be used to ensure ....

J. M McQuillan, I. Richer, and E. C. Rosen. The new routing algorithm for the ARPANET. IEEE Transactions on Communications, 28(5):711--719, May 1980.

....and distributes the routes among more nodes, causing RPU overhead to also be distributed more evenly. 7 Related Work Attempts have been made to adapt to changes in network load in hop by hop routing protocols. For example, link costs in the Arpanet SPF algorithm were a measure of average delay [18]. It has been shown analytically [2] and in practice in the Arpanet [16] that load based algorithms can suffer from oscillations caused by all nodes reacting to a routing update in the same way. This is particularly true in hop by hop routing in large networks with long paths, where consistent ....

John M. McQuillan, Ira Richer, and Eric Rosen. The new routing algorithm for the ARPANET. IEEE Transactions on Communications, COM-28(5):711--719, May 1980.

....other nodes. Each node requires O(N 2 ) space, where N is the number of nodes in the network. The dissemination time is small and proportional to D where D is the network diameter in hops (this requires that routing packets are given priority over data packets, which is usually the case, e.g. [20]) The distance vector approach which is based on the Bellman Ford algorithm [11] is more subtle: each node maintains for each destination a set of distances, one for each of its neighbors. It routes packets through a neighbor with the minimum distance. Each node requires O(N Theta e) space, ....

....long lived loops giving rise to large dissemination times, e.g. of the order of distances [2] The ARPANET initially used this Distributed Bellman Ford algorithm. Because of its long dissemination time, it was replaced in 1979 by a link state algorithm referred to as SPF (Shortest Path First) [20]. At that time, the link cost was the same as the link delay. Experience showed that this leads to unstable oscillations, and in 1987 it was replaced by a more slowly changing hop normalized delay function, which uses exponential averaging, movement limit, etc [18] Since 1979, many new kinds ....

[Article contains additional citation context not shown here]

J. M. McQuillan, I. Richer, and E. C. Rosen. The new routing algorithm for the ARPANET. IEEE Transactions on Communications, COM-28(5):711--719, May 1980.

....handle a bi directional link fault by making the restoration path bi directional. Several desirable properties of the proposed extended routing protocol are also explored. Key words: Fault tolerance, Internet, link state, loopfree, routing 1 Introduction Link stateroutingprotocols,suchasOSPF[4,5,6,9] and IS IS [1, 8] are the dominant routing protocols in the # This work was supported in part by NSF grant CCR 9900646 and NSF grant ANI 0073736. y Department of Electrical and Electronics Engineering, The University of Hong Kong, xlin hkueee2.hku.hk. z Department of Computing, The Hong ....

J. McQuillan, I. Richer, and E. Rosen. The new routing algorithm for the ARPANET. IEEE Transactions on Communications. vol. COM-28, no. 5, May 1980, pp. 711-719.

....may masquerade as a particular router and generate a bogus LSU. Moreover, a LSU may be modified by a compromised intermediate router or an active inter router link attack. 1 Examples of link state routing protocols are OSPF [12] IS IS [6] and a proprietary routing protocol used in the ARPANET [11]. 2 Link state updates are also called link state advertisements. Data authentication schemes can be broadly classified as symmetric key based and asymmetric key based. In a symmetric key based data authentication scheme, also called a message authentication code (MAC) scheme, a message is ....

J. McQuillan, I. Richer, and E. Rosen. The new routing algorithm for the ARPANET. IEEE Transactions on Communications, COM-28(5):711--719, May 1980.

....and local models of the network status using indirect and non coordinated communication of the information they collect. We report on the behavior of two different versions of AntNet, compared to the following routing algorithms: Open Shortest Path First (OSPF) 10] Shortest Path First (SPF) [11], distributed adaptive Bellman Ford (BF) 12] Q routing [13] and PQ routing [14] We consider realistic experimental conditions tested on the Japanese NTT private backbone and on a set of 100 and 150 node randomly generated networks. In all cases AntNet al..gorithms show the best performance and ....

....[10] since we did not consider failure conditions the algorithm reduces to static shortest path routing) SPF (adaptive, link state) is the prototype of link state algorithms with dynamic metric for link costs evaluations. A similar algorithm was implemented in the second version of ARPANET [11]. We implemented it with state of the art flooding algorithms and link cost metrics [18] Link costs are evaluated over moving windows using a link usage metric based on the fraction of time the link has been used during the last observation window. This metric was the most effective among the ....

J. M. McQuillan, I. Richer, and E. C. Rosen, The new routing algorithm for the ARPANET, IEEE Transactions on Communications, 28, 1980, 711--719.

....queueing. In all schemes, routing packets have priority over data packets; i.e. data packets can be scheduled for transmission only if there are no routing packets present. Regarding routing, we consider a link state algorithm like the SPF (Shortest Path First) algorithm used in the ARPANET [18] and OSPF (Open SPF) used in the Internet [19] Each node maintains a timevarying cost (explained below) for each outgoing link and TOS. Each node also maintains a view of the network topology, with a cost for each TOS and link in the network. To keep these views up to date, each node regularly ....

J. McQuillan, I. Richer, and E. Rosen. The New Routing Algorithm for the ARPANET. IEEE Transactions on Communications, COM-28(5):711--719, May 1980.

....Performance, Routing Algorithms. 1 Introduction The Internet, with approximately 4 million hosts, is the largest computer network in existence. Its largest and earliest components were the ARPANET, Milnet, and NSFnet, where many of the intermediary routing algorithms were designed and tested [JMR80] [KZ89] Although there have been numerous studies of the performance of these routing algorithms in their respective networks, the present scale of the Internet is orders of magnitude greater than the scale in which the original routing algorithms were designed and tested. The current ....

I. Richer J.M. McQuillian and E.C. Rosen. The new routing algorithm for the arpanet. IEEE Transactions on Communications, pages 711--719, May 1980.

....mobile unit frequently in order to save power consumption. This feature may also introduce mobile networks more failures (also called switching on off) which can be considered as a special form of mobility. Traditional routing protocols in wired networks, that generally use either link state [7, 9] or distance vector [5, 8] are no longer suitable for ad hoc wireless networks. In an environment with mobile hosts as routers, convergence to new, stable routes after dynamic changes in network topology may be slow and this process could be expensive due to low bandwidth. Routing information has ....

J. M. McQuillan, I. Richer, and E. C. Rosen. The new routing algorithm for ARPANET. IEEE Transactions on Communications, 28(5):711 -- 719, 1980.

....The routing component contains the data structure representing the routing information (e.g. routing table) and the functions to update these data structures and propagate their information. In the current version, three types of routing algorithms are implemented: SPF (Shortest Path First) [McQuillan et al. 1980], SEGALL [Merlin and Segall, 1979] and ExBF [Cheng et al. 1989] SPF is a link state routing algorithm, while SEGALL and ExBF are distance vector routing algorithms. Each algorithm uses next hop routing. The user can choose any one of the three routing algorithms; once the choice is made, all the ....

....node component to forward workload packets towards their destination. Currently, only next hop routing is used. 9 In the current version, we have implemented three types of routing components, corresponding to three routing algorithms: SPF, which is very much like the Arpanet routing algorithm [McQuillan et al. 1980]; SEGALL [Merlin and Segall, 1979, Segal, 1981] and ExBF [Cheng et al. 1989] SPF (Shortest Path First) is a link state routing algorithm. In link state algorithms, each node attempts to maintain a database describing the network topology and the link costs. Using this database, each node ....

J. M. McQuillan, I. Richer, and E. C. Rosen. The new routing algorithm for the ARPANET. IEEE Transactions on Communications, COM-28(5):711--719, May 1980.

....Our studies are done using a routing simulator called MaRS [1] We consider uniform and hotspot with background workloads. Some very preliminary results for Poisson failures and repairs and uniform workload was reported in [20] We consider three routing protocols: Shortest Path First (SPF) [15], Merlin Segall (MS) 16, 19] and Extended Bellman Ford (ExBF) 4] SPF is a link state routing algorithm, whereas MS and ExBF are distance vector routing algorithms. They are described in section 2. The space requirement at each node is O(N 2 ) for SPF, and O(N Theta e) for MS and ExBF, ....

.... 4 14 5 8 7 11 16 20 7 5 Hotspot node (College Park) Transient failure link Figure 1: NSFNET T1 Backbone (14 nodes, 21 bidirectional links, average degree 3) Assumptions and parameters used in this paper were predetermined either consistently with those made in the literature, e.g. [15] [12] 9] 5] or from statistics provided by Merit NSFNET Information Services, or by simulations with MaRS. Physical Network Link propagation delays in milliseconds are indicated in Figure 1. Also indicated is the node which will be a hotspot in some of our simulations, and an incident link ....

J. M. McQuillan, I. Richer, and E. C. Rosen. The New Routing Algorithm for the ARPANET. IEEE Transactions on Communications, COM-28(5):711--719, May 1980.

....with loops after a node link status change using simulations. However, it has no workload and assumes unit link delays and zero processing time at the nodes. 1 Poisson failures and repairs and uniform workload was reported in [19] We consider three routing protocols: Shortest Path First (SPF) [15], Merlin Segall (MS) 16, 18] and Extended Bellman Ford (ExBF) 4] SPF is a link state routing algorithm, whereas MS and ExBF are distance vector routing algorithms. They are described in section 2. The space requirement at each node is O(N 2 ) for SPF, and O(N Theta e) for MS and ExBF, ....

....as slowstart in TCP, the interaction would be more complicated, and we believe it would be hard to draw conclusions about the performance of the routing algorithm itself. Assumptions and parameters used in this paper were predetermined either consistently with those made in the literature, e.g. [15] [12] 9] 5] or from statistics provided by Merit NSFNET 5 9 7 13 9 7 7 7 15 9 8 5 4 14 5 8 7 11 16 20 7 5 Hotspot node (College Park) Transient failure link Figure 1: NSFNET T1 Backbone (14 nodes, 21 bidirectional links, average degree 3) Information Services, or by ....

J. M. McQuillan, I. Richer, and E. C. Rosen. The New Routing Algorithm for the ARPANET. IEEE Transactions on Communications, COM-28(5):711--719, May 1980.

....(TOS) e.g. low delay or high throughput, a network s routing protocol should be able to determine appropriate routes for each TOS. We are concerned here with achieving TOS using next hop (datagram) routing as it proved to be a simple and robust way to do adaptive routing of best effort traffic [28, 21]. Next hop TOS routing is done as follows. Each node maintains for each destination node and TOS, a neighboring node id, referred to as the next hop. Every data packet header contains its destination id and the TOS requested by the application. When a node receives a data packet, it forwards the ....

....queueing. In all schemes, routing packets have priority over data packets; i.e. data packets can be scheduled for transmission only if there are no routing packets present. Regarding routing, we consider a link state algorithm like the SPF (Shortest Path First) algorithm used in the ARPANET [28] and OSPF (Open SPF) used in the Internet [30] Each node maintains a time varying cost (explained below) for each outgoing link and TOS. Each node also maintains a view of the network topology, with a cost for each TOS and link in the network. To keep these views up to date, each node regularly ....

J. McQuillan, I. Richer, and E. Rosen. The New Routing Algorithm for the ARPANET. IEEE Transactions on Communications, COM-28(5):711--719, May 1980. 19

....functions. For modeling the physical nodes and links of the target system, MaRS has link components and node components. For modeling routing protocols, MaRS has a link cost function component and three routing components, SPF, ExBF, and SEGAL, corresponding to three different routing algorithms [12, 6, 13, 14]. For modeling application and transport protocols (e.g. user traffic and flow control) MaRS has three types of workload components, FTP, TELNET, and Simple Traffic, corresponding to three different types of user traffic. Each type of workload component has two versions, a source and a sink. MaRS ....

....lists depending on its type. 7 Concluding Remarks We have found MaRS to be very useful in understanding the complex dynamics of routing algorithms. In [16] we compared the performance of two new distance vector routing algorithms, SEGAL [13, 14] and ExBF [6] and a link state algorithm, SPF [12]. We considered the NSFNETT1 backbone network with varying uniform and skewed workloads and failure distributions. Our overall conclusion was that ExBF is as good as SPF for good link cost functions, whereas SEGAL is worse. In [3] we examined the relationship between workload independent ....

J. M. McQuillan, I. Richer, and E. C. Rosen. The New Routing Algorithm for the ARPANET. IEEE Transactions on Communications, COM-28(5):711--719, May 1980.

No context found.

McQuillan, J. et.al. The New Routing Algorithm for the Arpanet. IEEE Transactions on Communications, May 1980.

No context found.

MCQUILLAN, J., RICHER, I., ANDROSEN, E. The New Routing Algorithm for the ARPANET. IEEE Transactions on Communications 28, 5 (May 1980), 711--719.

No context found.

J. McQuilan, I. Richer, and E. Rosen. The new routing algorithm for the ARPANET. IEEE Transactions on Communications, 28:711--719, May 1980.

No context found.

J. McQuillan, I. Richer, and E. Rosen. The new routing algorithm for the arpanet. IEEE Transactions on Communications, 28(5):711-719, May 1980.

No context found.

J. M. McQuillan, I. Richer, and E. C. Rosen. The New Routing Algorithm for the ARPANET. IEEE Transactions on Communications, 7(1):1--7, 5 1980.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC