10-05-2011
Presumably, you mean /etc/resolv.conf
If the first entry 127.0.0.1 does not have a running name server daemon, dig tries the next server in the list..
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
what is dig? Is it just a advanced type of nslookup?
how to use it?
//nicke:confused: (1 Reply)
Discussion started by: nicke30
1 Replies
2. UNIX for Dummies Questions & Answers
Hi all, I'm running BIND 9.1.3 and the accompanying `dig and nslookup' on a vanilla Redhat 7.2 Linux box.
I've produced all of my Zone data and config files (I used h2n with some manual tweaks to do this, as some >= v8.2 BIND features aren't properly supported as far as I can see).
Im my... (6 Replies)
Discussion started by: sam_pointer
6 Replies
3. Shell Programming and Scripting
First I would like to thank you for your time in running a great Forum!
Background - Windows/ASP/VB COM/SQL Server programmer/Webmaster.
Desire - To build similar skillset on UNIX. I am looking at learning Perl or Python (maybe Jython due to connection to Java). I have a brief background... (3 Replies)
Discussion started by: nimrod
3 Replies
4. UNIX for Dummies Questions & Answers
When I use the linux dig command such as #dig yahoo.com it resolves
but when I use the same command as root it gives me error "Segmentation Fault"
Please advise I am completly baffled. (1 Reply)
Discussion started by: Tirmazi
1 Replies
5. UNIX for Dummies Questions & Answers
all,
i am newbie to dns bind . Any help is very appreciated.
I am using dig command to view the records in the config. I am expecting the following comamnds to display all the A (Address records) in the zone data file.
my zone data file looks like this
-------------------
$ORIGIN .
$TTL... (2 Replies)
Discussion started by: sujathab
2 Replies
6. UNIX for Dummies Questions & Answers
Hi Guys,
I just need a confirmation if what think i know is right .
dig yahoo.com
; <<>> DiG 9.7.0-P1 <<>> yahoo.com
;; global options: +cmd
;; Got answer:
;; ->>HEADER<<- opcode: QUERY, status: NOERROR, id: 27410
;; flags: qr rd ra; QUERY: 1, ANSWER: 5, AUTHORITY: 0, ADDITIONAL: 0
... (1 Reply)
Discussion started by: mtomar
1 Replies
7. IP Networking
Can I use two different DNS servers in the one command in the form of primary and secondary.
Take this for example:
dig @<primaryAddress> @<secondaryAddress> MX domain.tld
So if primary address is down, it will use the secondary address as a backup. It seems to work when testing, but thought... (1 Reply)
Discussion started by: neil_is_ere
1 Replies
8. Shell Programming and Scripting
Hi everyone,
how can I get the highlighted text only?
I am only concerned with the first line of the "AUTHORITY SECTION" (in red).
thank you in advance (4 Replies)
Discussion started by: Abdulelah
4 Replies
9. Shell Programming and Scripting
Hi,
I am testing some code to match a grep to see if one of the dns server exists but it does not seem to match:
ERROR:
=======
CRITICAL: google.com DNS : ns3.google.com NOT found
CODE:
=====
if ; then
echo "OK: google.com DNS : ns3.google.com exists"
else
echo... (5 Replies)
Discussion started by: dmccabe
5 Replies
10. Shell Programming and Scripting
Experts - I was hoping someone could help me out with the logic on this perl script.
I'm trying to run some dig commands and parse in such a way as to group them together.
Here's what I have so far.
#!/usr/bin/perl
system(clear);
my @host = qw/yahoo.com
google.com
/;
foreach... (2 Replies)
Discussion started by: timj123
2 Replies
LEARN ABOUT DEBIAN
bup-margin
bup-margin(1) General Commands Manual bup-margin(1)
NAME
bup-margin - figure out your deduplication safety margin
SYNOPSIS
bup margin [options...]
DESCRIPTION
bup margin iterates through all objects in your bup repository, calculating the largest number of prefix bits shared between any two
entries. This number, n, identifies the longest subset of SHA-1 you could use and still encounter a collision between your object ids.
For example, one system that was tested had a collection of 11 million objects (70 GB), and bup margin returned 45. That means a 46-bit
hash would be sufficient to avoid all collisions among that set of objects; each object in that repository could be uniquely identified by
its first 46 bits.
The number of bits needed seems to increase by about 1 or 2 for every doubling of the number of objects. Since SHA-1 hashes have 160 bits,
that leaves 115 bits of margin. Of course, because SHA-1 hashes are essentially random, it's theoretically possible to use many more bits
with far fewer objects.
If you're paranoid about the possibility of SHA-1 collisions, you can monitor your repository by running bup margin occasionally to see if
you're getting dangerously close to 160 bits.
OPTIONS
--predict
Guess the offset into each index file where a particular object will appear, and report the maximum deviation of the correct answer
from the guess. This is potentially useful for tuning an interpolation search algorithm.
--ignore-midx
don't use .midx files, use only .idx files. This is only really useful when used with --predict.
EXAMPLE
$ bup margin
Reading indexes: 100.00% (1612581/1612581), done.
40
40 matching prefix bits
1.94 bits per doubling
120 bits (61.86 doublings) remaining
4.19338e+18 times larger is possible
Everyone on earth could have 625878182 data sets
like yours, all in one repository, and we would
expect 1 object collision.
$ bup margin --predict
PackIdxList: using 1 index.
Reading indexes: 100.00% (1612581/1612581), done.
915 of 1612581 (0.057%)
SEE ALSO
bup-midx(1), bup-save(1)
BUP
Part of the bup(1) suite.
AUTHORS
Avery Pennarun <apenwarr@gmail.com>.
Bup unknown- bup-margin(1)