We consider two types of problems associated with a bufferless server with service preemption (push-out). One type is motivated by "adversarial" coupon collection with applications to modeling the surveillance of a set of servers by a botnet planning a DDoS attack on them collectively. The servers dynamically change according to a moving-target defense. Another type of problem has to do with a sequence of messages handled by the (transmission) server wherein each message obsoletes all previous ones . The objective is to assess the freshness of the latest message/information that has been successfully transmitted, i.e., "age of information"  .
A queueing system handling a sequence of message arrivals is considered where each message obsoletes all previous messages . The objective is to assess the freshness of the latest message/information that has been successfully transmitted, i.e., "age of information" (AoI). We study a variation of traditional AoI, the "Relative AoI", here defined so as to account for the presence of newly arrived messages/information to the queue to be transmitted. Both unbuffered and buffered systems are considered .
R
We consider two types of problems associated with a bufferless server with service preemption (push-out). One type is motivated by "adversarial" coupon collection with applications to modeling the surveillance of a set of servers by a botnet planning a DDoS attack on them collectively. The servers dynamically change according to a moving-target defense. Another type of problem has to do with a sequence of messages handled by the (transmission) server wherein
A queueing system handling a sequence of message arrivals is considered where
R
ones
messages
A
(AoI). We study a variation of traditional AoI, the "Relative AoI", here defined so as to account for the presence of newly arrived messages/information to the queue to be transmitted. Both unbuffered and buffered systems are considered