Resource competition in virtual network embedding
From MaRDI portal
Publication:4994071
DOI10.1080/15326349.2020.1858875zbMATH Open1473.90047OpenAlexW3115372987MaRDI QIDQ4994071FDOQ4994071
Authors: Jing Fu, Chenchen Xing, W. Moran, P. G. Taylor
Publication date: 14 June 2021
Published in: Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15326349.2020.1858875
Recommendations
Cites Work
- Restless bandits, partial conservation laws and indexability
- Title not available (Why is that?)
- On an index policy for restless bandits
- Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
- Basics of Applied Stochastic Processes
- Performance modeling and design of computer systems. Queueing theory in action
- Virtual network provisioning across multiple substrate networks
- Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
- The complexity of optimal queuing network control
- Dynamic priority allocation via restless bandit marginal productivity indices
- Asymptotically optimal priority policies for indexable and nonindexable restless bandits
- Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic
Cited In (5)
- Competitive and deterministic embeddings of virtual networks
- 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
- Virtual network provisioning across multiple substrate networks
Uses Software
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)