Universal User Matching Server for Scalable Game Mode Integration
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing user matching technologies have limited universality and expansibility, leading to high implementation costs across different application programs, requiring separate matching systems and procedures for each type of application, which becomes cumbersome when new game modes are added.
Innovation Solution
A method and apparatus for user matching that supports both synchronous and asynchronous modes, utilizing a unified matching procedure, where a matching request is processed by processing circuitry to select user identifiers from matching queues based on application identifiers, allowing for flexible and scalable user grouping across various application programs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If an independently developed matching procedure is used for each application program, then the matching can be tailored to specific application requirements, but the implementation cost increases and universality decreases
Solution Approach 1:
The patent implements a universal matching system that can serve multiple application programs through a single unified matching procedure. The matching server receives matching requests from different applications and processes them using the same core matching logic, making the system multi-functional and applicable to various game types and scenarios without requiring separate matching systems for each application.
Solution Approach 2:
The patent segments the matching system into modular components: a universal matching server that handles core matching logic, and application-specific interfaces that allow different applications to interact with the same matching system. This segmentation enables the system to maintain universality while still accommodating specific application requirements through configurable parameters and interfaces.
2Reliability
If separate matching systems are developed for different application programs, then each application can have optimized matching logic, but the implementation cost and development time increase
Solution Approach 1:
The patent creates a single universal matching server that can be deployed once to serve multiple application programs, significantly reducing implementation costs compared to developing separate matching systems for each application. The server processes matching requests from different applications using the same infrastructure, reducing both direct costs and opportunity costs.
Solution Approach 2:
The patent enables the universal matching system to adapt to different application requirements by changing parameters such as matching algorithms, player statistics weights, and matching criteria rather than requiring separate systems. This parameter-based configuration allows the system to maintain matching accuracy for different applications while using the same core infrastructure.
3Adaptability or versatility
If the matching system is modified when a new game mode is added, then the matching can accommodate new requirements, but the system complexity increases and expansibility decreases
Solution Approach 1:
The patent implements a dynamic matching system where the matching parameters, algorithms, and criteria can be adjusted and configured based on different game modes without requiring fundamental system changes. The system can adapt to new game modes by loading different configuration parameters and algorithms, making the system flexible and easy to expand.
Solution Approach 2:
The patent prepares the matching system in advance to handle various game modes by implementing a configurable architecture that can load different matching parameters and algorithms as needed. This preliminary configuration capability allows new game modes to be integrated by simply adding new parameter sets rather than modifying the core system structure.
4Device complexity
If a unified matching procedure is implemented across different application programs, then implementation cost decreases and universality improves, but the ability to handle application-specific requirements may be reduced
Solution Approach 1:
The patent applies local quality by allowing the universal matching system to use different matching parameters, algorithms, and criteria for different applications or game modes. Each application can have its own customized matching configuration while still using the same core matching server, enabling the system to be both simple and highly adaptable to specific application requirements.
Data Source
AI summary
A method for user matching is provided. A matching request is received from a client. The matching request includes an application identifier and a user identifier. When the application identifier indicates that a matching mode for the matching request is an asynchronous mode, a matching queue identifier is obtained based on the matching request, the user identifier is added to a matching queue corresponding to the matching queue identifier, a predetermined number of user identifiers is selected from the matching queue, a matching result is generated that includes an identifier of a matching group of the selected predetermined number of user identifiers, and the matching result is sent to the client. The predetermined number of user identifiers includes the user identifier in the matching request.