forked from mennanov/limiters
-
Notifications
You must be signed in to change notification settings - Fork 0
/
slidingwindow.go
271 lines (241 loc) · 8.63 KB
/
slidingwindow.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
package limiters
import (
"context"
"fmt"
"strconv"
"sync"
"time"
"github.com/aws/aws-sdk-go-v2/aws"
"github.com/aws/aws-sdk-go-v2/feature/dynamodb/attributevalue"
"github.com/aws/aws-sdk-go-v2/service/dynamodb"
"github.com/aws/aws-sdk-go-v2/service/dynamodb/types"
"github.com/go-redis/redis"
"github.com/pkg/errors"
)
// SlidingWindowIncrementer wraps the Increment method.
type SlidingWindowIncrementer interface {
// Increment increments the request counter for the current window and returns the counter values for the previous
// window and the current one.
// TTL is the time duration before the next window.
Increment(ctx context.Context, prev, curr time.Time, ttl time.Duration) (prevCount, currCount int64, err error)
}
// SlidingWindow implements a Sliding Window rate limiting algorithm.
//
// It does not require a distributed lock and uses a minimum amount of memory, however it will disallow all the requests
// in case when a client is flooding the service with requests.
// It's the client's responsibility to handle the disallowed request and wait before making a new request again.
type SlidingWindow struct {
backend SlidingWindowIncrementer
clock Clock
rate time.Duration
capacity int64
epsilon float64
}
// NewSlidingWindow creates a new instance of SlidingWindow.
// Capacity is the maximum amount of requests allowed per window.
// Rate is the window size.
// Epsilon is the max-allowed range of difference when comparing the current weighted number of requests with capacity.
func NewSlidingWindow(capacity int64, rate time.Duration, slidingWindowIncrementer SlidingWindowIncrementer, clock Clock, epsilon float64) *SlidingWindow {
return &SlidingWindow{backend: slidingWindowIncrementer, clock: clock, rate: rate, capacity: capacity, epsilon: epsilon}
}
// Limit returns the time duration to wait before the request can be processed.
// It returns ErrLimitExhausted if the request overflows the capacity.
func (s *SlidingWindow) Limit(ctx context.Context) (time.Duration, error) {
now := s.clock.Now()
currWindow := now.Truncate(s.rate)
prevWindow := currWindow.Add(-s.rate)
ttl := s.rate - now.Sub(currWindow)
prev, curr, err := s.backend.Increment(ctx, prevWindow, currWindow, ttl+s.rate)
if err != nil {
return 0, err
}
total := float64(prev*int64(ttl))/float64(s.rate) + float64(curr)
if total-float64(s.capacity) >= s.epsilon {
var wait time.Duration
if curr <= s.capacity-1 && prev > 0 {
wait = ttl - time.Duration(float64(s.capacity-1-curr)/float64(prev)*float64(s.rate))
} else {
// If prev == 0.
wait = ttl + time.Duration((1-float64(s.capacity-1)/float64(curr))*float64(s.rate))
}
return wait, ErrLimitExhausted
}
return 0, nil
}
// SlidingWindowInMemory is an in-memory implementation of SlidingWindowIncrementer.
type SlidingWindowInMemory struct {
mu sync.Mutex
prevC, currC int64
prevW, currW time.Time
}
// NewSlidingWindowInMemory creates a new instance of SlidingWindowInMemory.
func NewSlidingWindowInMemory() *SlidingWindowInMemory {
return &SlidingWindowInMemory{}
}
// Increment increments the current window's counter and returns the number of requests in the previous window and the
// current one.
func (s *SlidingWindowInMemory) Increment(ctx context.Context, prev, curr time.Time, _ time.Duration) (int64, int64, error) {
s.mu.Lock()
defer s.mu.Unlock()
if curr != s.currW {
if prev == s.currW {
s.prevW = s.currW
s.prevC = s.currC
} else {
s.prevW = time.Time{}
s.prevC = 0
}
s.currW = curr
s.currC = 0
}
s.currC++
return s.prevC, s.currC, ctx.Err()
}
// SlidingWindowRedis implements SlidingWindow in Redis.
type SlidingWindowRedis struct {
cli *redis.Client
prefix string
}
// NewSlidingWindowRedis creates a new instance of SlidingWindowRedis.
func NewSlidingWindowRedis(cli *redis.Client, prefix string) *SlidingWindowRedis {
return &SlidingWindowRedis{cli: cli, prefix: prefix}
}
// Increment increments the current window's counter in Redis and returns the number of requests in the previous window
// and the current one.
func (s *SlidingWindowRedis) Increment(ctx context.Context, prev, curr time.Time, ttl time.Duration) (int64, int64, error) {
var incr *redis.IntCmd
var prevCountCmd *redis.StringCmd
var err error
done := make(chan struct{})
go func() {
defer close(done)
_, err = s.cli.Pipelined(func(pipeliner redis.Pipeliner) error {
currKey := fmt.Sprintf("%d", curr.UnixNano())
incr = pipeliner.Incr(redisKey(s.prefix, currKey))
pipeliner.PExpire(redisKey(s.prefix, currKey), ttl)
prevCountCmd = pipeliner.Get(redisKey(s.prefix, fmt.Sprintf("%d", prev.UnixNano())))
return nil
})
}()
var prevCount int64
select {
case <-done:
if err == redis.TxFailedErr {
return 0, 0, errors.Wrap(err, "redis transaction failed")
} else if err != nil && err.Error() == "redis: nil" { // TODO: is there an exported error of that type?
prevCount = 0
} else if err != nil {
return 0, 0, errors.Wrap(err, "unexpected error from redis")
} else {
prevCount, err = strconv.ParseInt(prevCountCmd.Val(), 10, 64)
if err != nil {
return 0, 0, errors.Wrap(err, "failed to parse response from redis")
}
}
return prevCount, incr.Val(), nil
case <-ctx.Done():
return 0, 0, ctx.Err()
}
}
// SlidingWindowDynamoDB implements SlidingWindow in DynamoDB.
type SlidingWindowDynamoDB struct {
client *dynamodb.Client
partitionKey string
tableProps DynamoDBTableProperties
}
// NewSlidingWindowDynamoDB creates a new instance of SlidingWindowDynamoDB.
// PartitionKey is the key used to store all the this implementation in DynamoDB.
//
// TableProps describe the table that this backend should work with. This backend requires the following on the table:
// * SortKey
// * TTL
func NewSlidingWindowDynamoDB(client *dynamodb.Client, partitionKey string, props DynamoDBTableProperties) *SlidingWindowDynamoDB {
return &SlidingWindowDynamoDB{
client: client,
partitionKey: partitionKey,
tableProps: props,
}
}
// Increment increments the current window's counter in DynamoDB and returns the number of requests in the previous window
// and the current one.
func (s *SlidingWindowDynamoDB) Increment(ctx context.Context, prev, curr time.Time, ttl time.Duration) (int64, int64, error) {
wg := &sync.WaitGroup{}
wg.Add(2)
done := make(chan struct{})
go func() {
defer close(done)
wg.Wait()
}()
var currentCount int64
var currentErr error
go func() {
defer wg.Done()
resp, err := s.client.UpdateItem(ctx, &dynamodb.UpdateItemInput{
Key: map[string]types.AttributeValue{
s.tableProps.PartitionKeyName: &types.AttributeValueMemberS{Value: s.partitionKey},
s.tableProps.SortKeyName: &types.AttributeValueMemberS{Value: strconv.FormatInt(curr.UnixNano(), 10)},
},
UpdateExpression: aws.String(fixedWindowDynamoDBUpdateExpression),
ExpressionAttributeNames: map[string]string{
"#TTL": s.tableProps.TTLFieldName,
"#C": dynamodbWindowCountKey,
},
ExpressionAttributeValues: map[string]types.AttributeValue{
":ttl": &types.AttributeValueMemberN{Value: strconv.FormatInt(time.Now().Add(ttl).Unix(), 10)},
":def": &types.AttributeValueMemberN{Value: "0"},
":inc": &types.AttributeValueMemberN{Value: "1"},
},
TableName: &s.tableProps.TableName,
ReturnValues: types.ReturnValueAllNew,
})
if err != nil {
currentErr = err
return
}
var tmp float64
currentErr = attributevalue.Unmarshal(resp.Attributes[dynamodbWindowCountKey], &tmp)
if err != nil {
return
}
currentCount = int64(tmp)
}()
var priorCount int64
var priorErr error
go func() {
defer wg.Done()
resp, err := s.client.GetItem(ctx, &dynamodb.GetItemInput{
TableName: aws.String(s.tableProps.TableName),
Key: map[string]types.AttributeValue{
s.tableProps.PartitionKeyName: &types.AttributeValueMemberS{Value: s.partitionKey},
s.tableProps.SortKeyName: &types.AttributeValueMemberS{Value: strconv.FormatInt(prev.UnixNano(), 10)},
},
ConsistentRead: aws.Bool(true),
})
if err != nil {
priorCount, priorErr = 0, errors.Wrap(err, "dynamodb get item failed")
return
}
if len(resp.Item) == 0 {
priorCount = 0
return
}
var count float64
err = attributevalue.Unmarshal(resp.Item[dynamodbWindowCountKey], &count)
if err != nil {
priorCount, priorErr = 0, errors.Wrap(err, "unmarshal of dynamodb attribute value failed")
return
}
priorCount = int64(count)
}()
select {
case <-done:
case <-ctx.Done():
return 0, 0, ctx.Err()
}
if currentErr != nil {
return 0, 0, errors.Wrap(currentErr, "failed to update current count")
} else if priorErr != nil {
return 0, 0, errors.Wrap(priorErr, "failed to get previous count")
}
return priorCount, currentCount, nil
}