4,263 research outputs found
Age of Information in an Overtake-Free Network of Quasi-Reversible Queues
We show how to calculate the Age of Information in an overtake-free network
of quasi-reversible queues, with exponential exogenous interarrivals of
multiple classes of update packets and exponential service times at all nodes.
Results are provided for any number of M/M/1 First-Come-First-Served (FCFS)
queues in tandem, and for a network with two classes of update packets,
entering through different queues in the network and exiting through the same
queue. The main takeaway is that in a network with different classes of update
packets, individual classes roughly preserve the ages they would achieve if
they were alone in the network, except when shared queues become saturated, in
which case the ages increase considerably. The results are extensible for other
quasi-reversible queues for which sojourn time distributions are known, such as
M/M/c FCFS queues and processor-sharing queues.Comment: Accepted version to appear in the Proceedings of IEEE MASCOTS 2020.
Copyright 2020 IEE
Peak Age of Information Distribution for Edge Computing with Wireless Links
Age of Information (AoI) is a critical metric for several Internet of Things
(IoT) applications, where sensors keep track of the environment by sending
updates that need to be as fresh as possible. The development of edge computing
solutions has moved the monitoring process closer to the sensor, reducing the
communication delays, but the processing time of the edge node needs to be
taken into account. Furthermore, a reliable system design in terms of freshness
requires the knowledge of the full distribution of the Peak AoI (PAoI), from
which the probability of occurrence of rare, but extremely damaging events can
be obtained. In this work, we model the communication and computation delay of
such a system as two First Come First Serve (FCFS) queues in tandem,
analytically deriving the full distribution of the PAoI for the M/M/1 - M/D/1
and the M/M/1 - M/M/1 tandems, which can represent a wide variety of realistic
scenarios.Comment: Preprint version of the paper accepted for publication in the
Transactions on Communication
Recommended from our members
Survey of traffic control schemes and error control schemes for ATM networks
Among the techniques proposed for B-ISDN transfer mode, ATM concept is considered to be the most promising transfer technique because of its flexibility and efficiency. This paper surveys and reviews a number of topics related to ATM networks. Those topics cover congestion control, provision of multiple classes of traffic, and error control. Due to the nature of ATM networks, those issues are far more challenging than in conventional networks. Sorne of the more promising solutions to those issues are surveyed, and the corresponding results on performance are summarized. Future research problems in ATM protocol aspect are also presented
A tight bound on the throughput of queueing networks with blocking
In this paper, we present a bounding methodology that allows to compute a tight lower bound on the cycle time of fork--join queueing networks with blocking and with general service time distributions. The methodology relies on two ideas. First, probability masses fitting (PMF) discretizes the service time distributions so that the evolution of the modified network can be modelled by a Markov chain. The PMF discretization is simple: the probability masses on regular intervals are computed and aggregated on a single value in the orresponding interval. Second, we take advantage of the concept of critical path, i.e. the sequence of jobs that covers a sample run. We show that the critical path can be computed with the discretized distributions and that the same sequence of jobs offers a lower bound on the original cycle time. The tightness of the bound is shown on computational experiments. Finally, we discuss the extension to split--and--merge networks and approximate estimations of the cycle time.queueing networks, blocking, throughput, bound, probability masses fitting, critical path.
- …