summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAndrew Boardman <amb@mit.edu>2006-08-26 10:27:51 +0000
committerAndrew Boardman <amb@mit.edu>2006-08-26 10:27:51 +0000
commitc1fe4c92a7d6ffc9479d4776e0c49d796fa77f17 (patch)
treed4aa5d2d1dda4792cb4e5636166cdacc08e5d7d3
parentbd7f816fe3da7b3efcda330ef45f7bac1944771c (diff)
downloadkrb5-amb/referrals.tar.gz
Misc commentaryamb/referrals
git-svn-id: svn://anonsvn.mit.edu/krb5/users/amb/referrals@18547 dc483132-0cff-0310-8789-dd5450dbe970
-rw-r--r--implementation.notes6
1 files changed, 6 insertions, 0 deletions
diff --git a/implementation.notes b/implementation.notes
index 7cdf9adea..22a7912c3 100644
--- a/implementation.notes
+++ b/implementation.notes
@@ -222,3 +222,9 @@ B if asked, and that the client fallback to the standard
non-referral-based traversal is the only functional path here.
But is that really the right thing?
+
+misc questions answered:
+=======================
+- should do_traversal code for old-style lookups still be requesting referrals?
+ If so, within what scope should they actually be used?
+ - probably not. the old traversal code is network-intensive and resilient enough as is.