12 problems
- 0 votes0 replies1 view
Conjecture on similar AAoI behavior under stochastic and generate-at-will arrivals
Similar-behavior conjecture. The AAoI of UORA networks with stochastic arrival of status updates and that of UORA networks with generate-at-will status updates…
- 0 votes0 replies2 views
Conjecture on the insignificance of the lower-bound AAoI deviation
Insignificant-deviation conjecture. The deviation between and could be insignificant. This conjecture is based on numerical results sho…
- 0 votes0 replies0 views
Negative-drift conjecture for asymmetric routing on a circle
Negative-drift conjecture. The same Lyapunov function as the one used in the proof of Theorem has negative drift in this asymmetric-routing scenario as well.
- 0 votes0 replies0 views
Necessity of the stability region for finite single-hop networks
Necessity conjecture. If is strictly outside , then the queue-length process is transient.
- 0 votes0 replies1 view
Squared decay-rate conjecture for the minimum queue length
Let and be the equilibrium queue lengths in the two-queue random walk, and let be the equilibrium queue length in the corresponding model with one queue…
- 0 votes0 replies1 view
Stability conjecture for the pseudo-Bayesian sign-compute-resolve scheme
Stability conjecture. Since the scheme closely resembles Rivest's pseudo-Bayesian approach, stability should hold, and techniques similar to those used by Tsitsiklis should be appl…
- 0 votes0 replies1 view
Extension of mean waiting-time approximations to non-complete interference graphs
Let denote the scaling parameter for the network, let be the waiting time for class , and let be its empirical counterpart. For complete inter…
- 0 votes0 replies0 views
The grid-graph conjecture for the coefficient
Consider the grid mentioned above, with … Here is the coefficient governing the lower bound on the mixing time and mean queue length, and …
- 0 votes0 replies0 views
The conjecture that the random-capture scheme is throughput-optimal in arbitrary topologies
Random-capture throughput-optimality conjecture. The random-capture scheme is throughput-optimal in arbitrary network topologies.
- 0 votes0 replies0 views
Positive-throughput conjecture for finite-population ALOHA with variable packets
Let , , , and be the system parameters, with . Positive-throughput conjecture. The throughput of the system is positive when is sm…
- 0 votes0 replies0 views
Shannon capacity and stable throughput coincidence conjecture for finite-source random access
Consider a random access system with finitely many source nodes transmitting to a central station. Let the stable throughput region be the set of arrival-rate vectors for which the…
- 0 votes0 replies0 views
Conjecture that stability and throughput regions coincide for finite-user random access
Consider a finite-user random-access network in which source nodes compete for access to a shared channel, and let the stability region and throughput region denote the sets of arr…