Routing table - network layer and routing , Computer Networking

Assignment Help:

Routing Table

A routing  table has columns  for at  three types o information  the network  ID  the cost  and the  ID of the  next  router. The  network  ID is the final  destination of the packet. The cost  is  the number of hops  a packets  must make  to get  there. And  the next  router is the router  to which  a packet  must  be delivered  on its  way  to a particular destination.

The  original  routing  tables for  our sample  internetwork  are show  in this point  the third  column is empty because the only  destination network  identified  are those  attached to the current  router.

No multiple  hop  destination and  therefore  no next  router have been identified. These  basic  tables  are sent out to neighbours. For  example A sends is  routing take  to routers B, F sends E, B send it routing table  to routers C and A  and so on:

When a receives  a routing  from  B it uses the information to update  its own  table. A adjusts  the information  shown B table by  adding  one to  each listed cost. It then  combines  the table  with it own to create a new  more comprehensive  table.

This  process  continues for all routers. Every  router  receives information from  neighbours  and updates its  routing  table. If  there are no more  changes the final  tables  may look like  those shown.


Related Discussions:- Routing table - network layer and routing

Physical addressing in a wan, PHYSICAL ADDRESSING IN A WAN:  The physi...

PHYSICAL ADDRESSING IN A WAN:  The physical addressing in a WAN is same as in LAN in the following way: The data is send in packets equivalent to frames. Every pack

Synchronous tdm and statistical tdm, Difference between synchronous tdm and...

Difference between synchronous tdm and statistical tdm

Intradomain and interdomain routing protocols?, Describe the concept of int...

Describe the concept of intradomain and interdomain routing protocols?

Shortest path tree and minimum-spanning tree, We studied Dijkstra's link-st...

We studied Dijkstra's link-state routing algorithm for computing the unicast paths that are individually the shortest paths from the source to all destinations. The union of these

Types of topologies, TWO DIFFERENT KINDS OF TOPOLOGIES: LOGICAL TOPOL...

TWO DIFFERENT KINDS OF TOPOLOGIES: LOGICAL TOPOLOGY:  It is described by the specific network technology. PHYSICL TOPOLOGY: It relays on the wiring scheme. NE

Define remote procedure call (rpc), RPC adumbrates the intricacies of the ...

RPC adumbrates the intricacies of the network by using the ordinary procedure call mechanism familiar to each programmer. A client process calls a function on a remote server and

Reliability probability of success, Reliability is the probability of succe...

Reliability is the probability of success ; where success is defined as compliance to specified requirements. A system or an item is considered reliable if it performs satisfactori

Fiber optic extension, FIBER OPTIC EXTENSION:  The LAN extension using f...

FIBER OPTIC EXTENSION:  The LAN extension using fiber optic is given in the figure below:   Figure The fiber-modem translates digital data into pulses of light the

Bens network, Bens Network  Ben's network is a non-blocking network. ...

Bens Network  Ben's network is a non-blocking network.  It is a different  type of Clos network where initial and final stage consists of  2×2 switches (for n input  and m ou

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd