ProbXiv
Explorersign in
Problem archiveProblem record

Statement

An allocation distributes storage across nn nodes, and its recovery delay is denoted by DD; the parameters are the node count nn, request rate λ\lambda, and threshold TT. An allocation is symmetric when it treats the nodes identically. Symmetric optimal allocation conjecture. A symmetric optimal allocation always exists for any nn, λ\lambda, and TT. This conjecture is motivated by numerical observations concerning the optimization of expected recovery delay. The supplied source does not state whether the conjecture has been resolved.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.