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

Explain segmentation, Explain segmentation? Segment memory addressing ...

Explain segmentation? Segment memory addressing divides memory into many segments. Each of these segments can be considered as a linear memory space. Every one of these segmen

Search mechanisms in prolog, Search mechanisms in Prolog: Here we can ...

Search mechanisms in Prolog: Here we can needs this simple Prolog program to describe how Prolog searches as:president(X) :- first_name(X, georgedubya), second_name(X, bush).

Show the foundation of ALU design, Q. Show the foundation of ALU design? ...

Q. Show the foundation of ALU design? The foundation of ALU design starts with micro-operation implementation. Thus let's first explain how bus can be used for Data transfer m

Why disable statements are not allowed in functions, Why disable statements...

Why disable statements are not allowed in functions? If  disble  statement  is used  in function,it  invalids  function  and  its  return  value.  So  disable statements aren't

Designing logic circuits, When designing a logic circuit with multipleoutpu...

When designing a logic circuit with multipleoutputs it is usual to treat it as several circuitseach with one output. So for our example wewould design three circuits; one with outp

What is the network service access policy, What is the Network Service Acce...

What is the Network Service Access Policy A high-level, issue-specific policy which defines those services that are allowed or denied from the restricted network. It also co

Explain dataflow computing, DATAFLOW COMPUTING A substitute to the Von ...

DATAFLOW COMPUTING A substitute to the Von Neumann model of calculation is dataflow computation model. In the dataflow model, control is tied to flow of data. Order of instruct

Define nondeterministic tm, Define nondeterministic TM?  Arbitraril...

Define nondeterministic TM?  Arbitrarily chooses move when more than one possibility exists Accepts if there is at least one computation that terminates in an acceptin

Logic gates required to build a half adder, What are the gates required to ...

What are the gates required to build a half adder ? Ans. The gates needed to build a half adder are EX-OR gate and AND gate as shown below the logic diagram of half adder:

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