A web service uses a rate limit algorithm that puts all incoming REST API requests into a queue in the order in which they arrive. The algorithm allows incoming requests to arrive at any rate, but the server processes the requests from the queue at a fixed rate. Which rate limit algorithm is used by the web service?

IT Questions BankCategory: DevNetA web service uses a rate limit algorithm that puts all incoming REST API requests into a queue in the order in which they arrive. The algorithm allows incoming requests to arrive at any rate, but the server processes the requests from the queue at a fixed rate. Which rate limit algorithm is used by the web service?

A web service uses a rate limit algorithm that puts all incoming REST API requests into a queue in the order in which they arrive. The algorithm allows incoming requests to arrive at any rate, but the server processes the requests from the queue at a fixed rate. Which rate limit algorithm is used by the web service?

  • token bucket
  • fixed window counter
  • sliding window counter
  • leaky bucket

Explanation: Common rate limit algorithms include the following:

  • Leaky bucket
  • Token bucket
  • Fixed window counter
  • Sliding window counter

The leaky bucket algorithm puts all incoming requests into a request queue in the order in which they were received. The incoming requests can come in at any rate, but the server will process the requests from the queue at a fixed rate. If the request queue is full, the request is rejected.

Exam with this question: 4.9.3 Module 4: Understanding and Using APIs Quiz

Subscribe
Notify of
guest

0 Comments
Inline Feedbacks
View all comments