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

Demonstration of a micro controller system, Within the Microelectronics cen...

Within the Microelectronics centre we support the following microcontrollers 68HC11, 80C51 and the PIC16C5xx series; we have a set of software tools and emulators to help debug hig

How does tcp/ip decide the size of an ip fragment, How does TCP/IP decide t...

How does TCP/IP decide the size of an IP fragment? Explain. TCP/IP protocol utilizes the name IP datagram to refer to an Internet packet. The amount of data carried into a data

Fifo discipline, You have been retained to examine how many check-in agents...

You have been retained to examine how many check-in agents should be used at a check-in counter for a big hotel. During normal business hours, customers arrive at a rate of about 2

Health care professional, Overall, Mr. X is an intelligent and high-functio...

Overall, Mr. X is an intelligent and high-functioning man with good psychological, social, and occupational functioning. The test battery did not reveal any difficulties that warra

Using library methods returns number of threads, Q. Using Library methods r...

Q. Using Library methods returns number of threads? #include void subdomain(float x[ ], int istart, int ipoints) { int i; for (i = 0; i x[istart+i] = 123.456;

How to write good assembly programs, Preparation of writing the program ...

Preparation of writing the program 1.  Write an algorithm for your program closer to assembly language. For instance the algorithm for preceding program will be: get NUM1

What is a scope resolution operator, A scope resolution operator (::), can ...

A scope resolution operator (::), can be used to describe the member functions of a class outside the class.

Final implementation of object oriented modelling, Final Implementation of ...

Final Implementation of Object oriented modelling Final Implementation: At this phase, the final execution of classes and  relationships developed while object design takes

Virtual memory - computer architecture, Virtual memory: Virtual memory...

Virtual memory: Virtual memory is a technique which realized an application program the idea that it has contiguous working memory (an address space), whereas in fact it may b

Payment, how can get payment

how can get payment

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