Abstract
Techniques are described herein for using different constraints and electing a leader based on those constraints. This may help to fairly distribute services among different leader-capable nodes. The constraints may include resources such as Central Processing Units (CPUs), memory, bandwidth, network forwarding resources, etc. For example, compute-intensive applications may require more CPU resources, whereas some applications (e.g., logging) may require more memory. The constraint may also be a combination of multiple resources, such as a log collector analysis service.
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Recommended Citation
Singh, Tapraj; Lo, Jeffrey; Parandekar, Harsh; and Sthanuretnam, Shankar, "CONSTRAINT-BASED ACTIVE-ACTIVE SERVICE REDUNDANCY IN WIRELESS CLUSTER", Technical Disclosure Commons, (April 21, 2020)
https://www.tdcommons.org/dpubs_series/3163