Admit or preserve? Addressing server failures in cloud computing task management

DOI10.1007/S11134-019-09624-ZMaRDI QIDQ2308282zbMATH OpenOpenAlexFDO

Authors Nadav Lavi, Hanoch Levy

Publication date 26 March 2020

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11134-019-09624-z

zbMATH Keywords

admission controlcloud computingMarkov decision processestask managementtask preservation

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40) Stochastic systems in control theory (general) (93E03)

Recommendations

• New approach based on group technology for the consolidation problem in cloud computing-mathematical model and genetic algorithm
• Revenue management for cloud computing providers: decision models for service admission control under non-probabilistic uncertainty
• A two-stage approach for task and resource management in multimedia cloud environment
• A task scheduling strategy with a sleep-delay timer and a waking-up threshold in cloud computing
• Performance analysis of large-scale parallel-distributed processing with backup tasks for cloud computing

Cites work

• A Many-Server Queue with Service Interruptions
• A Queueing Reward System with Several Customer Classes
• Admission and Termination Control of a Two Class Loss System
• Admission policies for a two class loss system
• BIAS OPTIMALITY IN A QUEUE WITH ADMISSION CONTROL
• Control of arrivals to two queues in series
• Dynamic Admission Control in a Call Center With One Shared and Two Dedicated Service Facilities
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• Incompleteness of results for the slow-server problem with an unreliable fast server
• Modeling and dynamic scheduling of a queueing system with blocking and starvation
• Monotonicity in Markov Reward and Decision Chains: Theory and Applications
• On optimal call admission control in resource-sharing system
• On submodular value functions and complex dynamic programming
• Optimal control of a two-server queueing system with failures
• Queueing model of a hybrid channel with faster link subject to partial and complete failures
• Structural results for the control of queueing systems using event-based dynamic programming

This page was built for publication: Admit or preserve? Addressing server failures in cloud computing task management

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2308282)