Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.00274 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916593530830848 |
|---|---|
| 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 status update system consisting of one source, one server, and one sink. The source generates packets according to a Poisson process and the packets are served according to a generally distributed service time. We consider a system with a capacity of one packet, i.e., there is no waiting buffer in the system, and model it as an M/G/1/1 queueing system. We introduce a probabilistically preemptive packet management policy and calculate the moment generating functions (MGFs) of the age of information (AoI) and peak AoI (PAoI) under the policy. According to the probabilistically preemptive policy, when a packet arrives, the possible packet in the system is replaced by the arriving packet with a fixed probability. Numerical results show the effectiveness of the packet management policy. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_00274 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | AoI in 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 status update system consisting of one source, one server, and one sink. The source generates packets according to a Poisson process and the packets are served according to a generally distributed service time. We consider a system with a capacity of one packet, i.e., there is no waiting buffer in the system, and model it as an M/G/1/1 queueing system. We introduce a probabilistically preemptive packet management policy and calculate the moment generating functions (MGFs) of the age of information (AoI) and peak AoI (PAoI) under the policy. According to the probabilistically preemptive policy, when a packet arrives, the possible packet in the system is replaced by the arriving packet with a fixed probability. Numerical results show the effectiveness of the packet management policy. |
| title | AoI in M/G/1/1 Queues with Probabilistic Preemption |
| topic | Information Theory |
| url | https://arxiv.org/abs/2502.00274 |