J. Moy. OSPF Version 2. RFC 1583, Network Working Group, March 1994. 143  Home/Search   Document Not in Database   Summary   Related Articles   Check

....they have as packets move through network and packets are delivered to every densely placed members and the spanning tree is formed. The most well known dense mode routing protocols are Distance Vector Multicast Routing Protocol (DVMRP) RFC 1075, 1988] Multicast Open Shortest Path First (MOSPF) [RFC 1583, 1994] [RFC 1584, 1994] and Protocol Independent Multicast Dense Mode (PIM DM) RFC 2362, 1998] We say that the member hosts are located in a sparse area, if the member hosts are not necessarily located in every subnet and network bandwidth is very limited in some parts of the network. In that type ....

....move through network and packets are delivered to every densely placed members and the spanning tree is formed. The most well known dense mode routing protocols are Distance Vector Multicast Routing Protocol (DVMRP) RFC 1075, 1988] Multicast Open Shortest Path First (MOSPF) RFC 1583, 1994] [RFC 1584, 1994] and Protocol Independent Multicast Dense Mode (PIM DM) RFC 2362, 1998] We say that the member hosts are located in a sparse area, if the member hosts are not necessarily located in every subnet and network bandwidth is very limited in some parts of the network. In that type of environment ....

[Article contains additional citation context not shown here]

J. Moy, OSPF version 2, Network working group(IETF), 1994.

....path tree. Changes in network topology or the presence of congested areas are regularly broadcast (or in LSR terminology, advertised) to all routers, prompting them to re compute their respective shortest path trees and their modify routing tables. The Open Shortest Path First (OSPF) protocol [18] used in the Internet is one of the most well known and widely deployed LSR protocols. LSR has 4 also been adopted by the ATM Private Network to Network Interface (PNNI) standard [2] As we will discuss in subsequent sections, the availability of complete, up to date topology information and a ....

J. Moy, \OSPF version 2," Request For Comments 2178, Network Working Group, July 1997.

....problems: flooding requires excessive communication resources, 6 and computing the routes using complete topology databases requires excessive processing resources. Examples for protocols based on LSAs are the inter domain policy routing (IDPR) architecture [EST93] ISO IS IS [ISO89] and OSPF [Moy94]. To cope with the inherent overhead of flooding, today s LSAs organize the network or internet into areas connected by a backbone. However, this imposes additional network configuration problems and, as results obtained by Garcia Luna Aceves and Zaumen indicate [GZ94] areas must be chosen ....

.... information in an LSA is much more difficult than in a DVA (e.g. see [Gar88, RHE94] Because LSAs require topology maps to be replicated at each router, different levels of topologies must be defined and routers must use multiple topology maps to aggregate information in an LSA (e.g. [Moy94, TRTN89]) In contrast, aggregating information in DVAs is very simple, because DVA exchanges information about distances to destinations, and such destinations can be a single network entity (e.g. router, network, host) or a group of entities (e.g. areas, confederations, clusters) Accordingly, the ....

[Article contains additional citation context not shown here]

J. Moy. OSPF Version 2. RFC 1583, Network Working Group, March 1994.

....traditional link state routing algorithms relying on topology broadcast. Keywords Link state routing, unidirectional link, inclusive cycle. I. INTRODUCTION Routing protocols are typically categorized into distance vector algorithms (DVAs) and link state algorithms (LSAs) An LSA uses complete [14] or partial [2] 9] 10] network topology to build preferred routing paths. A DVA uses vectors of distances to destinations reported by neighbors to build routing tables [12] 15] Although many DVAs and LSAs have been proposed, the vast majority assumes networks with bidirectional links, which ....

....box in Fig. 3, namely, topology graph (T G) routing table (R) discovery graph (DG) upstream and downstream node tables (D, U ) and the retransmission packet list (PktList) some of which are cross referenced by different modules. We also simulated an ideal link state algorithm based on OSPF [14], called OSPFC (OSPF with propagation control) to compare with ULPC. OSPFC uses the same mechanisms in NBR to discover usable link states for routing. Furthermore, OSPFC sends any reachable link state update to its upstream neighbors in CONNECTED state. A link is reachable if the head of the link ....

J. Moy. OSPF Version 2. RFC 2178, Network Working Group, Jul. 1997.

....of heavy load conditions, the observed oscillations were too large. So, after some revisions concerning the reduction of the allowed variability of the links costs #Khanna Zinky, 1989; Zinky, Vichniac, Khanna, 1989#, the current routing algorithm of Internet, Open Shortest Path First #OSPF# #Moy, 1994# is a link state algorithm with a static metric assigned by network administrators. Only temporary or permanent topological alterations are #ooded in the network. This short historical retrospectiveisintended to highlight the di#culties encountered in the implementation of adaptive routing ....

....class. Wewanted to compare our algorithm with the currentInternet standards and with some improved versions of them closely re#ecting state of the art for routing algorithms. The following algorithms have been implemented. OSPF: is our implementation of the o#cial Internet routing algorithm #Moy, 1994#. The Internet OSPF has a lot of features for the full network management. Here we are only interested in data packet routing in simpli#ed conditions, as described in section 4. Therefore, the original algorithm is reduced to a simple static shortest path calculation. Shortest paths for a sample ....

Moy, J. #1994#. OSPF Version 2. Request For Comments #RFC# 1583, Network Working Group.

....as slow convergence and creation of temporary forwarding loops. Several improvements were proposed to solve these problems [11] RIP (Routing Information Protocol) 13] is nowadays the most used protocol in the Internet for intra domain routing despite the growth of OSPF (Open ShortestPath First) [14], a LS protocol. In the LS model each router maintains a database with the complete network topology where each link is associated with a state. Link state information is exchanged between routers. Since each node knows the entire topology, loops are easily avoided, the routing convergence is ....

J. Moy, RFC1583: OSPF version 2. Network Working Group, Mar. 1994.

.... SMM LS Simulation We implemented the SMM LS algorithm in NS [11] NS provides a dynamic implementation of the Bellman Ford routing algorithm that was the base of our previous work [19] To simulate SMM LS, we added a link state mechanism similar to the one used by OSPF (Open Shortest Path First) [21]. The implementation of the QoS based routing scheme consists of two new routing modules and a modi ed link implementation to admit three metrics: propagation delay, available bandwidth, and packet loss probability. We used the Integrated Services module available in NS to simulate the admission ....

J. Moy, RFC1583: OSPF version 2. Network Working Group, Mar. 1994.

....This work was supported in part by the Advanced Research Projects Agency (ARPA) under contract F19628 96 C 0038 distributed [8] This paper focuses on flooding because of its simplicity and popularity. Examples of standard internet routing protocols based on the flooding of link states are OSPF [10], IS IS [9] and NLSP [11] In addition, the interdomain policy routing (IDPR) architecture [6] and the Nimrod architecture for scalable internet routing [4] are both based on flooding. These protocols and architectures use the same basic approach for the flooding of topology information, which we ....

J. Moy. OSPF Version 2. RFC 1583, Network Working Group, March 1994.

....and consumers and are important to maintain global realtime priority scheduling. Delivery of the (global) time of the event occurrence is important to allow events to be used to establish timing constraints relative to them. Our implementation of a RT Event Service is based on IP multicasting [Moy] and takes advantage of the multithreaded environment of Solaris 2.5. Each node has a CORBA Event Channel interface [OMG96] and is configured to listen to a pre defined IP multicast group. Each real time event has a unique event ID number, which is mapped to the IP address for the multicast ....

J. Moy. Request for comments - no. 1584; proteon, inc. Network Working Group.

....model has been adapted by CDPD for data communications using existing cellular channels [1] However, the compatibility is achieved at the expense of routing efficiency to mobile hosts. Our approach is to combine IP mobility support with hierarchical dynamic routing protocols, including OSPF [9] for interior gateway routing and BGP [13] for exterior gateway routing. While the IP mobility support continues to provide a basic model of mobile internetworking, with the default triangle routing through the home networks of mobile hosts, route optimization is achieved by propagating location ....

....destined to mobile hosts away from home are routed through their home agents. We propose route optimization for mobile hosts using existing Internet routing protocols such that location updates can be propagated as route changes. This section reviews the Internet routing protocols, especially OSPF [9]. Route optimization is presented in the next section. The Internet routing has a hierarchical structure. At the highest level is the Internet backbone that connects Autonomous Systems. The Border Gateway Protocol (BGP) 13] has been recommended as an interAutonomous System routing protocol for ....

[Article contains additional citation context not shown here]

J. Moy. OSPF Version 2. Network Working Group, July 1991. RFC 1247.

....Used for Comparison To evaluate the performances of AntNet, we selected a set of competitors algorithms from the shortest path class (see Appendix) reflecting Internet standards and state of the art for routing algorithms. OSPF: is our implementation of the official Internet routing algorithm [11]. The Internet OSPF has a lot of features for the full network management. Here we are only interested in data packet routing in simplified conditions, therefore, the original algorithm is reduced to the definition of routing tables by static shortest paths calculation. BF: is an implementation ....

J. Moy. OSPF version 2. RFC 1583, Network Working Group, 1994.

....the cost of a home registration, and the additional overhead of datagram forwarding through a routing agent may not be warranted. The distance from the home agent to the home care of address may be obtained from the home agent s routing table if it uses link state routing protocols such as OSPF [21]. Secondly, the home agent may be performing route optimization by propagating location information of a mobile node to its correspondent nodes [16] The cost of route optimization can be reduced if a mobile node does not change its home care of address often. Thus a home registration request for ....

....the IP datagram and send it to the correct location. The disadvantage of this approach is that redirection agents have to be border routers in order to be able to intercept IP datagrams from the home agent to a mobile host. When there are multiple border routers for an area, e.g. in OSPF [21], all the border routers have to be redirection agents to ensure that the inaccurate mobility binding at the home agent does not cause black holes in routing to 0 0.0005 0.001 0.0015 0.002 0.0025 0.003 0.0035 0.004 0.0045 1 2 3 4 5 6 7 8 packet drop rate ( location control distance threshold ....

Moy, J. OSPF Version 2. Network Working Group, July 1991. RFC 1247.

....seconds. This timing constraint is stored in the RT Environment, and the rest of the work is done inside of the Start RT Invocation( function as previously described (Label 2) 3.5. 2 Implementation of Real Time Event Service The implementation of a RT Event Service is based on IP multicasting [Moy] and takes advantage of multithreading in the local operating systems. Each node has a CORBA Event Channel [OMG96] component in its RT Daemon that is configured to listen to a pre defined IP multicast group. Each real time event has a unique event ID number, which is mapped to the IP address ....

J. Moy. Request for comments - no. 1584; proteon, inc. Network Working Group.

....concurrency control manages access to the event buffer using read write locking semantics. It ensures that priority inversion is bounded and provides a best effort on minimizing event response time. Implementation. Our implementation of a Real Time Event Service is based on IP multicasting [Moy] and takes advantage of the multithreaded environment, provided by Solaris 2.5. Each node has an RT Event Channel that supports the CORBA Event Channel interface [OMG96] and is configured to listen to a pre defined IP multicast group. Each real time event has a unique event ID number, which is ....

J. Moy. Request for comments - no. 1584; proteon, inc. Network Working Group.

....send or receive traffic on the tree. The center for the tree is located based on available resources if the pairwise selection process determines the shortest unicast path using the unreserved bandwidth type of service (ToS) option such as the one permitted by Open Shortest Path First (OSPF) [6]. Thus, the winner in each phase is selected along the path with the most unused bandwidth available. Use of ToS based routing in this stage will make the center selection mechanism sensitive to the current network load. Similarly, if the join requests and joinACKs are unicast to the center using ....

J. Moy, OSPF Version 2, Technical Report RFC 1247, Internet, Network Working Group, July 1991.

No context found.

J. Moy. OSPF Version 2. RFC 1583, Network Working Group, March 1994. 143

No context found.

J. Moy. OSPF Version 2. Request for Comments 1583, Network Working Group, March 1994.

No context found.

J. Moy. OSPF Version 2. Request for Comments 1247, Network Working Group, July 1991.

No context found.

J. Moy. OSPF Version 2. Network Working Group, Jul. 1997.

No context found.

J Moy. OSPF Version 2. Request For Comments 1247, Network Working Group, July 1991.

No context found.

J. T. Moy. OSPF version 2. Network Working Group, Request for Comments: 1247, http://search. ietf.org/rfc/rfc1247.txt, July 1991.

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