Cluster Frameworks for Efficient Scheduling and Resource Allocation in Data Center Networks: A Survey

Wang, Kun; Zhou, Qihua; Guo, Song; Luo, Jiangtao

doi:10.1109/comst.2018.2857922

Cited by 57 publications

(25 citation statements)

References 142 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, they proposed a deep reinforcement learning algorithm to solve the formulated resource allocation problems and enhance the QoE precision accordingly. Wang et al [23] present an overview of the ongoing research in resource allocation and efficient scheduling. It elaborated on the state-of-the-art techniques of the cluster framework algorithms and classified them according to different principles.…”

Section: Related Workmentioning

confidence: 99%

Visible light communication-based traffic control of autonomous vehicles at multi-lane roundabouts

Fakirah

Leng

Chen

et al. 2020

J Wireless Com Network

View full text Add to dashboard Cite

Roundabouts are a form of circular intersections adopted to secure road safety of the vehicles. However, collisions are not prevented entirely even when using roundabouts, since accidents may happen at specific intersection points leading to either traffic congestions or serious accidents. In this paper, a visible light communication (VLC)-based collision avoidance scheme is proposed to coordinate autonomous vehicles in traversing roundabouts, which has high effectiveness in vehicular environments. In particular, roadside units (RSUs) are deployed at the roundabout entrances to coordinate the vehicles in a vehicle-to-infrastructure (V2I) mode. By adopting the synchronization approach, vehicles can pass the roundabout simultaneously if their paths are concurrent with each other. Otherwise, vehicles are prioritized according to their arrival time and reasonable decelerations are applied to waive potential conflicts. Simulation results showed that our proposed approach satisfies the roundabout traffic demands in terms of concurrency, safety, and time utilization as vehicles are strongly recommended to decelerate in only 22% of the cases studied in different scenarios.

show abstract

Section: Related Workmentioning

confidence: 99%

Visible light communication-based traffic control of autonomous vehicles at multi-lane roundabouts

Fakirah

Leng

Chen

et al. 2020

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…For each PM, its R C PM , R M PM , R S PM , and R B PM resources are shared by game players P I∼IV , which represent application types. According to (3), each player has its own utility function U X with X ∈ C, M, S, B { } where U X represents the amount of satisfaction of a player toward the outcome of resource distribution. e higher the value of the utility, the higher the satisfaction of the player for that outcome.…”

Section: Mobile Information Systemsmentioning

confidence: 99%

“…erefore, CDC infrastructures, which are maintained and managed at scale by local as well as global operators such as Amazon, Rackspace, Microsoft, and Google, are widely used to offer as-a-services such as data-intensive applications, including query, web service, and big data analytics [2,3]. e properties of CDCs and the mechanisms for limited resource allocations largely define the operation and performance of the CDC system.…”

Section: Introductionmentioning

confidence: 99%

Cooperative Game-Based Virtual Machine Resource Allocation Algorithms in Cloud Data Centers

Kim

2020

Mobile Information Systems

View full text Add to dashboard Cite

With the growing demand of cloud services, cloud data centers (CDCs) can provide flexible resource provisioning in order to accommodate the workload demand. In CDCs, the virtual machine (VM) resource allocation problem is an important and challenging issue to provide efficient infrastructure services. In this paper, we propose a unified resource allocation scheme for VMs in the CDC system. To provide a fair-efficient solution, we concentrate on the basic concept of Shapley value and adopt its variations to effectively allocate CDC resources. Based on the characteristics of value solutions, we develop novel CPU, memory, storage, and bandwidth resource allocation algorithms. To practically implement our algorithms, application types are assumed as cooperative game players, and different value solutions are applied to optimize the resource utilization. Therefore, our four resource allocation algorithms are jointly combined as a novel fourfold game model and take various benefits in a rational way through the cascade interactions while solving comprehensively some control issues. To ensure the growing demand of cloud services, this feature can leverage the full synergy of different value solutions. To check the effectiveness and superiority of our proposed scheme, we conduct extensive simulations. The simulation results show that our algorithms have significant performance improvement compared to the existing state-of-the-art protocols. Finally, we summarize our cooperative game-based approach and discuss possible major research issues for the future challenges about the cloud-assisted DC resource allocation paradigm.

show abstract

“…Resource management, which is the efficient and effective management of an organization's resources and has been widely applied to different research topics such as defense of terrorist attacks [6], trust data sharing in edge computing [7], green services of content-centric IoT [8] and efficient job scheduling and energy-aware resource management in data center networks [9], [10], provides the cloud defender the inspiration to the development of an effective security resources allocation strategy that mitigates his total loss. As the APT campaign is time-continuous, the cloud defender also needs to take continuous actions.…”

Section: Figurementioning

confidence: 99%

On Dynamic Recovery of Cloud Storage System Under Advanced Persistent Threats

Yang

2019

IEEE Access

View full text Add to dashboard Cite

Advanced persistent threat (APT) for data theft poses a severe threat to cloud storage systems (CSSs). An APT actor may steal valuable data from the target CSS even in a strategic fashion. To protect a CSS from APT, the cloud defender has to dynamically allocate the limited security resources to recover the compromised storage servers, aiming at mitigating his total loss. This paper addresses this dynamic cloud storage recovery (DCSR) problem by employing differential game theory. First, by introducing an expected state evolution model capturing the CSS's expected state evolution process under a combination of attack strategy and recovery strategy, we measure the APT attacker's net benefit and the cloud defender's total loss. On this basis and in the worst-case situation where the cloud defender assumes that the APT attacker has full knowledge of his expected loss, we reduce the DCSR problem to a differential game-theoretic problem (the DCSR * problem) to characterize the strategic interactions between the two parties. Second, we derive a necessary condition for Nash equilibrium of the DCSR * problem and thereby introduce the concept of competitive strategy profile. Next, we study the structural properties of the competitive strategy profile, followed by some numerical examples. Then, we conduct extensive comparative experiments to exhibit that the competitive strategy profile is superior to a large number of randomly generated strategy profiles in the sense of Nash equilibrium solution concept. Finally, we briefly analyze the practicability (scalability and feasibility) of this paper. Our findings will be helpful to enhance the APT defense capabilities of the cloud defender. INDEX TERMS Advanced persistent threat, cloud storage recovery, state evolution model, differential game, Nash equilibrium, necessity system, competitive strategy profile. using social engineering attacks, an APT attacker can always infiltrate the CSS, leading to severe data leakage. Due to the fast rate at which the APTs are evolving, it is almost impossible to perfectly protect a CSS from APTs only by employing traditional defense mechanisms such as Intrusion Detection System (IDS) and firewall. A. MOTIVATION Consider a CSS consisting of multiple storage servers. The cloud defender as the owner of the CSS is responsible for the decision-making of the whole system. Every day a substantial amount of data will be uploaded to or downloaded from the CSS by individual devices or organizations [4]. See Fig. 1 for the diagram of such a CSS. In this setting, an APT attacker can apply social engineering attacks to the cloud defender to compromise the storage servers and establish footholds. Once having footholds in the target CSS, the APT attacker will be able to encrypt and exfiltrate the valuable data to his remote command-and-control (C&C) server through an established communication channel which applies mainstream protocols such as HTTP, HTTPS, FTP, P2P, and others. See Fig. 2 for the diagram of the APT for data theft on the CSS shown in Fig. 1....

show abstract

Cluster Frameworks for Efficient Scheduling and Resource Allocation in Data Center Networks: A Survey

Cited by 57 publications

References 142 publications

Visible light communication-based traffic control of autonomous vehicles at multi-lane roundabouts

Visible light communication-based traffic control of autonomous vehicles at multi-lane roundabouts

Cooperative Game-Based Virtual Machine Resource Allocation Algorithms in Cloud Data Centers

On Dynamic Recovery of Cloud Storage System Under Advanced Persistent Threats

Contact Info

Product

Resources

About