Resource competition in virtual network embedding
From MaRDI portal
Recommendations
Cites work
- Asymptotically optimal priority policies for indexable and nonindexable restless bandits
- Basics of Applied Stochastic Processes
- Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
- Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
- Dynamic priority allocation via restless bandit marginal productivity indices
- scientific article; zbMATH DE number 4087408 (Why is no real title available?)
- On an index policy for restless bandits
- Performance modeling and design of computer systems. Queueing theory in action
- Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic
- Restless bandits, partial conservation laws and indexability
- The complexity of optimal queuing network control
- Virtual network provisioning across multiple substrate networks
Cited in
(5)- Compact and extended formulations for the virtual network embedding problem
- Virtual network embedding in the cycle
- On the computational complexity of the virtual network embedding problem
- Competitive and deterministic embeddings of virtual networks
- Virtual network provisioning across multiple substrate networks
This page was built for publication: Resource competition in virtual network embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4994071)