From owner-freebsd-hackers Thu Jun 29 19:08:13 1995 Return-Path: hackers-owner Received: (from majordom@localhost) by freefall.cdrom.com (8.6.10/8.6.6) id TAA15320 for hackers-outgoing; Thu, 29 Jun 1995 19:08:13 -0700 Received: from misery.sdf.com (misery.sdf.com [204.191.196.34]) by freefall.cdrom.com (8.6.10/8.6.6) with ESMTP id TAA15297 for ; Thu, 29 Jun 1995 19:07:55 -0700 Received: (from tom@localhost) by misery.sdf.com (8.7.Beta.7/8.7.Beta.7) id TAA15209; Thu, 29 Jun 1995 19:13:14 -0700 (PDT) Date: Thu, 29 Jun 1995 19:13:06 -0700 (PDT) From: Tom Samplonius To: Ollivier Robert cc: Network Coordinator , hackers@freebsd.org Subject: Re: Load Balancing/Sharing w/ FreeBSD In-Reply-To: <199506292224.AAA06032@blaise.ibp.fr> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: hackers-owner@freebsd.org Precedence: bulk On Fri, 30 Jun 1995, Ollivier Robert wrote: > > DNS servers will just sequentially cycle through a list of servers, it > > won't intelligently find the least busy machine. Is there a way to do it > > intelligently with DNS? > > Depends on how the resolver is written but generally the NS records are used > in "random" order but it will use the fastest one after a while. NS records? Don't you mean A records? I know that named will do round-robin ordering on any item with multiple records. Tom