A routing protocol developed for IP networks based on the shortest path first or link-state algorithm. Routers use link-state algorithms to send routing information to all nodes in an internetwork by calculating the shortest path to each node based on topography of the Internet constructed by each node. Each router sends that portion of the routing table (keeps track of routes to particular network destinations) that describes the state of its own links, and it also sends the complete routing structure (topography)
Open Shortest Path First. Link-state, hierarchical IGP routing algorithm proposed as a successor to RIP in the Internet community. OSPF features include least-cost routing, multipath routing, and load balancing. OSPF was derived from an early version of the ISIS protocol. See also Enhanced IGRP, IGP, IGRP, IS-IS, and RIP.
pen hortest ath irst - Link state, hierarchical IGP routing algorithm - successor to RIP. OSPF's feature include least-cost routing, multi-path routing, and load balancing. OSPF was derived from an early version of OSI IS IS protocol.
Open Shortest Path First. A routing protocol used in medium-sized and large-sized networks. This protocol is more complex than RIP, but allows better control and is more efficient in propagating routing information.
Open Shortest Path First. A routing protocol that determines the best path between two routers within an autonomous system based on the path length. The shortest path will be chosen to forward a packet to its next hop (router). Also see IGP, routing protocol. Compare with RIP.
Open Shortest Path First. A link-state routing protocol used in LANs based on TCP/IP.
Open Shortest Path First (IETF)
Open Shortest Path First, a proposed standard, Interior Gateway Protocol (IGP) for the Internet.
Open Shortest Path First Ensures that the best path is taken through the TCP/ IP network whenever possible. Involves less protocol traffic between router s than RIP and is therefore more efficient.
Open Shortest Path First. A dynamic routing protocol based on a shortest path first algorithm, better suited to larger networks than RIP.
Open Shortest Path First. routing protocol where a route is chosen based on the fewest number of hops that do not pass through an over-congested router or network.
See Open Shortest Path First (OSPF).
Open Shortest Path First. A routing protocol that maintains a map of all other routers and the networks to which they connect. Sends short messages asking whether a neighbor is alive and reachable. More efficient, scalable than vector-distance routing protocols that maintain tables of all known destinations and number of hops to reach them.
Open Shortest Path First. OSPF is a routing protocol that determines the best path for routing IP traffic over a TCP/IP network. It uses less router- to router update traffic than the RIP protocol that it has been designed to replace.
A protocol that routers use to communicate between themselves. OSPF has the ability to configure topologies and adapt to changes in the Internet. It can also balance traffic loads by determining which routes offer the best service.
An interior gateway protocol (IGP) that transfers packets from one network to an adjacent one. See IGP.
Open Shortest Path First (OSPF) is a router protocol used within larger independent system networks. If a host using OSPF detects a routing table change, that host can immediately multicast the changes to all other hosts in the network so they will all have the same information. Unlike OSPF's predecessor, RIP, OSPF only sends the changes to other hosts, and not the entire routing table.
(Open Shortest Path First) An advanced Interior Gateway Protocol, preferred over RIP in most circumstances.
Open Shortest Path First - a routing protocol used to deliver packets across a complex, presumably dynamic network by means of the shortest path. This protocol is somewhat complex as it requires each system to maintain a state table of all systems connected to the local network to allow for the packets to be delivered correctly.
See: Open Shortest-Path First Interior Gateway Protocol
Open Shortest Path First. Link-state, hierarchical Interior Gateway Protocol (IGP) routing algorithm proposed as a successor to Routing Information Protocol (RIP) in the Internet community. OSPF features include least-cost routing, multipath routing, and load balancing. OSPF was derived from an early version of the Intermediate System-to-Intermediate System (IS-IS) protocol. See also IGP and RIP.
Open Shortest Path First (protocole OSPF)
Open Shortest-Path First Interior Gateway Protocol -- A proposed replacement for RIP. It addresses some problems of RIP and is based upon principles that have been well-tested in non-internet protocols. Originally acronymed as OSPFIGP.
(Open Shortest Path First): Link-state routing protocol.
(n.) open shortest path first is a proposed IGP for the internet.
Open Shortest Path First: A link-state routing algorithm that is used to calculate routes based on the number of routers, transmission speed, delays and route cost.
Open Shortest Path First. A network routing protocol used on IP networks such as the Internet, which locates the shortest path to each node on the network. Also see Internet IP Network
Open Shortest Path First (OSPF) is a link-state, hierarchical Interior Gateway Protocol (IGP) routing algorithm. The well known Dijkstra's algorithm is used to calculate the shortest path tree. It uses cost as its routing metric. A link state database is constructed of the network topology which is identical on all routers.
Open Shortest Path first. A link state, as opposed to distance vector, routing protocol. It is an Internet standard IGP defined in RFCs 1583 and 1793. The multicast version, MOSPF, is defined in RFC 1584.
Open Shortest Path First. Route protocol based on link state technique.
Open Shortest Path First; an Internet routing protocol that scales well, can route traffic along multiple paths, and uses knowledge of an Internet's topology to make accurate routing decisions.
Open Shortest Path First. A link state that IGP uses between routers to exchange routing information.
Open Shortest Path First. A "Proposed Standard" IGP for the Internet. See IGP.
A routing protocol, used on TCP/IP networks, in which routers maintain an internal map of the network and exchange information about the current state of each network link. OSPF's features include least-cost routing, multipath routing, and load balancing.
n. Acronym for Open Shortest Path First. A routing protocol for IP networks, such as the Internet, that allows the router to calculate the shortest path to each node for sending messages. The router sends information on the nodes it is linked to, called link-state advertisements, to other routers on the network to accumulate link-state information to make its calculations. See also communications protocol, node (definition 2), path (definition 1), router.
Open Shortest Path First. A link-state IGP that makes routing decisions based on the shortest-path-first (SPF) algorithm (also referred to as the Dijkstra algorithm).
