What is internet routing hierarchy, Computer Engineering

Assignment Help:

Q. What is Internet Routing Hierarchy?

So how do packets find their way across Internet? Does every computer connected to Internet know where other computers are? Do packets basically get 'broadcast' to each computer on the Internet? Answer to both the preceding questions is 'no'. No computer knows where any of the other computers are and packets don't get sent to each computer. Information used to get packets to their destinations is contained in routing tables kept by every router connected to Internet.

Routers are packet switches. A router is typically connected between networks to route packets between them. Each router knows about its sub-networks and which IP addresses they use. Router usually doesn't know what IP addresses are 'above' it. Examine the figure below. Black boxes connecting backbones are routers. Larger NSP backbones at the top are connected at a NAP. Under them are various sub-networks and under them, more sub-networks. At bottom are two local area networks with computers attached.

170_What is Internet Routing Hierarchy.png

Figure: Routes Connecting in Network

When a packet arrives at a router, router examines IP address put there by IP protocol layer on originating computer. Router checks its routing table. If network containing IP address is found, packet is sent to that network. If network comprising IP address isn't found, then router sends the packet on a default route, usually up backbone hierarchy to the next router. Confidently subsequent router will know where to send packet. If it doesn't, again packet is routed upwards till it reaches a NSP backbone. Routers connected to NSP backbones hold the largest routing tables and here packet would be routed to correct backbone, where it will begin its journey 'downward' through smaller and smaller networks till it finds its destination.


Related Discussions:- What is internet routing hierarchy

What is a heap, What is a heap? A complete binary tree, every of whose ...

What is a heap? A complete binary tree, every of whose elements contains a value that is  greater than or equal to the value of every of its children is known a Heap

Potential of parallelism-parallel computing, Potential of Parallelism P...

Potential of Parallelism Problems in the actual world differ in respect of the degree of natural parallelism inherent in the personal problem domain. Some problems may be simpl

Explain how the server control validation controls work, Briefly explain ho...

Briefly explain how the server control validation controls work? A validation control works by evaluating the value of an input server control on the page to see whether it me

What is the gray equivalent of decimal number 25, What is the Gray equivale...

What is the Gray equivalent of  (25) 10 Ans. Gray equivalent of (25) 10 : The Decimal number 25 has binary equivalent as (00100101) 2 The left most bits (MSB) into gray

Invoke on the dataadapter control, Which method do you invoke on the DataAd...

Which method do you invoke on the DataAdapter control to load  your generated dataset with data? DataAdapter.Fill(ds). The beauty of this method is it automatically implicitly

For what is defparam used, For what is defparam used? Though,  during  ...

For what is defparam used? Though,  during  compilation  of  Verilog  modules,  parameter  values  can  be  altered  separately  for every module instance. This allows us to pa

What are the two primary models of supply chain management, What are the tw...

What are the two primary models of Supply Chain Management? The Two Primary models of Supply Chain Management are:- 1.  Porter's Value Chain Model 2. Supply Chain Model

Explain the types of computer architecture, Explain the types of computer a...

Explain the types of computer architecture Computer architecture can be divided into three main categories: Instruction Set Architecture, or ISA, is the image of a computing

Difference between depth first and breadth first traversing, Explain the di...

Explain the difference between depth first and breadth first traversing techniques of a graph.   Depth-first search is dissimilar from Breadth-first search in the following way

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