Matching Users by Ranking in a Matchmaking Queue
up vote
0
down vote
favorite
Say you want to make a queue that players join where player data looks something like this:
{
playerID: 123,
name: "mr peanut",
ranking: 1337
}
What is the best way to handle finding x similar players in the queue to match with?
I.E. i try to find all players with ranking +/- 10 but there are none, so I wait, then if the queue time is long enough I change to +/- 15, and so on an so forth up to a cap.
My idea would be to store player data into a queue built in redis, and have a worker process constantly scanning through the queue in search of a match. But I'm curious if there are some best practices, tutorials, or general ideas you can help me learn so i can have a better idea.
Requirements: It must be able to scale, and ideally uses a low amount of overhead, scanning seems kind of ridiculous and inefficient at first thought, which makes me think redis might not be the best idea.
Thank you!
architecture queue multiplayer matchmaking
add a comment |
up vote
0
down vote
favorite
Say you want to make a queue that players join where player data looks something like this:
{
playerID: 123,
name: "mr peanut",
ranking: 1337
}
What is the best way to handle finding x similar players in the queue to match with?
I.E. i try to find all players with ranking +/- 10 but there are none, so I wait, then if the queue time is long enough I change to +/- 15, and so on an so forth up to a cap.
My idea would be to store player data into a queue built in redis, and have a worker process constantly scanning through the queue in search of a match. But I'm curious if there are some best practices, tutorials, or general ideas you can help me learn so i can have a better idea.
Requirements: It must be able to scale, and ideally uses a low amount of overhead, scanning seems kind of ridiculous and inefficient at first thought, which makes me think redis might not be the best idea.
Thank you!
architecture queue multiplayer matchmaking
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Say you want to make a queue that players join where player data looks something like this:
{
playerID: 123,
name: "mr peanut",
ranking: 1337
}
What is the best way to handle finding x similar players in the queue to match with?
I.E. i try to find all players with ranking +/- 10 but there are none, so I wait, then if the queue time is long enough I change to +/- 15, and so on an so forth up to a cap.
My idea would be to store player data into a queue built in redis, and have a worker process constantly scanning through the queue in search of a match. But I'm curious if there are some best practices, tutorials, or general ideas you can help me learn so i can have a better idea.
Requirements: It must be able to scale, and ideally uses a low amount of overhead, scanning seems kind of ridiculous and inefficient at first thought, which makes me think redis might not be the best idea.
Thank you!
architecture queue multiplayer matchmaking
Say you want to make a queue that players join where player data looks something like this:
{
playerID: 123,
name: "mr peanut",
ranking: 1337
}
What is the best way to handle finding x similar players in the queue to match with?
I.E. i try to find all players with ranking +/- 10 but there are none, so I wait, then if the queue time is long enough I change to +/- 15, and so on an so forth up to a cap.
My idea would be to store player data into a queue built in redis, and have a worker process constantly scanning through the queue in search of a match. But I'm curious if there are some best practices, tutorials, or general ideas you can help me learn so i can have a better idea.
Requirements: It must be able to scale, and ideally uses a low amount of overhead, scanning seems kind of ridiculous and inefficient at first thought, which makes me think redis might not be the best idea.
Thank you!
architecture queue multiplayer matchmaking
architecture queue multiplayer matchmaking
asked Nov 22 at 16:44
Sammy Roberts
1841110
1841110
add a comment |
add a comment |
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53435272%2fmatching-users-by-ranking-in-a-matchmaking-queue%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53435272%2fmatching-users-by-ranking-in-a-matchmaking-queue%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown