ENERGY PACKET NETWORKS WITH MULTIPLE ENERGY PACKET REQUIREMENTS

Abstract

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.