Design: How to Solve 503 Error of API when Resources are not ava

  • 时间:2020-09-08 11:19:41
  • 分类:网络文摘
  • 阅读:98 次

The HTTP 503 Error indidicates the server is busy. It might be due to the fact that the servers are overloaded (high load average).

One of my API is designed to return 503 Error when the cached file is not available. It is designed as the follows:

1
2
3
4
if (!is_file($file)) {
    throw_503();
    die();
}
if (!is_file($file)) {
    throw_503();
    die();
}

The $file will be updated periodically e.g. every minute via crontab. When the OS is writing to that file, the is_file will return false because the file is in-use.

One way of solving this is to have multiple caching versions, to avoid the single point of failure. For example, if a file-1 is not available we can check for file-2. These two files should not be updated at the same time.

Another way to resolve this issue is to add a delay check (hacky solution), for example:

1
2
3
4
5
6
7
if (!is_file($file)) {
   sleep(1); // delay check.
}
if (!is_file($file)) {
    throw_503();
    die();
}
if (!is_file($file)) {
   sleep(1); // delay check.
}
if (!is_file($file)) {
    throw_503();
    die();
}

–EOF (The Ultimate Computing & Technology Blog) —

推荐阅读:
How to Check if Array/List Contains Duplicate Numbers or Strings  Counting the Stepping Numbers between A Range using Depth/Breadt  Intersection of Three Sorted Arrays using Three Pointers  How to Reverse Substrings Between Each Pair of Parentheses using  Backpacking Problem Variation via Greedy Approach: How Many Appl  Sliding Window to Get Equal Substrings Within MaxCost Budget  Beginner’s Guide to Python’ Enumerate Function  Algorithms to Determine Unique Number of Occurrences  The Next Permutation Algorithm in C++ (std::next_permutation)  Binary Tree Zigzag Level Order Traversal Algorithms using DFS an 
评论列表
添加评论