Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2001.06328

Energy Efficient Cloud-Fog Architecture

Hatem A. Alharbi·Taisir E. H. Elgorashi·Jaafar M. H. Elmirghani
View original source ↗Read source document ↗Export metadata ↓

Abstract

The advancements of cloud computing came as a radical transformation in the way Information and Communication Technology (ICT) services are deployed and maintained. Cloud computing provides ubiquitous on-demand access to an Internet-based pool of processing, storage, and communication resources offered to a large set of geographically distributed users. As the cloud computing infrastructure grows and demand increases, the need for a new breed of on-demand computing that can efficiently maintain Quality of Service (QoS) requirements has increased. Fog computing was proposed to address the limitations of cloud computing, in terms of delay and high bandwidth requirements, by extending the on-demand resources of clouds to the edge of the network bringing them closer to the users. The massive growth and wide use of cloud-fog services have created serious power consumption concerns. This article delves into the energy consumption of cloud-fog services by raising headline questions related to; how significant the problem itself is, how different conditions/scenarios affect the energy consumption of the architecture, and how to orchestrate the use of the architecture in an energy-efficient manner. We start by summarizing the cloud-fog architecture including different communication and computing layers. Additionally, we give a brief overview of the role of Virtual Machine (VM) placement in optimally using cloud-fog resources in a dynamic manner. Then, we present the problem of energy efficient VMs placement and provide numerical results.

Explore related subjects

cs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hatem A. Alharbi, Taisir E. H. Elgorashi, Jaafar M. H. Elmirghani. 2020-01-16. Energy Efficient Cloud-Fog Architecture. https://arxiv.org/abs/2001.06328

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Semord: Learned Semantic-Preserving Placement and Low-Fanout Routing for Distributed Vector Search

Vector databases are increasingly deployed in distributed settings where different users, sites, or domains maintain vector data. Existing vector databases rely on a coordinator to record which shards store which parts of the vector space and to route each query to those shards. In a decentralized setting, peers may join, leave, or move data without a trusted node tracking every change, and outdated routing information can therefore send queries to the wrong peers or require contacting many peers, reducing vector retrieval recall and increasing network latency. We present Semord, a decentralized vector search overlay system that achieves high recall by routing each ANN query to a small set of relevant peers, without relying on a centralized coordinator. Semord addresses this problem by making semantic locality routable: 1) We propose VHash to place semantically related vectors near each other in the overlay key space while avoiding load imbalance, so that each query only needs to contact a small neighborhood of peers for distributed local ANN ranking. 2) We design VecDHT, a communication protocol that maintains decentralized routing, region metadata, churn resilience, and VHash updates under membership and workload changes. Our extensive experiments on a real testbed show that Semord improves recall by more than 15% and reduces contacted peers by over 60% compared with decentralized baselines. Semord also approaches the recall and latency of a centralized oracle baseline while reducing peak peer-local ANN index memory by more than 2X. Controlled large-scale simulations further show that Semord scales across real-world embedding workloads and remains robust under churn for scoped vector retrieval as a decentralized overlay.

cs.NI↗
arXiv2026

Lizard: Bandwidth-Adaptive Real-Time Video Analytics through Content-Aware Packet Discarding at Last-Mile Edge Routers

The timeliness and accuracy of edge-based video analytics can be hindered by drastic reductions in available bandwidth (ABW) at last-mile edge routers, causing prolonged queuing delays. This work proposes Lizard, a system that leverages video-content-aware packet discarding to mitigate the negative effects of drastic ABW degradation that may frequently occur at a last-mile edge router by judiciously discarding packets that contain frame blocks less important to the analytics at the destination. To achieve this, we first devise a frame-block-aware RTP header extension to effectively decouple packet dependencies to encode frame blocks. Second, Lizard uses a priority-based feedback mechanism that dynamically evaluates packet priorities based on relative accuracy impacts. Third, we develop an adaptive phase-transition-based packet discarding strategy at the router to discard packets that represent unimportant blocks. Our evaluation of Lizard shows improvements over existing methods are substantial: 53.2% reduction in latency and 27.1% increase in analysis accuracy.

cs.NI↗
arXiv2026

Flux: Optimal Scheduling of Optical Circuit Switches for LLM Training

Optical Circuit Switching (OCS) offers high bandwidth density and energy efficiency for LLM training, but incurs a non-negligible reconfiguration delay. Prior work typically schedules optical circuit switches independently of compute, using aggregate traffic demand to determine which circuits to provision and when. We argue that this separation creates a fundamental inefficiency: reconfigurations that ignore the compute timeline can stall communication, resulting in low circuit utilization and large buffer requirements. In this paper, we present Flux, a scheduler that optimally schedules optical circuit switches based on the structure of the entire workload. Flux remains effective across a wide range of switching speeds by reusing circuits and amortizing reconfiguration delay behind compute and communication. We show that Flux reduces training iteration time by up to $10\times$ and peak NIC buffer requirements by more than three orders of magnitude compared to traditional periodic schedulers.

cs.NI↗