File tree Expand file tree Collapse file tree
Expand file tree Collapse file tree Original file line number Diff line number Diff line change @@ -27,8 +27,8 @@ Here is an example of algorithm that implements the recommended retry strategy:
2727
28285 . Upon retryable failure, wait 8 + ` jitter ` seconds before retrying.
2929
30- 6 . And so on, with a delay of min(2^n + ` jitter ` , ` max_backoff ` ) seconds
31- at each iteration.
30+ 6 . And so on, with a delay of min(2< sup >n</ sup > + ` jitter ` , ` max_backoff ` )
31+ seconds at each iteration.
3232
33337 . After ` deadline ` seconds, stop retrying the request.
3434
@@ -37,7 +37,8 @@ it could be a fractional value between 0 and 1 second.
3737
3838The ` max_backoff ` value defines the maximum time to wait between retries. You
3939should pick the highest value your use case can support. If you have no specific
40- latency requirements, 2^6 (64) seconds should be reasonable in most situations.
40+ latency requirements, 2<sup >6</sup > (64) seconds should be reasonable in most
41+ situations.
4142
4243The ` deadline ` value defines how long to keep retrying automatically until you
4344cancel the request. You should pick a value appropriate to your use case. One
You can’t perform that action at this time.
0 commit comments