Kong is the most popular open-source API Platform. It just launched its 1.0 version with 20,000 stars, 38,000 community members and 100+ enterprise customers. Under the hood, Kong uses Redis for some of its key functions including rate limiting, HTTP caching, and others. In his talk, Guanlan will draw on years of practical experience, to share stories and knowledge about using Redis in API Platform design, which enables rate limiting and caching in a scalable and performant way. He will also cover the microservices architecture and how Redis fits into it.

1. PRESENTED BY
How Redis Powers Next-gen of API
Platform at millions RPS scale
Guanlan Dai
Kong Inc, Engineering Manager

2. Guanlan Dai
■ Leading the Kong Core, Cloud, and AI/ML teams
■ OpenResty Contributor
■ Previously Tech Lead @ Cloudflare
WHO AM I?

3. Kong - the Most Popular Open-source
Microservices API Platform
● Open-Source
● 45M+ Downloads since 2015
● 20,000+ Stars in GitHub
Millions of Community downloads
across multiple platforms.
● 140+ Contributors
● 110 Meetups
● 10K+ Community Members

4. Service Control Platform
Monolith Services
Microservices/
Service Mesh
Serverless/
FaaS
Emerging
Patterns

5. Rate limiting with Redis

6. Global Rate Limiting

7. Rate Limiting Tricks
Sliding window
In-memory table
Set-then-get
Redis Sentinel

8. Caching with Redis

9. Efficient Caching in Multiple Layers
Worker 2Worker 1
Shared_dict
Lua LRU Cache
I/O Callback on
cache miss
Cluster
Lua LRU Cache
Mutex

10. Caching Tricks
Layered caching
Smaller objects (<100kb)
Set TTLs
Keyspace Design
Twemproxy

11. OpenResty with Redis

12. Non-blocking way using Redis
without the callback hell
Too good to be true?

13. cosocket = coroutine + socket
Lua Runtime
Redis:set()
Redis:get()
yield
resume
Add NGINX
Events
New Event
Sockets ready to r/w
Errors
Timeouts

14. Essential Syntax

15. OpenResty Redis Libraries
● https://github.com/openresty/lua-resty-redis
● https://github.com/openresty/lua-resty-limit-traffic

16. Benchmark
https://gigaom.com/report/api-management-benchmark/

17. Thank you!

18. PRESENTED BY