commit 9a7ac15017b1e2d139ad1ebbb984cd2ef89fbfb2
parent 35e09a23434298f901ca37354f7f514b3d1ceaf4
Author: Daniel Barlow <dan@telent.net>
Date: Sun, 28 Dec 2025 17:58:30 +0000
update outstanding work
Diffstat:
1 file changed, 16 insertions(+), 1 deletion(-)
diff --git a/notes.md b/notes.md
@@ -164,7 +164,10 @@ we already know it's unique
"Probe" means send packets as QU (unicast response) containing ANY requests for each name: 3 packets with 250ms between them
"Announce" means send 2 <= n <= 8 packets one second apart, containing
-all the records we
+all the records we know
+
+[ Status: We announce but only once and we don't bother probing ]
+
** send additional data in responses
@@ -178,6 +181,18 @@ expected additional records:
an instance of the service, the SRV and TXT records for the instance
and all the A/AAAA named by the SRV
+status: done except that (c) probably the code is sucky;
+(d) haven't investigated what happens if the packet gets too large
+
+** don't answer queries if the answers in the query already include what we'd send
+
+** set the CACHE_FLUSH thing when needed
+
+** do we need to do NSEC?
+
+mdns is so fricking noisy already I don't know if this is worth the extra effort
+
+** compress responses
* start a udp server, and stream the tables to anyone who sends a message to it