The following is an example showing a small part of the routing table on .:Ĭodes: C - connected, S - static, I - IGRP, R - RIP, M - mobile, B - BGPĭ - EIGRP, EX - EIGRP external, O - OSPF, IA - OSPF inter areaĮ1 - OSPF external type 1, E2 - OSPF external type 2, E - EGP WhenĪ router receives an incoming packet, it checks the destination addressĪnd attempts to associate this address with a next hop. Networks and its corresponding "next hop" on the way its destination. Routing algorithms fill routing tables with a list of This informationĬan vary widely depending on which routing algorithm generated the routes. To aid in this process of path determination, routing algorithms initializeĪnd maintain routing tables, which contain route information. That is used by routing algorithms to determine the optimal path to a destination. Of routing, the latter can be referred to as switching.Ī metric is a standard of measurement, such as path length, Groups, also known as packets, through an internetwork. Optimal routing paths for destination networks and transporting information Routing involves two basic activities: determining the Packet may travel through a number of network points with routers before Their conditions and uses this information along with distance and costĪlgorithms to determine the best route for a given packet. A router creates or maintains a table of the available routes and Of networks or gateway, including each Internet State of the networks it is connected to. The router is connected to at least two networksĪnd makes a decision which way to send each data packet based on its current Point to which a packet should be forwarded toward Routers or software in a computer determines the next network Routing is a way to get one packet from one destination Cisco Default Administratitve Distances.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |