Active-Active Service Router Cluster Resource Redistribution

The patent applies preliminary action by pre-computing hash values for all possible failure scenarios before any actual failure occurs. Each service router pre-calculates which services it would assume if any other router fails, using a deterministic hash function based on router identifiers and service identifiers. This eliminates the need for time-consuming negotiations during actual failures, as routers already have predetermined responsibility assignments ready to execute immediately

The patent implements self-service by enabling each service router to independently determine its responsibility for failed router services without needing to negotiate with other routers. Each router autonomously computes whether it should assume a service by evaluating pre-computed hash values locally, eliminating inter-router communication overhead and accelerating the service redistribution process while maintaining consistent decisions across the cluster

The patent applies parameter changes by transforming the complex multi-router negotiation problem into a simple deterministic computation using hash values. Instead of implementing complex negotiation protocols, the system changes the approach to using a hash function that takes router identifiers and service identifiers as inputs and produces a deterministic output that directly indicates responsibility assignment. This simplifies the failure response process while maintaining efficient service redistribution

The patent extracts the essential decision-making logic from the complex negotiation process and encapsulates it in a simple hash computation. By taking out the core responsibility-determination function and implementing it as a deterministic hash-based rule, the system eliminates the need for complex inter-router communication and coordination protocols, reducing process complexity while preserving redistribution efficiency