Thailand Web Hosting
Thailand Web Hosting services & Thai Hosting with unlimited bandwidth and 100% uptime rate Thai Host with 5000 of clients - Web Hosting and Reseller from Bangkok - Thailand
webhsoting
Webhosting is a business that provides servers or computers for your website to actually reside in. It allows users all over the world to be able to access your website.
replica rolex
italianreplica represents one of the best replica Swiss Replica watch manufacturing companies with a vast product line
Free Domain Hosting
Comprehensive guide to free web hosting, as well as free domain hosting, free PHP/MySQL hosting, free ASP hosting and many more free web hosting resources.
hosting, chosting, reseller
Stabilne i bezpieczne konta www, zakladanie kont reseller, profesjonlany hosting.
Best Domain Web Hosting
Best web hosting, best domain hosting, best shared web hosting, best unix web hosting, best linux web hosting, best php web hosting, best windows web hosting, best reseller hosting, best dedicated servers.
Web Hosting Australia and Indonesia
Web Hosting in Indonesia and Australia. Service Specializing In Fast and Affordable Web Hosting. Offers Shared Web Hosting, Reseller Hosting, Dedicated Server, Domain Registration, and Web Development.
hosting
Manic Webs Inc. provides the latest technology in affordable cheap windows hosting.
domain names
great value domain names and web hosting. australian based servers and support.
Whois, dominios, registro de dominios, alojamiento web
whois, Dominios, registro de dominios, alojamiento, hosting, alojamiento web, host, soluciones profesionales.
Business Web Hosting Finder
Find the ideal web hosting company for your business. Windows Web Hosting, Linux Hosting, ColdFusion, Reseller Hosting, Dedicated Server hosting and more.
Free Web Hosting
Free Web Site Hosting Guide, Directory, Index, Resources, Articles, FAQs, Dedicated Servers and Much More.
hosting
best value australian webhosting. save money with self service model. check it out
E-World Center Hosting Website!
Total hosting solution - You don't need to know anything about computers. Hosting with us is a total solution package. Let's do the job for you.
Domain services
Great Domain Hosting and Services. Mail, Servers, eShops, Sharepoint
Web Hosting Email Services Domain Name Register
Web Hosting Email Services Domain Name Register website development ASP.NET, ASP, SQL
top 10 webhosting
We collect all the web Hosting top 10 lists and reviews to help you choose the best Web Hosting Service.
host, alojamiento, hosting, registro de dominios
International hosting, web hosting, web solutions, spain
Art-Host, The Best Web Hosting Services with CPanel or DirectAdmin.
Web Hosting, Quality Web Hosting Managed Hosting Services by Art-Host, Web Hosting, Managed Virtual Hosting Services Hosting by art-host.ru and art-host.org mysql hosting, reselling hosting, host, web, linux, web space hosting, linux hosting, php, PhpMyAdmin
website hosting
best value web hosting service provider in australia
1stEuro.net Host unlimited Domains
affordable and secured linux webhosting with cPanel, Fantastico, RVSkins, unlimited mySQL, PHP, PostgreSQL, phpMyAdmin, chat, osCommerce, Agora, Shop and free 128 bit SSL. Server in US and UK. Starts at 0.45 - Resellers get unlimited domain hosting
affordable web hosting
Linux is a comprehensive, stable platform. Linux Web Hosting coupled with Apache is able to accommodate all of the most requested Web Hosting account options.
New Zealand web hosting
Web Page Hosting in New Zealand for Personal, Business and E-Commerce Websites. Impact Host Limited New Zealand Web Hosting Company. Website and webpage hosting
web hosting 4 domains hosted 8 GB web space 110 GB traffic $9.99 MONTH
Usa webhosting, professional website hosting solutions and services. we provide gaming servers ,dedicated servers,cpanel web hosting,free image hosting,free online games,reseller hosting and alot more http://usawebhosting.biz we are a active Better Business Bureau member vist are site and click onto the bbbonline seal for info.
domain name registration
Web hosting and domain names, instant access. fast support. best value on the australian continent.
Sunday, May 13, 2007
Domain names
Domain names
The first step when you are creating a new website is to choose the name for it. Domain names is best when they are easy to remember, short and easy to spell.
Of course if you have an established company you want select your company name as domain. Your domain will be connected to one of the tld, top level domains. The main top level domain is .com. But other alternatives if your prefered .com name is taken are .net,.org,.us, .info, .biz and many country specific domains as .to,.tv.
Register the domain name which are your brand name if you already have a known brand. It will be easier to market and for people to remember.
Avoid hyphenated names like my-domain-here.com beacause they are harder to market and to remember.
And at last get that domain name before somebady else does.
The first step when you are creating a new website is to choose the name for it. Domain names is best when they are easy to remember, short and easy to spell.
Of course if you have an established company you want select your company name as domain. Your domain will be connected to one of the tld, top level domains. The main top level domain is .com. But other alternatives if your prefered .com name is taken are .net,.org,.us, .info, .biz and many country specific domains as .to,.tv.
Register the domain name which are your brand name if you already have a known brand. It will be easier to market and for people to remember.
Avoid hyphenated names like my-domain-here.com beacause they are harder to market and to remember.
And at last get that domain name before somebady else does.
What is webhosting?
What is webhosting?
You wonder what webhosting is here are the answers?
Webhosting is the service to host your web pages at a server connected to internet. It´s a file server which serves the clients "web surfers" with webpages and other files such as movies, pictures etc.
There are free webhosting and paid ones. Domain hosting includes to option to use your own internet domain name. Subdomain hosting is when you get some name like yourname.hosting.com
You wonder what webhosting is here are the answers?
Webhosting is the service to host your web pages at a server connected to internet. It´s a file server which serves the clients "web surfers" with webpages and other files such as movies, pictures etc.
There are free webhosting and paid ones. Domain hosting includes to option to use your own internet domain name. Subdomain hosting is when you get some name like yourname.hosting.com
What is webhosting?
What is webhosting?
You wonder what webhosting is here are the answers?
Webhosting is the service to host your web pages at a server connected to internet. It´s a file server which serves the clients "web surfers" with webpages and other files such as movies, pictures etc.
There are free webhosting and paid ones. Domain hosting includes to option to use your own internet domain name. Subdomain hosting is when you get some name like yourname.hosting.com
You wonder what webhosting is here are the answers?
Webhosting is the service to host your web pages at a server connected to internet. It´s a file server which serves the clients "web surfers" with webpages and other files such as movies, pictures etc.
There are free webhosting and paid ones. Domain hosting includes to option to use your own internet domain name. Subdomain hosting is when you get some name like yourname.hosting.com
Saturday, May 5, 2007
Pay per click
Pay per click (PPC) is an advertising technique used on websites, advertising networks, and search engines.
Advertisers bid on "keywords" that they believe their target market (people they think would be interested in their offer) would type in the search bar when they are looking for their type of product or service. For example, if an advertiser sells red widgets, he/she would bid on the keyword "red widgets", hoping a user would type those words in the search bar, see their ad, click on it and buy. These ads are called "sponsored links" or "sponsored ads" and appear next to and sometimes above the natural or organic results on the page. The advertiser pays only when the user clicks on the ad.
While many companies exist in this space, Google AdWords and Yahoo! Search Marketing, which was formerly Overture, are the largest network operators as of 2006. In the spring of 2006, MSN started beta testing their own in-house service, MSN adCenter. In recent years agencies have also arisen to facilitate the use of pay-per-click advertising, such as Latitude White in the UK, leading to refinements in the PPC keywords-matching system. Depending on the search engine, minimum prices per click start at US$0.01 (up to US$0.50). These prices can reach up to GBP£18+ [1]per click for services such as unsecured personal loans. Very popular search terms can cost much more on popular engines. Arguably this advertising model may be open to abuse through click fraud, although recently Google and other search engines have implemented automated systems to guard against this.
Categories
PPC engines can be categorized in "Keyword", "Product", "Service" engines. However, a number of companies may fall in two or more categories. More models are continually evolving. Currently, pay per click programs do not generate any revenue solely from traffic for sites that display the ads. Revenue is generated only when a user clicks on the ad itself.
Keyword PPCs
Advertisers using these bid on "keywords", which can be words or phrases, and can include product model numbers. When a user searches for a particular word or phrase, the list of advertiser links appears in order of the amount bid. Keywords, also referred to as search terms, are the very heart of pay per click advertising. The terms are guarded as highly valued trade secrets by the advertisers, and many firms offer software or services to help advertisers develop keyword strategies.
As of 2005, notable PPC Keyword search engines include: Google AdWords, Yahoo! Search Marketing (formerly Overture Services), Microsoft adCenter, LookSmart, Miva (formerly FindWhat), Ask (formerly Ask Jeeves), 7Search, Kanoodle, and Baidu.
Product PPCs
"Product" engines let advertisers provide "feeds" of their product databases and when users search for a product, the links to the different advertisers for that particular product appear, giving more prominence to advertisers who pay more, but letting the user sort by price to see the lowest priced product and then click on it to buy. These engines are also called Product comparison engines or Price comparison engines.
Noteworthy PPC Product search engines are: BizRate.com, Shopzilla.com, NexTag, PriceGrabber.com, and Shopping.com.
Service PPCs
"Service" engines let advertisers provide feeds of their service databases and when users search for a service offering links to advertisers for that particular service appear, giving prominence to advertisers who pay more, but letting users sort their results by price or other methods. Some Product PPCs have expanded into the service space while other service engines operate in specific verticals.
Noteworthy PPC services include NexTag, SideStep, and TripAdvisor.
Pay per call
Similar to pay per click, pay per call is a business model for ad listings in search engines and directories that allows publishers to charge local advertisers on a per-call basis for each lead (call) they generate. The term "pay per call" is sometimes confused with "click to call"[1]. Click-to-call, along with call tracking, is a technology that enables the “pay-per-call” business model.
Pay-per-call is not just restricted to local advertisers. Many of the pay-per-call search engines allows advertisers with a national presence to create ads with local telephone numbers.
According to the Kelsey Group, the pay-per-phone-call market is expected to reach US$3.7 billion by 2010.
Advertisers bid on "keywords" that they believe their target market (people they think would be interested in their offer) would type in the search bar when they are looking for their type of product or service. For example, if an advertiser sells red widgets, he/she would bid on the keyword "red widgets", hoping a user would type those words in the search bar, see their ad, click on it and buy. These ads are called "sponsored links" or "sponsored ads" and appear next to and sometimes above the natural or organic results on the page. The advertiser pays only when the user clicks on the ad.
While many companies exist in this space, Google AdWords and Yahoo! Search Marketing, which was formerly Overture, are the largest network operators as of 2006. In the spring of 2006, MSN started beta testing their own in-house service, MSN adCenter. In recent years agencies have also arisen to facilitate the use of pay-per-click advertising, such as Latitude White in the UK, leading to refinements in the PPC keywords-matching system. Depending on the search engine, minimum prices per click start at US$0.01 (up to US$0.50). These prices can reach up to GBP£18+ [1]per click for services such as unsecured personal loans. Very popular search terms can cost much more on popular engines. Arguably this advertising model may be open to abuse through click fraud, although recently Google and other search engines have implemented automated systems to guard against this.
Categories
PPC engines can be categorized in "Keyword", "Product", "Service" engines. However, a number of companies may fall in two or more categories. More models are continually evolving. Currently, pay per click programs do not generate any revenue solely from traffic for sites that display the ads. Revenue is generated only when a user clicks on the ad itself.
Keyword PPCs
Advertisers using these bid on "keywords", which can be words or phrases, and can include product model numbers. When a user searches for a particular word or phrase, the list of advertiser links appears in order of the amount bid. Keywords, also referred to as search terms, are the very heart of pay per click advertising. The terms are guarded as highly valued trade secrets by the advertisers, and many firms offer software or services to help advertisers develop keyword strategies.
As of 2005, notable PPC Keyword search engines include: Google AdWords, Yahoo! Search Marketing (formerly Overture Services), Microsoft adCenter, LookSmart, Miva (formerly FindWhat), Ask (formerly Ask Jeeves), 7Search, Kanoodle, and Baidu.
Product PPCs
"Product" engines let advertisers provide "feeds" of their product databases and when users search for a product, the links to the different advertisers for that particular product appear, giving more prominence to advertisers who pay more, but letting the user sort by price to see the lowest priced product and then click on it to buy. These engines are also called Product comparison engines or Price comparison engines.
Noteworthy PPC Product search engines are: BizRate.com, Shopzilla.com, NexTag, PriceGrabber.com, and Shopping.com.
Service PPCs
"Service" engines let advertisers provide feeds of their service databases and when users search for a service offering links to advertisers for that particular service appear, giving prominence to advertisers who pay more, but letting users sort their results by price or other methods. Some Product PPCs have expanded into the service space while other service engines operate in specific verticals.
Noteworthy PPC services include NexTag, SideStep, and TripAdvisor.
Pay per call
Similar to pay per click, pay per call is a business model for ad listings in search engines and directories that allows publishers to charge local advertisers on a per-call basis for each lead (call) they generate. The term "pay per call" is sometimes confused with "click to call"[1]. Click-to-call, along with call tracking, is a technology that enables the “pay-per-call” business model.
Pay-per-call is not just restricted to local advertisers. Many of the pay-per-call search engines allows advertisers with a national presence to create ads with local telephone numbers.
According to the Kelsey Group, the pay-per-phone-call market is expected to reach US$3.7 billion by 2010.
AdWords
AdWords is Google's flagship advertising product, and main source of revenue. AdWords offers pay-per-click (PPC) advertising, and site-targeted advertising for both text and banner ads. The AdWords program includes local, national, and international distribution. Google's text advertisements are short, consisting of one title line and two content text lines. Image ads can be one of several different Interactive Advertising Bureau (IAB) standard sizes.
Pay-Per-Click advertisements (PPC)
Advertisers specify the words that should trigger their ads and the maximum amount they are willing to pay per click. When a user searches Google's search engine on www.google.com, ads for relevant words are shown as "sponsored link" on the right side of the screen, and sometimes above the main search results.
The ordering of the paid listings depends on other advertisers' bids (pay for placement P4P) and the "quality score" of all ads shown for a given search. The quality score is calculated by historical click-through rates and the relevance of an advertiser's ad text, keyword, and landing page to the search, as determined by Google. The quality score is also used by Google to set the minimum bids for an advertiser's keywords.[1]
The auction mechanism that determines the order of the ads has been called a "generalized second price" auction. It is a variation of the Vickrey auction.
[edit]
Site targeted advertisements
In 2003 Google introduced site-targeted advertising. Using the AdWords control panel, advertisers can enter keywords of interest, and Google offers to place ads on what they claim are relevant sites within their content network. Advertisers then bid on a cost per mille (CPM) basis for placement. However, Google does not provide advertisers with a list of sites where their ads have been placed, and there is evidence that many of the "content network" sites are merely ad pages set up on parked domains. Advertisers can provide a list of sites where they do not wish their ads to appear, but cannot obtain a list of sites where their ads could or do appear.
[edit]
AdWords distribution
All AdWords ads are eligible to be shown on www.google.com. Advertisers also have the option of enabling their ads to show on Google's partner networks. The "search network" includes AOL search, Ask.com, and Netscape. Like www.google.com, these search engines show AdWords ads in response to user searches.
The "content network" shows AdWords ads on sites that are not search engines. These content network sites are those that use AdSense, the other side of the Google advertising model. AdSense is used by publishers who wish to bring traffic to their websites. Click through rates on the content network are typically much lower than those on the search network and are therefore ignored when calculating an advertiser's quality score.
Google automatically determines the subject of pages and displays relevant ads based on the advertisers' keyword lists. AdSense publishers may select channels to help direct Google's ad placements on their pages, to better track performance of their ad units. There are many different types of ads you can run across Google's network, including text ads, image ads (banner ads), local business ads, mobile text ads, and in-page video ads.
Google AdWords' main competitors are Yahoo! Search Marketing and Microsoft adCenter.
[edit]
Click-to-Call
Google Click-to-Call is a service provided by Google which allows users to call advertisers from Google search results pages. Users enter their phone number, Google calls them back and connects to the advertiser. Calling charges are paid by Google.
[edit]
History
The AdWords product was launched in 2000.[2] At first advertisers would pay a monthly amount, and Google would set up and manage their campaign. To accommodate small businesses and those who wanted to manage their own campaigns, Google soon introduced the AdWords self-service portal. As of 2005, Google provides a campaign management service called Jumpstart [3] to assist advertisers in setting up their campaigns.
In 2005, Google launched a program to certify individuals and companies who have completed AdWords training and passed an exam. Due to the complexity of AdWords and the amount of money at stake, some advertisers hire a consultant to manage their campaigns.
[edit]
Legal context
AdWords has generated lawsuits in the area of trademark law and click fraud. In 2006, Google settled a click fraud lawsuit for US$90 million. [4]
Overture Services, Inc. sued Google for patent infringement in April 2002 in relation to the AdWords service. Following Yahoo!'s acquisition of Overture, the suit was settled in 2004 with Google agreeing to issue 2.7 million shares of common stock to Yahoo! in exchange for a perpetual license under the patent. [5]
[edit]
Technology
The AdWords system was initially implemented on top of the MySQL database engine. After the system had been launched, management decided to use a commercial database (Oracle) instead. As is typical of applications simultaneously written and tuned for one database, and ported to another, the system became much slower, so eventually it was returned to MySQL
Pay-Per-Click advertisements (PPC)
Advertisers specify the words that should trigger their ads and the maximum amount they are willing to pay per click. When a user searches Google's search engine on www.google.com, ads for relevant words are shown as "sponsored link" on the right side of the screen, and sometimes above the main search results.
The ordering of the paid listings depends on other advertisers' bids (pay for placement P4P) and the "quality score" of all ads shown for a given search. The quality score is calculated by historical click-through rates and the relevance of an advertiser's ad text, keyword, and landing page to the search, as determined by Google. The quality score is also used by Google to set the minimum bids for an advertiser's keywords.[1]
The auction mechanism that determines the order of the ads has been called a "generalized second price" auction. It is a variation of the Vickrey auction.
[edit]
Site targeted advertisements
In 2003 Google introduced site-targeted advertising. Using the AdWords control panel, advertisers can enter keywords of interest, and Google offers to place ads on what they claim are relevant sites within their content network. Advertisers then bid on a cost per mille (CPM) basis for placement. However, Google does not provide advertisers with a list of sites where their ads have been placed, and there is evidence that many of the "content network" sites are merely ad pages set up on parked domains. Advertisers can provide a list of sites where they do not wish their ads to appear, but cannot obtain a list of sites where their ads could or do appear.
[edit]
AdWords distribution
All AdWords ads are eligible to be shown on www.google.com. Advertisers also have the option of enabling their ads to show on Google's partner networks. The "search network" includes AOL search, Ask.com, and Netscape. Like www.google.com, these search engines show AdWords ads in response to user searches.
The "content network" shows AdWords ads on sites that are not search engines. These content network sites are those that use AdSense, the other side of the Google advertising model. AdSense is used by publishers who wish to bring traffic to their websites. Click through rates on the content network are typically much lower than those on the search network and are therefore ignored when calculating an advertiser's quality score.
Google automatically determines the subject of pages and displays relevant ads based on the advertisers' keyword lists. AdSense publishers may select channels to help direct Google's ad placements on their pages, to better track performance of their ad units. There are many different types of ads you can run across Google's network, including text ads, image ads (banner ads), local business ads, mobile text ads, and in-page video ads.
Google AdWords' main competitors are Yahoo! Search Marketing and Microsoft adCenter.
[edit]
Click-to-Call
Google Click-to-Call is a service provided by Google which allows users to call advertisers from Google search results pages. Users enter their phone number, Google calls them back and connects to the advertiser. Calling charges are paid by Google.
[edit]
History
The AdWords product was launched in 2000.[2] At first advertisers would pay a monthly amount, and Google would set up and manage their campaign. To accommodate small businesses and those who wanted to manage their own campaigns, Google soon introduced the AdWords self-service portal. As of 2005, Google provides a campaign management service called Jumpstart [3] to assist advertisers in setting up their campaigns.
In 2005, Google launched a program to certify individuals and companies who have completed AdWords training and passed an exam. Due to the complexity of AdWords and the amount of money at stake, some advertisers hire a consultant to manage their campaigns.
[edit]
Legal context
AdWords has generated lawsuits in the area of trademark law and click fraud. In 2006, Google settled a click fraud lawsuit for US$90 million. [4]
Overture Services, Inc. sued Google for patent infringement in April 2002 in relation to the AdWords service. Following Yahoo!'s acquisition of Overture, the suit was settled in 2004 with Google agreeing to issue 2.7 million shares of common stock to Yahoo! in exchange for a perpetual license under the patent. [5]
[edit]
Technology
The AdWords system was initially implemented on top of the MySQL database engine. After the system had been launched, management decided to use a commercial database (Oracle) instead. As is typical of applications simultaneously written and tuned for one database, and ported to another, the system became much slower, so eventually it was returned to MySQL
Domain name system
On the Internet, the Domain Name System (DNS) stores and associates many types of information with domain names; most importantly, it serves as the phone book for the internet, translating human-friendly domain names and computer hostnames, e.g. en.wikipedia.org, into computer-friendly IP addresses. It also lists mail exchange servers accepting e-mail for each domain. In providing a worldwide keyword-based redirection service, DNS is an essential component of contemporary Internet use.
Uses
The most basic use of DNS is to translate hostnames to IP addresses. It is in very simple terms like a phone book. For example, if you want to know the internet address of en.wikipedia.org, DNS can be used to tell you it's 66.230.200.100. DNS also has other important uses.
Pre-eminently, the DNS makes it possible to assign Internet destinations to the human organization or concern they represent, independently of the physical routing hierarchy represented by the numerical IP address. Because of this, hyperlinks and Internet contact information can remain the same, whatever the current IP routing arrangements may be, and can take a human-readable form (such as "wikipedia.org") which is rather easier to remember than an IP address (such as 66.230.200.100). People take advantage of this when they recite meaningful URLs and e-mail addresses without caring how the machine will actually locate them.
The DNS also distributes the responsibility for assigning domain names and mapping them to IP networks by allowing an authoritative server for each domain to keep track of its own changes, avoiding the need for a central registrar to be continually consulted and updated.
[edit]
History of the DNS
The practice of using a name as a more human-legible abstraction of a machine's numerical address on the network predates even TCP/IP, and goes all the way to the ARPAnet era. Back then however, a different system was used, as DNS was only invented in 1983, shortly after TCP/IP was deployed. With the older system, each computer on the network retrieved a file called HOSTS.TXT from a computer at SRI (now SRI International). The HOSTS.TXT file mapped numerical addresses to names. A hosts file still exists on most modern operating systems, either by default or through configuration, and allows users to specify an IP address (eg. 192.0.34.166) to use for a hostname (eg. www.example.net) without checking the DNS. As of 2006, the hosts file serves primarily for troubleshooting DNS errors or for mapping local addresses to more organic names. Systems based on a hosts file have inherent limitations, because of the obvious requirement that every time a given computer's address changed, every computer that seeks to communicate with it would need an update to its hosts file.
The growth of networking called for a more scalable system: one that recorded a change in a host's address in one place only. Other hosts would learn about the change dynamically through a notification system, thus completing a globally accessible network of all hosts' names and their associated IP Addresses.
Paul Mockapetris invented the DNS in 1983 and wrote the first implementation. The original specifications appear in RFC 882 and 883. In 1987, the publication of RFC 1034 and RFC 1035 updated the DNS specification and made RFC 882 and RFC 883 obsolete. Several more-recent RFCs have proposed various extensions to the core DNS protocols.
In 1984, four Berkeley students — Douglas Terry, Mark Painter, David Riggle and Songnian Zhou — wrote the first UNIX implementation, which was maintained by Ralph Campbell thereafter. In 1985, Kevin Dunlap of DEC significantly re-wrote the DNS implementation and renamed it BIND (Berkeley Internet Name Domain, previously: Berkeley Internet Name Daemon). Mike Karels, Phil Almquist and Paul Vixie have maintained BIND since then. BIND was ported to the Windows NT platform in the early 1990s.
Due to its long history of security issues, several alternative nameserver/resolver programs have been written and distributed in recent years.
[edit]
How the DNS works in theory
Domain names, arranged in a tree, cut into zones, each served by a nameserver.
The domain name space consists of a tree of domain names. Each node or leaf in the tree has one or more resource records, which hold information associated with the domain name. The tree sub-divides into zones. A zone consists of a collection of connected nodes authoritatively served by an authoritative DNS nameserver. (Note that a single nameserver can host several zones.)
When a system administrator wants to let another administrator control a part of the domain name space within his or her zone of authority, he or she can delegate control to the other administrator. This splits a part of the old zone off into a new zone, which comes under the authority of the second administrator's nameservers. The old zone becomes no longer authoritative for what comes under the authority of the new zone.
A resolver looks up the information associated with nodes. A resolver knows how to communicate with name servers by sending DNS requests, and heeding DNS responses. Resolving usually entails iterating through several name servers to find the needed information.
Some resolvers function simplistically and can only communicate with a single name server. These simple resolvers rely on a recursing name server to perform the work of finding information for them.
[edit]
Understanding the parts of a domain name
A domain name usually consists of two or more parts (technically labels), separated by dots. For example wikipedia.org.
The rightmost label conveys the top-level domain (for example, the address en.wikipedia.org has the top-level domain org).
Each label to the left specifies a subdivision or subdomain of the domain above it. Note that "subdomain" expresses relative dependence, not absolute dependence: for example, wikipedia.org comprises a subdomain of the org domain, and en.wikipedia.org comprises a subdomain of the domain wikipedia.org. In theory, this subdivision can go down to 127 levels deep, and each label can contain up to 63 characters,[1] as long as the whole domain name does not exceed a total length of 255 characters. But in practice some domain registries have shorter limits than that.
A hostname refers to a domain name that has one or more associated IP addresses. For example, the en.wikipedia.org and wikipedia.org domains are both hostnames, but the org domain is not.
The DNS consists of a hierarchical set of DNS servers. Each domain or subdomain has one or more authoritative DNS servers that publish information about that domain and the name servers of any domains "beneath" it. The hierarchy of authoritative DNS servers matches the hierarchy of domains. At the top of the hierarchy stand the root nameservers: the servers to query when looking up (resolving) a top-level domain name (TLD).
[edit]
The address resolution mechanism
(This description deliberately uses the fictional .example TLD in accordance with the DNS guidelines themselves.)
In theory a full host name may have several name segments, (e.g ahost.ofasubnet.ofabiggernet.inadomain.example). In practice, in the experience of the majority of public users of Internet services, full host names will frequently consist of just three segments (ahost.inadomain.example, and most often www.inadomain.example).
For querying purposes, software interprets the name segment by segment, from right to left, using an iterative search procedure. At each step along the way, the program queries a corresponding DNS server to provide a pointer to the next server which it should consult.
A DNS recurser consults three nameservers to resolve the address www.wikipedia.org.
As originally envisaged, the process was as simple as:
the local system is pre-configured with the known addresses of the root servers in a file of root hints, which need to be updated periodically by the local administrator from a reliable source to be kept up to date with the changes which occur over time.
query one of the root servers to find the server authoritative for the next level down (so in the case of our simple hostname, a root server would be asked for the address of a server with detailed knowledge of the example top level domain).
querying this second server for the address of a DNS server with detailed knowledge of the second-level domain (inadomain.example in our example).
repeating the previous step to progress down the name, until the final step which would, rather than generating the address of the next DNS server, return the final address sought.
The diagram illustrates this process for the real host www.wikipedia.org.
The mechanism in this simple form has a difficulty: it places a huge operating burden on the root servers, with each and every search for an address starting by querying one of them. Being as critical as they are to the overall function of the system such heavy use would create an insurmountable bottleneck for trillions of queries placed every day. The section DNS in practice describes how this is addressed.
[edit]
Circular dependencies and glue records
Name servers in delegations appear listed by name, rather than by IP address. This means that a resolving name server must issue another DNS request to find out the IP address of the server to which it has been referred. Since this can introduce a circular dependency if the nameserver referred to is under the domain that it is authoritative of, it is occasionally necessary for the nameserver providing the delegation to also provide the IP address of the next nameserver. This record is called a glue record.
For example, assume that the sub-domain en.wikipedia.org contains further sub-domains (such as something.en.wikipedia.org) and that the authoritative nameserver for these lives at ns1.en.wikipedia.org. A computer trying to resolve something.en.wikipedia.org will thus first have to resolve ns1.en.wikipedia.org. Since ns1 is also under the en.wikipedia.org subdomain, resolving ns1.en.wikipedia.org requires resolving ns1.en.wikipedia.org which is exactly the circular dependency mentioned above. The dependency is broken by the glue record in the nameserver of wikipedia.org that provides the IP address of ns1.en.wikipedia.org directly to the requestor, enabling it to bootstrap the process by figuring out where ns1.en.wikipedia.org is located.
[edit]
DNS in practice
When an application (such as a web browser) tries to find the IP address of a domain name, it doesn't necessarily follow all of the steps outlined in the Theory section above. We will first look at the concept of caching, and then outline the operation of DNS in "the real world."
[edit]
Caching and time to live
Because of the huge volume of requests generated by a system like the DNS, the designers wished to provide a mechanism to reduce the load on individual DNS servers. To this end, the DNS resolution process allows for caching (ie. the local recording and subsequent consultation of the results of a DNS query) for a given period of time after a successful answer. How long a resolver caches a DNS response (ie. how long a DNS response remains valid) is determined by a value called the time to live (TTL). The TTL is set by the administrator of the DNS server handing out the response. The period of validity may vary from just seconds to days or even weeks.
[edit]
Example
After having found a list of addresses of servers capable of answering queries about (eg.) the .example TLD, the local resolver will not make a query for .example again until the validity of the currently known list expires. The same applies for all subdomains. Once a response goes into cache, the resolver will consult its cached (stored) answer; only when the TTL expires (or when an administrator manually flushes the response from the resolver's memory) will the resolver contact the DNS server for the same information. Hence having successfully resolved an address of ahost.inadomain.example, it is not necessary to repeat the process for some time, since the IP address now known will be deemed reliable for the period set by the TTL, and resolution of anotherhost.anotherdomain.example can commence with already knowing which servers can answer queries for the .example domain. Caching significantly reduces the rate at which the most critical name servers have to respond to queries, adding the extra benefit that subsequent resolutions are not delayed by network transit times for the queries and responses.
The benefits of caching are amplified when using busy (but not congested) DNS servers: If a DNS server is frequently queried for many addresses, there is an increased probability that a DNS response to at least part of a DNS query will already exist in that server's cache and will not yet have exceeded its time to live. Most domestic and small-business clients "hand off" address resolution to their ISP's DNS servers to perform the look-up process, thus allowing for the greatest benefit from those same ISPs having busy local caches serving a wide variety of queries and a large number of users.
Generally, the Start of Authority (SOA) record specifies the time to live. The SOA record has the parameters:
Serial — the zone serial number, incremented when the zone file is modified, so the slave and secondary name servers know when the zone has been changed and should be reloaded.
Refresh — the number of seconds between update requests from secondary and slave name servers.
Retry — the number of seconds the secondary or slave will wait before retrying when the last attempt has failed.
Expire — the number of seconds a master or slave will wait before considering the data stale if it cannot reach the primary name server.
Minimum — previously used to determine the minimum TTL, this offers negative caching.
(Newer versions of BIND (named) will accept the suffixes 'M','H','D' or 'W', indicating a time-interval of minutes, hours, days and weeks respectively.)
[edit]
Caching time
As a noteworthy consequence of this distributed and caching architecture, changes to the DNS do not always take effect immediately and globally. This is best explained with an example: If an administrator has set a TTL of 6 hours for the host www.wikipedia.org, and then changes the IP address to which www.wikipedia.org resolves at 12:01pm, the administrator must consider that a person who cached a response with the old IP address at 12:00pm will not consult the DNS server again until 6:00pm. The period between 12:01pm and 6:00pm in this example is called caching time, which is best defined as a period of time that begins when you make a change to a DNS record and ends after the maximum amount of time specified by the TTL expires. This essentially leads to an important logistical consideration when making changes to the DNS: not everyone is necessarily seeing the same thing you're seeing. RFC 1537 helps to convey basic rules for how to set the TTL.
Note that the term "propagation", although very widely used in this context, does not describe the effects of caching well. Specifically, it implies that [1] when you make a DNS change, it somehow spreads to all other DNS servers (instead, other DNS servers check in with yours as needed), and [2] that you do not have control over the amount of time the record is cached (you control the TTL values for all DNS records in your domain, except your NS records and any authoritative DNS servers that use your domain name).
Some resolvers may override TTL values, as the protocol supports caching for up to 68 years or no caching at all. Negative caching (the non-existence of records) is determined by name servers authoritative for a zone which MUST include the SOA record when reporting no data of the requested type exists. The MINIMUM field of the SOA record and the TTL of the SOA itself is used to establish the TTL for the negative answer. RFC 2308
Many people incorrectly refer to a mysterious 48 hour or 72 hour propagation time when you make a DNS change. When one changes the NS records for one's domain or the IP addresses for hostnames of authoritative DNS servers using one's domain (if any), there can be a lengthy period of time before all DNS servers use the new information. This is because those records are handled by the zone parent DNS servers (for example, the .com DNS servers if your domain is example.com), which typically cache those records for 48 hours. However, those DNS changes will be immediately available for any DNS servers that do not have them cached. And, any DNS changes on your domain other than the NS records and authoritative DNS server names can be nearly instantaneous, if you choose for them to be (by lowering the TTL once or twice ahead of time, and waiting until the old TTL expires before making the change).
[edit]
DNS in the real world
DNS resolving from program to OS-resolver to ISP-resolver to greater system.
Users generally do not communicate directly with a DNS resolver. Instead DNS resolution takes place transparently in client applications such as web browsers, mail clients, and other Internet applications. When a request is made which necessitates a DNS lookup, such programs send a resolution request to the local DNS resolver in the operating system which in turn handles the communications required.
The DNS resolver will almost invariably have a cache (see above) containing recent lookups. If the cache can provide the answer to the request, the resolver will return the value in the cache to the program that made the request. If the cache does not contain the answer, the resolver will send the request to a designated DNS server or servers. In the case of most home users, the Internet service provider to which the machine connects will usually supply this DNS server: such a user will either have configured that server's address manually or allowed DHCP to set it; however, where systems administrators have configured systems to use their own DNS servers, their DNS resolvers point to separately maintained nameservers of the organization. In any event, the name server thus queried will follow the process outlined above, until it either successfully finds a result or does not. It then returns its results to the DNS resolver; assuming it has found a result, the resolver duly caches that result for future use, and hands the result back to the software which initiated the request.
[edit]
Broken resolvers
An additional level of complexity emerges when resolvers violate the rules of the DNS protocol. Some people have suggested[citation needed] that a number of large ISPs have configured their DNS servers to violate rules (presumably to allow them to run on less-expensive hardware than a fully compliant resolver), such as by disobeying TTLs, or by indicating that a domain name does not exist just because one of its name servers does not respond.
As a final level of complexity, some applications such as Web browsers also have their own DNS cache, in order to reduce the use of the DNS resolver library itself. This practice can add extra difficulty to DNS debugging, as it obscures which data is fresh, or lies in which cache. These caches typically have very short caching times of the order of one minute. A notable exception is Internet Explorer; recent versions cache DNS records for half an hour.[2]
[edit]
Other DNS applications
The system outlined above provides a somewhat simplified scenario. The DNS includes several other functions:
Hostnames and IP addresses do not necessarily match on a one-to-one basis. Many hostnames may correspond to a single IP address: combined with virtual hosting, this allows a single machine to serve many web sites. Alternatively a single hostname may correspond to many IP addresses: this can facilitate fault tolerance and load distribution, and also allows a site to move physical location seamlessly.
There are many uses of DNS besides translating names to IP addresses. For instance, Mail transfer agents use DNS to find out where to deliver e-mail for a particular address. The domain to mail exchanger mapping provided by MX records accommodates another layer of fault tolerance and load distribution on top of the name to IP address mapping.
Sender Policy Framework and DomainKeys instead of creating own record types were designed to take advantage of another DNS record type, the TXT record.
To provide resilience in the event of computer failure, multiple DNS servers provide coverage of each domain. In particular, more than thirteen root servers exist worldwide. DNS programs or operating systems have the IP addresses of these servers built in.
The DNS uses TCP and UDP on port 53 to serve requests. Almost all DNS queries consist of a single UDP request from the client followed by a single UDP reply from the server. TCP typically comes into play only when the response data size exceeds 512 bytes, or for such tasks as zone transfer. Some operating systems such as HP-UX are known to have resolver implementations that use TCP for all queries, even when UDP would suffice.
[edit]
Extensions to DNS
EDNS is an extension of the DNS protocol which enhances the transport of DNS data in UDP packages, and adds support for expanding the space of request and response codes. It is described in RFC 2671.
[edit]
Implementations of DNS
For a commented list of DNS server-side implementations, see Comparison of DNS server software.
Uses
The most basic use of DNS is to translate hostnames to IP addresses. It is in very simple terms like a phone book. For example, if you want to know the internet address of en.wikipedia.org, DNS can be used to tell you it's 66.230.200.100. DNS also has other important uses.
Pre-eminently, the DNS makes it possible to assign Internet destinations to the human organization or concern they represent, independently of the physical routing hierarchy represented by the numerical IP address. Because of this, hyperlinks and Internet contact information can remain the same, whatever the current IP routing arrangements may be, and can take a human-readable form (such as "wikipedia.org") which is rather easier to remember than an IP address (such as 66.230.200.100). People take advantage of this when they recite meaningful URLs and e-mail addresses without caring how the machine will actually locate them.
The DNS also distributes the responsibility for assigning domain names and mapping them to IP networks by allowing an authoritative server for each domain to keep track of its own changes, avoiding the need for a central registrar to be continually consulted and updated.
[edit]
History of the DNS
The practice of using a name as a more human-legible abstraction of a machine's numerical address on the network predates even TCP/IP, and goes all the way to the ARPAnet era. Back then however, a different system was used, as DNS was only invented in 1983, shortly after TCP/IP was deployed. With the older system, each computer on the network retrieved a file called HOSTS.TXT from a computer at SRI (now SRI International). The HOSTS.TXT file mapped numerical addresses to names. A hosts file still exists on most modern operating systems, either by default or through configuration, and allows users to specify an IP address (eg. 192.0.34.166) to use for a hostname (eg. www.example.net) without checking the DNS. As of 2006, the hosts file serves primarily for troubleshooting DNS errors or for mapping local addresses to more organic names. Systems based on a hosts file have inherent limitations, because of the obvious requirement that every time a given computer's address changed, every computer that seeks to communicate with it would need an update to its hosts file.
The growth of networking called for a more scalable system: one that recorded a change in a host's address in one place only. Other hosts would learn about the change dynamically through a notification system, thus completing a globally accessible network of all hosts' names and their associated IP Addresses.
Paul Mockapetris invented the DNS in 1983 and wrote the first implementation. The original specifications appear in RFC 882 and 883. In 1987, the publication of RFC 1034 and RFC 1035 updated the DNS specification and made RFC 882 and RFC 883 obsolete. Several more-recent RFCs have proposed various extensions to the core DNS protocols.
In 1984, four Berkeley students — Douglas Terry, Mark Painter, David Riggle and Songnian Zhou — wrote the first UNIX implementation, which was maintained by Ralph Campbell thereafter. In 1985, Kevin Dunlap of DEC significantly re-wrote the DNS implementation and renamed it BIND (Berkeley Internet Name Domain, previously: Berkeley Internet Name Daemon). Mike Karels, Phil Almquist and Paul Vixie have maintained BIND since then. BIND was ported to the Windows NT platform in the early 1990s.
Due to its long history of security issues, several alternative nameserver/resolver programs have been written and distributed in recent years.
[edit]
How the DNS works in theory
Domain names, arranged in a tree, cut into zones, each served by a nameserver.
The domain name space consists of a tree of domain names. Each node or leaf in the tree has one or more resource records, which hold information associated with the domain name. The tree sub-divides into zones. A zone consists of a collection of connected nodes authoritatively served by an authoritative DNS nameserver. (Note that a single nameserver can host several zones.)
When a system administrator wants to let another administrator control a part of the domain name space within his or her zone of authority, he or she can delegate control to the other administrator. This splits a part of the old zone off into a new zone, which comes under the authority of the second administrator's nameservers. The old zone becomes no longer authoritative for what comes under the authority of the new zone.
A resolver looks up the information associated with nodes. A resolver knows how to communicate with name servers by sending DNS requests, and heeding DNS responses. Resolving usually entails iterating through several name servers to find the needed information.
Some resolvers function simplistically and can only communicate with a single name server. These simple resolvers rely on a recursing name server to perform the work of finding information for them.
[edit]
Understanding the parts of a domain name
A domain name usually consists of two or more parts (technically labels), separated by dots. For example wikipedia.org.
The rightmost label conveys the top-level domain (for example, the address en.wikipedia.org has the top-level domain org).
Each label to the left specifies a subdivision or subdomain of the domain above it. Note that "subdomain" expresses relative dependence, not absolute dependence: for example, wikipedia.org comprises a subdomain of the org domain, and en.wikipedia.org comprises a subdomain of the domain wikipedia.org. In theory, this subdivision can go down to 127 levels deep, and each label can contain up to 63 characters,[1] as long as the whole domain name does not exceed a total length of 255 characters. But in practice some domain registries have shorter limits than that.
A hostname refers to a domain name that has one or more associated IP addresses. For example, the en.wikipedia.org and wikipedia.org domains are both hostnames, but the org domain is not.
The DNS consists of a hierarchical set of DNS servers. Each domain or subdomain has one or more authoritative DNS servers that publish information about that domain and the name servers of any domains "beneath" it. The hierarchy of authoritative DNS servers matches the hierarchy of domains. At the top of the hierarchy stand the root nameservers: the servers to query when looking up (resolving) a top-level domain name (TLD).
[edit]
The address resolution mechanism
(This description deliberately uses the fictional .example TLD in accordance with the DNS guidelines themselves.)
In theory a full host name may have several name segments, (e.g ahost.ofasubnet.ofabiggernet.inadomain.example). In practice, in the experience of the majority of public users of Internet services, full host names will frequently consist of just three segments (ahost.inadomain.example, and most often www.inadomain.example).
For querying purposes, software interprets the name segment by segment, from right to left, using an iterative search procedure. At each step along the way, the program queries a corresponding DNS server to provide a pointer to the next server which it should consult.
A DNS recurser consults three nameservers to resolve the address www.wikipedia.org.
As originally envisaged, the process was as simple as:
the local system is pre-configured with the known addresses of the root servers in a file of root hints, which need to be updated periodically by the local administrator from a reliable source to be kept up to date with the changes which occur over time.
query one of the root servers to find the server authoritative for the next level down (so in the case of our simple hostname, a root server would be asked for the address of a server with detailed knowledge of the example top level domain).
querying this second server for the address of a DNS server with detailed knowledge of the second-level domain (inadomain.example in our example).
repeating the previous step to progress down the name, until the final step which would, rather than generating the address of the next DNS server, return the final address sought.
The diagram illustrates this process for the real host www.wikipedia.org.
The mechanism in this simple form has a difficulty: it places a huge operating burden on the root servers, with each and every search for an address starting by querying one of them. Being as critical as they are to the overall function of the system such heavy use would create an insurmountable bottleneck for trillions of queries placed every day. The section DNS in practice describes how this is addressed.
[edit]
Circular dependencies and glue records
Name servers in delegations appear listed by name, rather than by IP address. This means that a resolving name server must issue another DNS request to find out the IP address of the server to which it has been referred. Since this can introduce a circular dependency if the nameserver referred to is under the domain that it is authoritative of, it is occasionally necessary for the nameserver providing the delegation to also provide the IP address of the next nameserver. This record is called a glue record.
For example, assume that the sub-domain en.wikipedia.org contains further sub-domains (such as something.en.wikipedia.org) and that the authoritative nameserver for these lives at ns1.en.wikipedia.org. A computer trying to resolve something.en.wikipedia.org will thus first have to resolve ns1.en.wikipedia.org. Since ns1 is also under the en.wikipedia.org subdomain, resolving ns1.en.wikipedia.org requires resolving ns1.en.wikipedia.org which is exactly the circular dependency mentioned above. The dependency is broken by the glue record in the nameserver of wikipedia.org that provides the IP address of ns1.en.wikipedia.org directly to the requestor, enabling it to bootstrap the process by figuring out where ns1.en.wikipedia.org is located.
[edit]
DNS in practice
When an application (such as a web browser) tries to find the IP address of a domain name, it doesn't necessarily follow all of the steps outlined in the Theory section above. We will first look at the concept of caching, and then outline the operation of DNS in "the real world."
[edit]
Caching and time to live
Because of the huge volume of requests generated by a system like the DNS, the designers wished to provide a mechanism to reduce the load on individual DNS servers. To this end, the DNS resolution process allows for caching (ie. the local recording and subsequent consultation of the results of a DNS query) for a given period of time after a successful answer. How long a resolver caches a DNS response (ie. how long a DNS response remains valid) is determined by a value called the time to live (TTL). The TTL is set by the administrator of the DNS server handing out the response. The period of validity may vary from just seconds to days or even weeks.
[edit]
Example
After having found a list of addresses of servers capable of answering queries about (eg.) the .example TLD, the local resolver will not make a query for .example again until the validity of the currently known list expires. The same applies for all subdomains. Once a response goes into cache, the resolver will consult its cached (stored) answer; only when the TTL expires (or when an administrator manually flushes the response from the resolver's memory) will the resolver contact the DNS server for the same information. Hence having successfully resolved an address of ahost.inadomain.example, it is not necessary to repeat the process for some time, since the IP address now known will be deemed reliable for the period set by the TTL, and resolution of anotherhost.anotherdomain.example can commence with already knowing which servers can answer queries for the .example domain. Caching significantly reduces the rate at which the most critical name servers have to respond to queries, adding the extra benefit that subsequent resolutions are not delayed by network transit times for the queries and responses.
The benefits of caching are amplified when using busy (but not congested) DNS servers: If a DNS server is frequently queried for many addresses, there is an increased probability that a DNS response to at least part of a DNS query will already exist in that server's cache and will not yet have exceeded its time to live. Most domestic and small-business clients "hand off" address resolution to their ISP's DNS servers to perform the look-up process, thus allowing for the greatest benefit from those same ISPs having busy local caches serving a wide variety of queries and a large number of users.
Generally, the Start of Authority (SOA) record specifies the time to live. The SOA record has the parameters:
Serial — the zone serial number, incremented when the zone file is modified, so the slave and secondary name servers know when the zone has been changed and should be reloaded.
Refresh — the number of seconds between update requests from secondary and slave name servers.
Retry — the number of seconds the secondary or slave will wait before retrying when the last attempt has failed.
Expire — the number of seconds a master or slave will wait before considering the data stale if it cannot reach the primary name server.
Minimum — previously used to determine the minimum TTL, this offers negative caching.
(Newer versions of BIND (named) will accept the suffixes 'M','H','D' or 'W', indicating a time-interval of minutes, hours, days and weeks respectively.)
[edit]
Caching time
As a noteworthy consequence of this distributed and caching architecture, changes to the DNS do not always take effect immediately and globally. This is best explained with an example: If an administrator has set a TTL of 6 hours for the host www.wikipedia.org, and then changes the IP address to which www.wikipedia.org resolves at 12:01pm, the administrator must consider that a person who cached a response with the old IP address at 12:00pm will not consult the DNS server again until 6:00pm. The period between 12:01pm and 6:00pm in this example is called caching time, which is best defined as a period of time that begins when you make a change to a DNS record and ends after the maximum amount of time specified by the TTL expires. This essentially leads to an important logistical consideration when making changes to the DNS: not everyone is necessarily seeing the same thing you're seeing. RFC 1537 helps to convey basic rules for how to set the TTL.
Note that the term "propagation", although very widely used in this context, does not describe the effects of caching well. Specifically, it implies that [1] when you make a DNS change, it somehow spreads to all other DNS servers (instead, other DNS servers check in with yours as needed), and [2] that you do not have control over the amount of time the record is cached (you control the TTL values for all DNS records in your domain, except your NS records and any authoritative DNS servers that use your domain name).
Some resolvers may override TTL values, as the protocol supports caching for up to 68 years or no caching at all. Negative caching (the non-existence of records) is determined by name servers authoritative for a zone which MUST include the SOA record when reporting no data of the requested type exists. The MINIMUM field of the SOA record and the TTL of the SOA itself is used to establish the TTL for the negative answer. RFC 2308
Many people incorrectly refer to a mysterious 48 hour or 72 hour propagation time when you make a DNS change. When one changes the NS records for one's domain or the IP addresses for hostnames of authoritative DNS servers using one's domain (if any), there can be a lengthy period of time before all DNS servers use the new information. This is because those records are handled by the zone parent DNS servers (for example, the .com DNS servers if your domain is example.com), which typically cache those records for 48 hours. However, those DNS changes will be immediately available for any DNS servers that do not have them cached. And, any DNS changes on your domain other than the NS records and authoritative DNS server names can be nearly instantaneous, if you choose for them to be (by lowering the TTL once or twice ahead of time, and waiting until the old TTL expires before making the change).
[edit]
DNS in the real world
DNS resolving from program to OS-resolver to ISP-resolver to greater system.
Users generally do not communicate directly with a DNS resolver. Instead DNS resolution takes place transparently in client applications such as web browsers, mail clients, and other Internet applications. When a request is made which necessitates a DNS lookup, such programs send a resolution request to the local DNS resolver in the operating system which in turn handles the communications required.
The DNS resolver will almost invariably have a cache (see above) containing recent lookups. If the cache can provide the answer to the request, the resolver will return the value in the cache to the program that made the request. If the cache does not contain the answer, the resolver will send the request to a designated DNS server or servers. In the case of most home users, the Internet service provider to which the machine connects will usually supply this DNS server: such a user will either have configured that server's address manually or allowed DHCP to set it; however, where systems administrators have configured systems to use their own DNS servers, their DNS resolvers point to separately maintained nameservers of the organization. In any event, the name server thus queried will follow the process outlined above, until it either successfully finds a result or does not. It then returns its results to the DNS resolver; assuming it has found a result, the resolver duly caches that result for future use, and hands the result back to the software which initiated the request.
[edit]
Broken resolvers
An additional level of complexity emerges when resolvers violate the rules of the DNS protocol. Some people have suggested[citation needed] that a number of large ISPs have configured their DNS servers to violate rules (presumably to allow them to run on less-expensive hardware than a fully compliant resolver), such as by disobeying TTLs, or by indicating that a domain name does not exist just because one of its name servers does not respond.
As a final level of complexity, some applications such as Web browsers also have their own DNS cache, in order to reduce the use of the DNS resolver library itself. This practice can add extra difficulty to DNS debugging, as it obscures which data is fresh, or lies in which cache. These caches typically have very short caching times of the order of one minute. A notable exception is Internet Explorer; recent versions cache DNS records for half an hour.[2]
[edit]
Other DNS applications
The system outlined above provides a somewhat simplified scenario. The DNS includes several other functions:
Hostnames and IP addresses do not necessarily match on a one-to-one basis. Many hostnames may correspond to a single IP address: combined with virtual hosting, this allows a single machine to serve many web sites. Alternatively a single hostname may correspond to many IP addresses: this can facilitate fault tolerance and load distribution, and also allows a site to move physical location seamlessly.
There are many uses of DNS besides translating names to IP addresses. For instance, Mail transfer agents use DNS to find out where to deliver e-mail for a particular address. The domain to mail exchanger mapping provided by MX records accommodates another layer of fault tolerance and load distribution on top of the name to IP address mapping.
Sender Policy Framework and DomainKeys instead of creating own record types were designed to take advantage of another DNS record type, the TXT record.
To provide resilience in the event of computer failure, multiple DNS servers provide coverage of each domain. In particular, more than thirteen root servers exist worldwide. DNS programs or operating systems have the IP addresses of these servers built in.
The DNS uses TCP and UDP on port 53 to serve requests. Almost all DNS queries consist of a single UDP request from the client followed by a single UDP reply from the server. TCP typically comes into play only when the response data size exceeds 512 bytes, or for such tasks as zone transfer. Some operating systems such as HP-UX are known to have resolver implementations that use TCP for all queries, even when UDP would suffice.
[edit]
Extensions to DNS
EDNS is an extension of the DNS protocol which enhances the transport of DNS data in UDP packages, and adds support for expanding the space of request and response codes. It is described in RFC 2671.
[edit]
Implementations of DNS
For a commented list of DNS server-side implementations, see Comparison of DNS server software.
Subscribe to:
Posts (Atom)