-
Notifications
You must be signed in to change notification settings - Fork 14
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Backoff strategy for discovery #32
Comments
Update: webmention is resolving this by adding something or replacing the User-Agent value (if present) but I think this is not possible or very complicated for JS implementations, so not a good recommendation for LDN |
I suppose that guidelines regarding such http-questions exist somewhere. |
Added a non-normative sub-section "Retry Discovery" under Considerations: da56c9a |
F2F resolution was to add note to SWP (or external Note) about not accidentally beating servers up with discovery. Unless @BigBlueHat finds an existing note about it first. |
Decision: Put a specific link in Discovery section linking to section in SWP. |
What does "courteous" mean? Also this fragment ID referenced in 2bf7c0b doesn't seem to exist https://www.w3.org/TR/social-web-protocols/#targeting-and-discovery |
Perhaps recommending something quantifiable like Exponential Backoff would be best. There are lots of libraries for most common programming languages that do that--even for HTTP APIs. |
Sorry about the broken SWP fragment, it's pre-empting a new WD: http://w3c-social.github.io/social-web-protocols/#targeting-and-discovery |
Similar to w3c/webmention#48, how many times should a Sender/Consumer that wants to do discovery several times on one resource, or multiple target resources on the same domain, try to find the inbox endpoint before it gives up? To avoid knocking over a server, or being blocked for too many GET requests?
The text was updated successfully, but these errors were encountered: