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 is oo development, What is OO Development? OO development is a way...

What is OO Development? OO development is a way of thinking about software based on abstractions that exist in the actual world. Development refers to software lifecycle, desig

Declarative programming languages, Declarative programming languages: ...

Declarative programming languages: We notice that declarative programming languages can have some better compensation over procedural ones. Actually, it is often said that a J

Define synchronous bus, Define synchronous bus. Synchronous buses are t...

Define synchronous bus. Synchronous buses are the ones in which every item is transferred during a time slot(clock cycle) known to both the source and destination units. Synchr

Explain about encoding technique used in bitmaps indexes, Bitmaps commonly ...

Bitmaps commonly use one bitmap for each single distinct value. Number of bitmaps used can be decreased by opting for a dissimilar type of encoding. Space can be optimized but when

Execution error and compilation error, Execution error and compilation erro...

Execution error and compilation error: Errors like as mismatch of data types or array out of bound error are called as execution errors or runtime errors. These errors are us

Mplement a second-order low-pass filter using the finite dif, you will impl...

you will implement a second-order low-pass filter using the finite difference method. The finite difference method is a useful mathematical method that is used to numerically solve

Define message passing, Q. Define Message Passing? The PVM communicatio...

Q. Define Message Passing? The PVM communication model offers asynchronous blocking receive and asynchronous blocking send and nonblocking receive functions. In our terminology

Name the languages introduced in second generation, Name the languages intr...

Name the languages introduced in second  generation During  the time of  second  generation  many  high  level  programming  languages  were introduced, such as FORTRAN (1956),

Why timing signal distributor required, Q. Why Timing Signal Distributor r...

Q. Why Timing Signal Distributor required? What do you mean by Memory Cycle? How many Memory Cycles required for following instructions: 1. ADD 2. CLEAR and ADD 3. DC

Prove, state and prove distributive law?

state and prove distributive law?

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