background preloader

Routing protocols

Facebook Twitter

Static and Default routing

Routing table. Category:Routing protocols. Reliability (computer networking) Link state vs distance vector at DuckDuckGo. Routing by rumor at DuckDuckGo. Border Gateway Protocol. Open Shortest Path First (OSPF) Hop (networking) An illustration of hops in a network.

Hop (networking)

The hop count between the computers in this case is 2. The hop count refers to the number of intermediate devices (like routers) through which data must pass between source and destination, rather than flowing directly over a single wire.[1] Each router along the data path constitutes a hop, as the data is moved from one Layer 3 network to another. Hop count is therefore a basic measurement of distance in a network. Each time a capable device receives these packets, that device modifies the packet, incrementing the hop count by one. In addition, the device compares the hop count against a time to live limit and discards the packet if its hop count is too high. Known as time to live (TTL) in IPv4, and "Hop Limit" in IPv6, this field specifies a limit on the number of hops a packet is allowed before being discarded. Routing term used for the next gateway to which packets should be forwarded along the path to their final destination.

Time to live. IP packets[edit] DNS records[edit] TTLs also occur in the Domain Name System (DNS), where they are set by an authoritative name server for a particular resource record.

Time to live

When a caching (recursive) nameserver queries the authoritative nameserver for a resource record, it will cache that record for the time (in seconds) specified by the TTL. If a stub resolver queries the caching nameserver for the same record before the TTL has expired, the caching server will simply reply with the already cached resource record rather than retrieve it from the authoritative nameserver again. Nameservers may also have a TTL set for NXDOMAIN (acknowledgment that a domain does not exist); but they are generally short in duration (three hours at most). The units used are seconds. Newer DNS methods that are part of a DR (Disaster Recovery) system may have some records deliberately set extremely low on TTL.

HTTP[edit] Time to live may also be expressed as a date and time on which a record expires. Private network. In the Internet addressing architecture, a private network is a network that uses private IP address space, following the standards set by RFC 1918 for Internet Protocol Version 4 (IPv4), and RFC 4193 for Internet Protocol Version 6 (IPv6).

Private network

These addresses are commonly used for home, office, and enterprise local area networks (LANs). Private IP address spaces were originally defined in an effort to delay IPv4 address exhaustion, but they are also a feature of IPv6. Addresses in the private space are not allocated to any specific organization and anyone may use these addresses without approval from a regional Internet registry. However, IP packets addressed from them cannot be transmitted through the public Internet, and so if such a private network needs to connect to the Internet, it must do so via a network address translator (NAT) gateway, or a proxy server.

Private IPv4 address spaces[edit] Dedicated space for carrier grade NAT deployments[edit] Private IPv6 addresses[edit] How Routers Work.


Split horizon route advertisement. "Split horizon" redirects here.

Split horizon route advertisement

For the Domain Name System feature, see Split-horizon DNS. In computer networking, split-horizon route advertisement is a method of preventing routing loops in distance-vector routing protocols by prohibiting a router from advertising a route back onto the interface from which it was learned. Example[edit] In this example, network node A routes packets to node B in order to reach node C. The links between the nodes are distinct point-to-point links. According to the split-horizon rule, node A does not advertise its route for C (namely A to B to C) back to B. Link-state advertisement. The link-state advertisement (LSA) is a basic communication means of the OSPF routing protocol for the Internet Protocol (IP).

Link-state advertisement

It communicates the router's local routing topology to all other local routers in the same OSPF area. OSPF is designed for scalability, so some LSAs are not flooded out on all interfaces, but only on those that belong to the appropriate area. In this way detailed information can be kept localized, while summary information is flooded to the rest of the network. Administrative distance. Default administrative distances[edit] The following table lists the default administrative distances for various routing protocols used on Cisco routers.[1] Please note that:- An administrative distance of 255 will cause the router to disbelieve the route entirely and not use it.

Administrative distance

An administrative distance of 255 will cause the router to remove the route from the RIB and not use it.* Since IOS 12.2, the administrative distance of a static route with an exit interface is 1. Prior to the release of 12.2 it was in fact 0.Only the interface itself has an administrative distance of 0, since a route cannot be less than 1.Directly connected routes have an administrative distance of 0. Verifying administrative distance[edit] Directly connected routes have an administrative distance of 1. Router# configure terminal Router(config)# ip route fastEthernet 0/0 Router(config)# do show ip route S [1/0] via R1(config)# ip route backupLink 1 254. Distance-vector routing protocol. In computer communication theory relating to packet-switched networks, a distance-vector routing protocol is one of the two major classes of intra domain routing protocols, the other major class being the link-state protocol.

Distance-vector routing protocol

Distance-vector routing protocols use the Bellman–Ford algorithm, Ford–Fulkerson algorithm, or DUAL FSM (in the case of Cisco Systems's protocols) to calculate paths. 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 other being distance-vector routing protocols.

Link-state routing protocol

Examples of link-state routing protocols include open shortest path first (OSPF) and intermediate system to intermediate system (IS-IS). This contrasts with distance-vector routing protocols, which work by having each node share its routing table with its neighbours. In a link-state protocol the only information passed between nodes is connectivity related. Link-state algorithms are sometimes characterized informally as each router 'telling the world about its neighbours" History[edit] What is believed to be the first adaptive routing network of computers, using link-state routing as its heart, was designed and implemented during 1976-77 by a team from Plessey Radar led by Bernard J Harris; the project was for "Wavell" - a system of computer command and control for the British Army.

See also[edit] Category:Routing protocols.