2025/02/01 by Mohammad Moltafet, Moltafet, Mohammad, Hamid R. Sadjadpour +7 · 1 voice · 2 citations
Business, Management and Accounting · Computer Science · Engineering · #Advanced Queuing Theory Analysis #FOS: Computer and information sciences #Information Theory (cs.IT) #Real-Time Systems Scheduling #Scheduling and Optimization Algorithms #cs.IT
paper · pdf · doi:10.48550/arxiv.2502.00274
openalex publication_date 2025/02/01 · arxiv published 2025/02/01 · arxiv updated 2025/02/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.