You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Is your feature request related to a problem? Please describe.
Currently OpenSearch supports exponential backoff with optional max-retries as retry mechanism. This is not very useful because the sleep time between the retries becomes exceedingly high some retries. Here is the wait times (in milliseconds) before each retry
At iteration 21, with a value of 88,861,140 is more than one day of wait time. And iteration 25 would result in integer overflow of the wait time.
Describe the solution you'd like
Provide a more reasonable wait scheme before retries. It would be a hybrid model of exponential back off and constant backoff. First exponential backoff followed by constant backoff. It would have four parameters.
Initial delay ( Enforce min and max values)
Max wait time with exponential backoff (Enforce maximum to be less than one hour or even less like 15 minutes)
Value of constant wait time for constant backoff (For example, 15 minutes)
Max wait time with constant backoff
First retry is done after initial delay
Next "n" number of retries are done until max exponential backoff wait time
Next "m" number of retries are done at constant pace of configured interval for max constant backoff wait time
Describe alternatives you've considered (Optional)
A clear and concise description of any alternative solutions or features you've considered.
Additional context
Add any other context or screenshots about the feature request here.
The text was updated successfully, but these errors were encountered:
Could we simplify the configurations to just an initial delay and a maximum backoff time?
We can keep the exponential backoff approach - I'm not sure pipeline authors need to configure this.
Also, we might be able to get a partial fix in for 2.2.1 if we just limit the backoff time. We can't add new parameters to a patch release, so we could set a reasonable value (say 15 minutes).
Then in 2.3 we can add the parameters for users to tune as they see fit.
Is your feature request related to a problem? Please describe.
Currently OpenSearch supports exponential backoff with optional max-retries as retry mechanism. This is not very useful because the sleep time between the retries becomes exceedingly high some retries. Here is the wait times (in milliseconds) before each retry
At iteration 21, with a value of 88,861,140 is more than one day of wait time. And iteration 25 would result in integer overflow of the wait time.
Describe the solution you'd like
Provide a more reasonable wait scheme before retries. It would be a hybrid model of exponential back off and constant backoff. First exponential backoff followed by constant backoff. It would have four parameters.
First retry is done after initial delay
Next "n" number of retries are done until max exponential backoff wait time
Next "m" number of retries are done at constant pace of configured interval for max constant backoff wait time
Describe alternatives you've considered (Optional)
A clear and concise description of any alternative solutions or features you've considered.
Additional context
Add any other context or screenshots about the feature request here.
The text was updated successfully, but these errors were encountered: