RAP is an open distance vector routing protocol that allows the routing information of devices used in computer networks to be distributed from Internet Service Provider (ISP) systems to LAN and WAN environments with devices with Internet connectivity.
RAP (Route Access Protocol)
The routing protocol specifies how routers should communicate with each other, and its main task is to help them choose the best routes between any two nodes in a computer network.
Routing algorithms work by choosing a specific route. Since each router only has prior knowledge of the networks directly connected to it, a routing algorithm is not used in this case.
In short, a routing protocol shares that information first between close neighbors and then across the network to determine the best route between networks. In this way, Routers analyze the entire topology of the network and add it to the table.
The Route Access Protocol was presented for the first time in 1993 by R. Ullman as an RFC document. The purpose of this protocol is a generalized protocol, unlike others, between external and internal networks.
Therefore, it is designed to work in both small and large systems.
Distance vector routing was chosen for RAP for scalability and efficiency, and it runs on TCP port 38 via an asymmetric connection between ports. Also, UDP can work on port 38.
RAP spreads the routes of the network diagrams in the opposite direction through the respective routes. In addition, it can restrict resources to provide a certain security measure and add them to the respective routes if security filters are created in the IP routing layer.
When a connection between local or remote networks is established, RAP only sends new or changed routing information. This routing information is deleted by the system every time the session ends.
When the connection between devices is lost, each device clears all the paths offered by the neighboring device.