Multi-Source M/G/1/1 Queues with Probabilistic Preemption
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915650863104000 |
|---|---|
| author | Moltafet, Mohammad Sadjadpour, Hamid R. Rezki, Zouheir Codreanu, Marian Yates, Roy D. |
| author_facet | Moltafet, Mohammad Sadjadpour, Hamid R. Rezki, Zouheir Codreanu, Marian Yates, Roy D. |
| contents | We consider a multi-source status update system consisting of multiple independent sources, a single server, and a single sink. Each source generates packets according to a Poisson process, and packets are served according to a general service time distribution. The system has a capacity of one packet, i.e., no waiting buffer, and is modeled as a multi-source M/G/1/1 queueing system. We introduce a probabilistically preemptive packet management policy, under which an existing packet from the same source in the system is replaced by an arriving packet with a fixed probability. We derive the moment generating functions (MGFs) of the age of information (AoI) and peak AoI (PAoI) for each source under this policy. Numerical results demonstrate the effectiveness of the proposed packet management policy. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_03241 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Multi-Source M/G/1/1 Queues with Probabilistic Preemption Moltafet, Mohammad Sadjadpour, Hamid R. Rezki, Zouheir Codreanu, Marian Yates, Roy D. Information Theory We consider a multi-source status update system consisting of multiple independent sources, a single server, and a single sink. Each source generates packets according to a Poisson process, and packets are served according to a general service time distribution. The system has a capacity of one packet, i.e., no waiting buffer, and is modeled as a multi-source M/G/1/1 queueing system. We introduce a probabilistically preemptive packet management policy, under which an existing packet from the same source in the system is replaced by an arriving packet with a fixed probability. We derive the moment generating functions (MGFs) of the age of information (AoI) and peak AoI (PAoI) for each source under this policy. Numerical results demonstrate the effectiveness of the proposed packet management policy. |
| title | Multi-Source M/G/1/1 Queues with Probabilistic Preemption |
| topic | Information Theory |
| url | https://arxiv.org/abs/2512.03241 |