We analyze Energy Packet Networks (EPNs) in which the service centers consist of multiclass queues and the Data Packets (DPs) initiate the transfer (i.e., the arrival of a DP at the battery triggers the movement) with multiple energy packet requirements. In other words, a class-k DP in cell i is sent successfully to the next cell if there are $c_i^{(k)}$ energy packets and it is dropped otherwise. Besides, we consider that the queues handling DPs operate under one of the following disciplines: First-Input-First-Output (FIFO), Processor Sharing (PS), or Preemptive Last-Input-First-Output (LIFO-PR). This model is an extension of previously studied EPNs [6,16] where the steady-state distribution of the number of jobs in the queues has a product form. In our model, we show the existence of a product form of the steady-state stationary distribution, where the load of the servers is given by a fixed point expression. We study the existence of a solution to the derived fixed point problem and we provide sufficient conditions for the stability of our model. Finally, we show that, for feed forward EPNs, the load of all the queues can be fully characterized.

中文翻译：

---

具有多种能源包需求的能源包网络

我们分析了能量包网络 (EPN)，其中服务中心由多类队列组成，数据包 (DP) 发起具有多个能量包需求的传输（即，DP 到达电池触发移动）。换句话说，一个类——ķ细胞内DP一世如果有，则成功发送到下一个单元格$c_i^{(k)}$能量包，否则将被丢弃。此外，我们认为处理 DP 的队列在以下规则之一下运行：先输入先输出 (FIFO)、处理器共享 (PS) 或抢占式最后输入先输出 (LIFO-PR)。该模型是先前研究的 EPNs [6,16] 的扩展，其中队列中作业数量的稳态分布具有乘积形式。在我们的模型中，我们展示了稳态平稳分布的乘积形式的存在，其中服务器的负载由不动点表达式给出。我们研究了导出不动点问题的解决方案的存在性，并为我们的模型的稳定性提供了充分的条件。最后，我们表明，对于前馈 EPN，可以完全表征所有队列的负载。