|
5 | 5 | - Name: Implementing a Hash-Based Load Balancing Algorithm for CF Routing
|
6 | 6 | - Start Date: 2025-04-07
|
7 | 7 | - Author(s): b1tamara, Soha-Albaghdady
|
8 |
| -- Status: Draft <!-- Acceptable values: Draft, Approved, On Hold, Superseded --> |
9 |
| -- RFC Pull Request: https://github.com/cloudfoundry/community/pull/1222 |
| 8 | +- Status: Accepted |
| 9 | +- RFC Pull Request: [community#1222](https://github.com/cloudfoundry/community/pull/1222) |
10 | 10 |
|
11 | 11 | ## Summary
|
12 | 12 |
|
@@ -37,7 +37,7 @@ by utilizing a warm and effective cache.
|
37 | 37 | Another use case: users from different tenants send requests to application instances that establish connections to
|
38 | 38 | tenant-specific databases.
|
39 | 39 |
|
40 |
| - |
| 40 | + |
41 | 41 |
|
42 | 42 | With the current load balancing algorithms, each tenant eventually creates a connection to
|
43 | 43 | each application instance, which then creates connection pools to every customer database. As a result, all tenants
|
@@ -122,7 +122,7 @@ factor. Overflow traffic should always be directed to the same next instance rat
|
122 | 122 |
|
123 | 123 | A possible presentation of deterministic handling can be a ring like:
|
124 | 124 |
|
125 |
| - |
| 125 | + |
126 | 126 |
|
127 | 127 | ### Required Changes
|
128 | 128 |
|
@@ -213,8 +213,8 @@ In the scope of this RFC, it is not planned to implement hash-based routing in r
|
213 | 213 |
|
214 | 214 | #### An activity diagram for routing decision for an incoming request
|
215 | 215 |
|
216 |
| - |
| 216 | + |
217 | 217 |
|
218 | 218 | #### A simplified activity diagram for Gorouter's endpoint registration process
|
219 | 219 |
|
220 |
| - |
| 220 | + |
0 commit comments