Energy Packet Networks with Finite Capacity Energy Queues - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Energy Packet Networks with Finite Capacity Energy Queues

Résumé

Energy Packet Network (EPN) consists of a queueing network formed by n blocks, where each of them is formed by one data queue, that handles the workload, and one energy queue, that handles packets of energy. We study an EPN model where the energy packets start the transfer. In this model, energy packets are sent to the data queue of the same block. An energy packet routes one workload packet to the next block if the data queue is not empty, and it is lost otherwise. We assume that the energy queues have a finite buffer size and if an energy packet arrives to the system when the buffer is full, jump-over blocking (JOB) is performed, and therefore with some probability it is sent to the data queue and it is lost otherwise. We first provide a value of this probability such that the steady-state probability distribution of packets in the queues admits a product form solution. Moreover, in the case of a single block, we show that the number of data packets in the system decreases as the JOB probability increases.
Fichier non déposé

Dates et versions

hal-03094615 , version 1 (04-01-2021)

Identifiants

Citer

Sébastien Samain, Josu Doncel, Ana Bušić, Jean-Michel Fourneau. Energy Packet Networks with Finite Capacity Energy Queues. VALUETOOLS '20: 13th EAI International Conference on Performance Evaluation Methodologies and Tools, May 2020, Tsukuba / Virtual, Japan. pp.142-149, ⟨10.1145/3388831.3388841⟩. ⟨hal-03094615⟩
64 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More