How optimization is achieved in dns, Computer Engineering

Assignment Help:

How optimization is achieved in DNS?

Two primary optimizations used in DNS and they are: replication and caching. All root servers is replicated; various copies of the server exist around the world. While a new site joins the internet, the site configures its local DNS server along with a list of root server. The site server uses any root server is most responsive at a provided point of time. Into DNS caching each server maintains a cache of names. When this looks up a new name, the server puts a copy of the binding in its cache. Before contacting other server to request a binding, the server checks its cache; when the cache have the answer the server uses the cached answer to produce a reply.


Related Discussions:- How optimization is achieved in dns

What are different adder circuits you studied, Half Adder (for addition of ...

Half Adder (for addition of two bits) Full Adder (for addition of three bits) Carry look ahead adder Carry save adder Carry propagate adder

What is digital versatile disk read only memory, DVD-ROM employs same princ...

DVD-ROM employs same principle as a CD-ROM for reading and writing. However a smaller wavelength laser beam is used. Total capacity of DVD-ROM is 8.5GB. In double-sided DVD-ROM two

Explain in detail about the random scan display, Explain in detail about th...

Explain in detail about the Random Scan Display   This device using CRT directs the electron beam only to the parts of the screen where a picture is to be drawn. This kind of d

What are qualified associations, What are qualified associations? A qua...

What are qualified associations? A qualified association is an association in which an attribute known as the qualifier disambiguates the object many associated end.

Arc consistency, Arc Consistency: There have been many advances in how...

Arc Consistency: There have been many advances in how constraint solvers search for solutions (remember this means an assignment of a value to each variable in such a way that

Id3 algorithm, ID3 algorithm: Further for the calculation for informat...

ID3 algorithm: Further for the calculation for information gain is the most difficult part of this algorithm. Hence ID3 performs a search whereby the search states are decisio

Existential elimination, Existential Elimination : Now we have a sente...

Existential Elimination : Now we have a sentence, A, is with an  existentially quantified variable, v, so then just for every constant symbol k, that it does not appear anywhe

Give example of bus and memory transfer, Give example of bus and memory tra...

Give example of bus and memory transfer For example, the read operation for transfer of a memory unit M from address register AR to another data register DR can be illustrated

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