Optimal Energy Distribution with Energy Packet Networks

Yunxiao Zhang, Yunxiao Zhang 0001arXiv 2018 · arXiv

Abstract

As digital infrastructure increasingly relies on intermittent renewable energy, efficient power distribution becomes a critical challenge. This paper presents a framework using Energy Packet Networks (EPNs) to optimize energy allocation across distributed workstations. By treating energy as discrete packets that process job batches, the research develops an analytical framework to minimize a composite cost function of job latency and energy loss. The findings demonstrate that this cost function is strictly convex, allowing for the determination of unique global optima in various network configurations.

Introduction

In the era of the Internet of Things (IoT) and massive cloud data centers, "green computing" has transitioned from a sustainability goal to a mathematical necessity. The shift toward intermittent renewable energy sources, such as wind and solar, requires intelligent distribution systems that can handle the volatility of energy harvesting. A key challenge lies in balancing Quality of Service (QoS)—specifically job latency—with the minimization of energy waste caused by leakage or idle workstation consumption.

The Energy Packet Network Model

The research utilizes Energy Packet Networks (EPNs), a specialized discrete state-space framework based on G-networks. In this model, jobs are treated as "positive customers" waiting in a queue, while energy packets (EPs) act as "negative customers." When an EP arrives at a workstation, it triggers the processing (removal) of jobs.

Schematic of an Energy Packet Network (EPN) node showing the interaction between energy storage and job processing.

A significant innovation in this work is the introduction of batch processing. Unlike traditional models where one EP processes exactly one job, this EPN allows a single EP to process a variable batch of jobs, modeled via a geometric distribution. This approach more accurately reflects real-world computing environments where a single power cycle can handle multiple small tasks.

Optimization and Cost Minimization

The core of the study is the definition and minimization of a composite cost function, $C = W + E$, where $W$ represents the average job response time (derived via Little’s Law) and $E$ represents the total rate of energy loss. Energy loss occurs through two primary channels:

  1. Leakage: Energy dissipating from storage units over time.
  2. Idle Waste: Energy sent to a workstation that has no jobs to process.

The author proves that this cost function is strictly convex. This property is vital as it guarantees a unique global optimum, ensuring that the derived energy distribution is the most efficient possible for a given set of parameters.

Results and Insights

The theoretical model was validated through numerical simulations using synthetic parameters (e.g., harvesting rates of 150 EPs/sec and job arrival rates of 50-60 jobs/sec). Key findings include:

  • Performance Gains: In a two-workstation (N=2) scenario, the optimized distribution reduced average response time by 0.62 seconds and saved 1.78 energy packets per second compared to non-optimized states.
  • Scalability: For high-energy scenarios where harvesting is abundant, the author developed a simplified Lagrangian multiplier solution. This approximation proved highly accurate, with a negligible error of 0.005 compared to the true minimal cost, offering a computationally efficient path for large-scale networks.
  • Idle Management: The model's explicit accounting for idle waste prevents the system from inefficiently flooding underutilized nodes with power.

Conclusion

This research provides a robust mathematical foundation for smart grid management in computing environments. While the current model assumes static routing and specific job arrival distributions, it sets the stage for more dynamic systems. Future work will explore load balancing (moving jobs between workstations) and energy sharing (moving energy between storage units) to further enhance the resilience and efficiency of green computing infrastructures.

Summary updated

Abstract

We use Energy Packet Network paradigms to investigate energy distribution problems in a computer system with energy harvesting and storages units. Our goal is to minimize both the overall average response time of jobs at workstations and the total rate of energy lost in the network. Energy is lost when it arrives at idle workstations which are empty. Energy is also lost in storage leakages. We assume that the total rate of energy harvesting and the rate of jobs arriving at workstations are known. We also consider a special case in which the total rate of energy harvesting is sufficiently large so that workstations are less busy. In this case, energy is more likely to be sent to an idle workstation. Optimal solutions are obtained which minimize both the overall response time and energy loss under the constraint of a fixed energy harvesting rate.
BibTeX
@misc{zhang2018optimal,
  author = {Yunxiao Zhang and Yunxiao Zhang},
  title = {{Optimal Energy Distribution with Energy Packet Networks}},
  year = {2018},
  eprint = {1810.07798},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1810.07798},
}
Figure