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 the defining traits of an object-oriented language, The defining t...

The defining traits of an object-oriented language are: * Encapsulation * Inheritance * Polymorphism

Explain traditional computer clusters, Q. Explain traditional computer clus...

Q. Explain traditional computer clusters? Grid computing employs resources of a lot of separate computers linked by a network (generally internet) to resolve large-scale comput

Diffrentiate between non-relocatable & relocatable programs, How non-reloca...

How non-relocatable programs are different from relocatable programs? Non relocatable program: It is one that cannot be made to execute in any type of area of storage other t

What are the advantages and disadvantages of a smart card, What are the adv...

What are the advantages and disadvantages of a Smart Card?    Advantages of Smart Card: 1. It gives convenience & support for multiple currencies over borders. 2. Used

Operation research, how to implement a modified distribution method using c...

how to implement a modified distribution method using c/c++

Minimization of the logic function using k-maps, Minimize the logic functio...

Minimize the logic function F(A, B, C, D) = ∑ m(1,3,5,8,9,11,15) + d(2,13) using K-maps Ans. The logic function minimization of F(A, B, C, D) = ∑ m(1,3,5,8,9,11.15) + d(2,13) by

Explain data parallel programming, Q. Explain Data Parallel Programming? ...

Q. Explain Data Parallel Programming? In data parallel programming model major focus is on performing concurrent operations on a data set. The data set is characteristically or

Explains the various levels of parallel processing, Levels of parallel proc...

Levels of parallel processing We could have parallel processing at four levels. i)  Instruction Level: Most processors have numerous execution units and can execute numero

Robotics artificial intelligence, what is robot?explain different types of ...

what is robot?explain different types of robots with respect to joints.

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