Explain non-adapting routing, Computer Engineering

Assignment Help:

Explain non-adapting routing.

Systems which do not implement adaptive routing are explained as using non-adapting or static routing, which routes by a network are explained by fixed paths as statically. A change, a loss of a node or loss of a connection among nodes, is not compensated for. It means that anything which wishes to take an affected path will either have to wait for the failure to be revamped before restarting its journey or it will have to fail to reach its destination and quit the journey.


Related Discussions:- Explain non-adapting routing

Why is fragmentation needed on internet not on a typical wan, Why is fragme...

Why is fragmentation needed on Internet not on a typical WAN? TCP/IP protocol utilizes the name IP datagram to demote to an Internet packet. The amount of data carried into a d

Properties of electronic cash, Properties : 1.  Monetary Value: Monetar...

Properties : 1.  Monetary Value: Monetary value must be backed by also cash, bank - authorized credit cards or bank certified cashier's cheque. 2.  Interoperability: E-cash

What are the entities that swapped out of the main memory, What are the ent...

What are the entities that are swapped out of the main memory while swapping the process out of the main memory? All memory space occupied by the process, process's u-area, and

What is an i/o interface, What is an I/O Interface? Input-output interf...

What is an I/O Interface? Input-output interface provides a method for transferring binary information among internal storage, like memory and CPU registers, and external I/O d

Explain about computer architecture, Explain about Computer architecture ...

Explain about Computer architecture Computer architecture is the conceptual design and fundamental operational structure of a computer system. It is a blueprint and functional

What is reducibility, What is reducibility?  The primary method of prov...

What is reducibility?  The primary method of proving some problems are computationally unsolvable.       It is known as reducibility. Reducibility always includes two problems

Explain variable-partition contiguous storage allocation, Explain the conce...

Explain the concept of variable-partition contiguous storage allocation. Suppose that we have 1024K main memory available in that 128K is occupied through operating system pro

State and prove demorgan’s first theorems, State and prove Demorgan’s First...

State and prove Demorgan’s First theorems: Ans. Statement of First Theorem of De Morgan: = A‾. B‾   Proof: The two sides of the equation i.e. = is represented with logic

Indirect addressing mode - assembly language, Indirect addressing mode - as...

Indirect addressing mode - assembly language: The Indirect addressing mode and the address field of the instruction refers to the address of a word in memory, which in turn co

Basic operational concepts of a computer, Basic Operational Concepts of a C...

Basic Operational Concepts of a Computer: Most of computer operations are executed in the ALU (arithmetic and logic unit) of a processor. For an example: to add 2 numb

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