enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Link-state routing protocol - Wikipedia

    en.wikipedia.org/wiki/Link-state_routing_protocol

    Link-state routing protocols are one of the two main classes of routing protocols used in packet switching networks for computer communications, the others being distance-vector routing protocols. [1] Examples of link-state routing protocols include Open Shortest Path First (OSPF) and Intermediate System to Intermediate System (IS-IS). [2]

  3. Dijkstra's algorithm - Wikipedia

    en.wikipedia.org/wiki/Dijkstra's_algorithm

    Dijkstra's algorithm is usually the working principle behind link-state routing protocols. OSPF and IS-IS are the most common. Unlike Dijkstra's algorithm, the Bellman–Ford algorithm can be used on graphs with negative edge weights, as long as the graph contains no negative cycle reachable from the source vertex s. The presence of such cycles ...

  4. Open Shortest Path First - Wikipedia

    en.wikipedia.org/wiki/Open_Shortest_Path_First

    Open Shortest Path First (OSPF) is a routing protocol for Internet Protocol (IP) networks. It uses a link state routing (LSR) algorithm and falls into the group of interior gateway protocols (IGPs), operating within a single autonomous system (AS).

  5. Optimized Link State Routing Protocol - Wikipedia

    en.wikipedia.org/wiki/Optimized_Link_State...

    The Optimized Link State Routing Protocol (OLSR) [1] is an IP routing protocol optimized for mobile ad hoc networks, which can also be used on other wireless ad hoc networks. OLSR is a proactive link-state routing protocol , which uses hello and topology control (TC) messages to discover and then disseminate link state information throughout ...

  6. Link state packet - Wikipedia

    en.wikipedia.org/wiki/Link_state_packet

    Link State Packet (LSP) is a packet of information generated by a network router in a link state routing protocol that lists the router's neighbors. Link state packets can be further defined as special datagrams that determine the names of and the cost or distance to any neighboring routers and associated networks .

  7. IS-IS - Wikipedia

    en.wikipedia.org/wiki/IS-IS

    IS-IS is a link-state routing protocol, operating by reliably flooding link state information throughout a network of routers. Each IS-IS router independently builds a database of the network's topology, aggregating the flooded network information. Like the OSPF protocol, IS-IS uses Dijkstra's algorithm for computing the best path through the ...

  8. Routing - Wikipedia

    en.wikipedia.org/wiki/Routing

    A link-state routing algorithm optimized for mobile ad hoc networks is the optimized Link State Routing Protocol (OLSR). [2] OLSR is proactive; it uses Hello and Topology Control (TC) messages to discover and disseminate link-state information through the mobile ad hoc network.

  9. Routing protocol - Wikipedia

    en.wikipedia.org/wiki/Routing_protocol

    Although there are many types of routing protocols, three major classes are in widespread use on IP networks: Interior gateway protocols type 1, link-state routing protocols, such as OSPF and IS-IS; Interior gateway protocols type 2, distance-vector routing protocols, such as Routing Information Protocol, RIPv2, IGRP.