A Novel Approximate Algorithm for Admission Control
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1947059 (Why is no real title available?)
- A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems
- A unified approach to approximating resource allocation and scheduling
- Admission control with advance reservations in simple networks
- An efficient approximation for the generalized assignment problem
- Approximation and Online Algorithms
- Fixed interval scheduling: models, applications, computational complexity and algorithms
Cited in
(11)- Combining online algorithms for acceptance and rejection
- Admission control to minimize rejections and online set cover with repetitions
- Admission control with advance reservations in simple networks
- Approximation and Online Algorithms
- Admission control with immediate notification
- Admission control with batch arrivals.
- A policy approximation method for the UMTS connection admission control problem modelled as an MDP
- Admission control in stochastic event graphs
- Admission Control to Minimize Rejections
- A new LP formulation of the admission control problem modelled as an MDP under average reward criterion
- Dynamic quota-besed admission control with sub-rating in multimedia servers
This page was built for publication: A Novel Approximate Algorithm for Admission Control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5321723)
