Encrypting your link and protect the link from viruses, malware, thief, etc! Made your link safe to visit.
The routing process occurs on the third layer (i.e. the network layer, e.g. Internet Protocol) of the seven-layer OSI stack protocol.
In order to run the routing process, things to be aware of in the router are its destination address, the various routers involved in order to learn a network remote that was created, and the best router on each network.
Information about the router is stored in the routing table, which tells you how to find the network remote.
Types of Routing
The types of routing can be differentiated based on the nature of routing, routed and routing protocols and class in routing protocols. For more details below, it will be explained about the sharing of routing types:
A. Based on Nature Routing
1. Static Routing
It is a routing performed by the network Anministrator manually. Namely by means of input routing table settings that are sumbet from the router. That setting will depict the path of a package to the destination through which interfaces will be skipped.
- On the router's CPU, there is no processing time (overhead).
- Among routers there is no bandwidth used.
- Security guarantees, as network administrators will select routing access settings on certain networks
- Administrators should be able to understand internetwork on a system and router, in order to be able to connect and function properly.
- When a network is added to the internetwork, the network administrator must be able to add routing tables to all routers that are connected manually.
- On a computer network with large-scale static routing is not suitable for use.
2. Default Routing
Manual delivery of packets to the next router hop is a function of this routering. That is by adding a router to the destination network, the Remotenya control is not available in routering table. Used on a network that has one outbound path.
- Simple configuration, because the administrator only need to enter one type of routing command only and all routes will be performed/skipped.
- There is no routing needed, allowing all routers to accept the routing (which is not required). And the use of hardware increases and the work of the router becomes long.
- 3. Dynamic Routing
- The routing process is done by creating an automated data communication path, which is set according to the configuration. If topolodi changes occur in the network, then the new routing path will be created by the router automatically. Dynamic Routing is located on the network layer of the computer layer on the TCP/IP Protocol Suites. Dynamic routing also serves to locate the network and perform a routing table update on the router.
- Only know the specific host address (which is connected to the router).
- If there is a network connection, there is no need to rearrangement all routers.
- Easier to use than static and default routing.
- The router workload becomes heavy due to updates to the routing table at any given time.
- The recognition speed and completeness of the routing table take a long time.
B. Based on Routed and Routing Protocol
1. Routed Protocol
It is the protocol on the router that is used to send user data from one network to another. Routed protocol brings data traffic such as file transfer, e-mail and other network traffic. Examples of routed protocols: IPX, IP, DECnet and AppleTalk.
2. Routing protocol
Being a protocol on a computer network, its function dynamically learns a network that is connected and Membrodcast, and learns the existing network path. If different router can exchange updates through routing protocol. For example BGP, EIGRP, RIP and OSPF.
- Border Gateway Protocol (BGP)
One type of protocol in data communication. Its ability to exchange routes, collect routes, determine the route to its destination location on a network. Equipped with algorithms. BGP is a category routing protocol EGP (Exterior Gateway Protocol).
- Enhanced Interior Gateway Routing Protocol (EIGRP)
It uses different cost balancing and advanced distance vector algorithms. The algorithm is a combination of link-state and distance vector and uses DUAL (Diffusing Update Algorithm) to calculate the shortest route.
- Routing Information Protocol (RIP)
It is the protocol that regulates the routing table according to the connected router. And the router further gives the information to the connected router directly.
- Open Shortest Path First (OSPF)
The standard Routing is used on some network vendors and is described in RFC 2328. Equipped with a link-state algorithm or called Dijkstra/SPF algorithm.
The way Ptotokol works: The shortest path of a "tree" will be constructed and then filled with the best routes by the routing table generated from the "tree". OSPF only plays a role in supporting IP routing. Update routing will occur when there is a network topology change and is done floaded.
C. Class in Routing Protocol
1. Distance Vector
The protocols belonging to this class category will determine the best route to a network based on route mileage. Routing path/route with the most short hop distance to the intended network will be the best track option.
2. Link State
Another term is protocol shortest-path-first. The Tablen routing in the router has a unique function, which is a separate routing function table and becomes 3 tables. The first serves to record changes from direct connected networks. The second serves to define topologies on the entire internetwork. And the third serves for routing tables.
This latter protocol belongs to a class that uses aspects of both distance-vector and link-state routing protocols.
That's an explanation of the types of routing based on the nature of routing, routing protocols and Protocol classes used. Hopefully useful and easy to understand!