understanding and types of Routing Protocols
10/09/2017
understanding and types of Routing Protocols
One of the functions of the IP protocol is the form of connection from different forms of different interfaces. The system performs a task called the IP router. The interface type of device and interface. When sending data to the destination, a host will pass through a router first. Then the router will disturb the data to its destination. The data flows from one router to another until it reaches its destination host. Each router chooses a path to the next hop.
One of the functions of the IP protocol is the form of connection from different forms of different interfaces. The system performs a task called the IP router. The interface type of device and interface. When sending data to the destination, a host will pass through a router first. Then the router will disturb the data to its destination. The data flows from one router to another until it reaches its destination host. Each router chooses a path to the next hop.
image Operating a routing on IP
the picture above shows a network where host C forwards the data packet between X and Y networks routing table on each device is used to forward data packets on the network of each segment.Routing protocols have the ability to dynamically build information in routing tables. In case of changes to the network, the routing protocol is able to update the routing information.
The Autonomous System
The Definition of the Autonomous System (AS) is part of understanding the Routing Protocol. The US is a logical part of a large IP Network. AS usually owned by a network organization. The US in administration by an authorized management. The US can be connected to the other US, both public and private. Illustrations about AS can be seen in the following figure;
image Autonomous System
Some routing protocols are used to determine the paths in the US system. The other is used for interconnection on a set of autonounous systems, namely:
Interior Gateway Protocol (IGP): with IGP routers can exchange routing information between the US. Examples of this protocol include Open Shortest Path First (OSPF) and Routing Information Protocol (RIP).
External Gateway Protocol (EGP): with EGP routers can exchange results between the US. Examples of this protocol include Border Gateway Protocol (BGP).
Routing IP Routing and Algorithm
algorithms are used to build and manage routing tables on devices. There are two ways to build a routing table, namely: Static Routing: This routing is built on the definition of the administrator. Dynamic Routing: This router can create its routing path automatically, by browsing the network and exchanging information between router routing. There are 3 categories of dynamic algorithms, namely:
o Distance Vector
o Link State
o Hybrid
Static Routing
Static routing is a route entry performed by an administrator to perform an extension of a data packet. The routing table entry can be done with existing programs on the device.
Distance Vector Routing
This routing uses the Bellman-Ford algorithm. Where each router on the network has the shortest path information to contact the next segment. So the inter-router will send each other the information, and finally, the shorter path will be more often chosen to be the path to the destination host.
The protocol that uses this algorithm is RIP.
Link State Routing
This routing uses a link state technique, where the answer of each router will glean information about the interface, bandwidth, round trip and so on. So between routers will exchange information, the most efficient to be taken as a path and in the entry into the routing table. The state information that is exchanged is called Link State Advertisement (LSA).
By using the shortest path decision-making algorithm First (SPF), the LSA information will be arranged in a way to form a routing path. The illustration of SPF can be seen in the following figure
image The Shortest Path First
Routing protocols that use algorithms include OSPF.
Routing Hybrid
Routing is a combination of Distance Vector and Link State routing. An example of using this algorithm is EIGRP.
Routing Information Protocol (RIP)
Routing protocols using distance vector algorithms, the Bellman Ford algorithm. It was first introduced in 1969 and is the first routing algorithm on the ARPANET.
The earliest version of the routing protocol was created by Xerox Parc's PARC Universal Packet Internetworking under the name Gateway Internet Protocol. It was renamed to Router Information Protocol (RIP) which is part of Xerox network Services.
Versions of RIP that support IP technology are included in the BSD system as a routed daemon.The RIP specifications can be seen in RFC 1058.
RIP is a routing protocol with distance vector algorithm, which counts the number of hops (count hops) as routing metrics. The maximum number of hops allowed is 15 hops. Each RIP router exchanges routing information every 30 seconds, via UDP port 520. To avoid routing loops, split horizon with poison reverse techniques are used. RIP is the easiest routing protocol for configuration.
RIP has 3 versions of RIPv1, RIPv2, RIPng
RIPv1 on RFC 1058, which uses classful routing, not using subnets. Does not support Long Variable Subnet Mask (VLSM).
RIPv2 was present around 1994, with the ability to improve Classless Inter-Domain Routing. Defined in RFC 2453.
RIPng is a RIP protocol for IPv6. Defined in RFC 2080.