Browsing by Subject "Information age"
Now showing 1 - 3 of 3
- Results Per Page
- Sort Options
Item Unknown Cyclic scheduling for age of information minimization with generate at will status updates(IEEE, 2024-04-02) Gamgam, Ege Orkun; Akar, Nail; Ulukuş, ŞennurWe study the scheduling problem in a status update system composed of multiple information sources with different service time distributions and weights, for the purpose of minimizing the weighted sum age of information (AoI). In particular, we study open-loop schedulers which rely only on the statistics (specifically, only on the first two moments) of the source service times, in contrast to closed-loop schedulers that also make use of the actual realizations of the service times and the AoI processes in making scheduling decisions. We consider the generate-at-will (GAW) model, and develop an analytical method to calculate the exact AoI for probabilistic and cyclic open-loop schedulers. In both cases, the server initiates the sampling of a source and the ensuing transmission of the update packet from the source to the server in an open-loop manner; either based on a certain probability (probabilistic scheme) or according to a deterministic cyclic pattern (cyclic scheme). We derive the optimum open-loop cyclic scheduling policy in closed form for the specific case of N = 2 sources and propose well-performing heuristic cyclic schedulers for general number of sources, i.e., N > 2. Numerical examples are provided to validate the existing methods.Item Open Access The fourth revolution: philosophical foundations and technological implications(Springer, 2010) Demir, H.This article introduces this special issue of Knowledge, Technology and Policy. It also explains why Luciano Floridi’s Philosophy of Technology is chosen as the topic of the special issue.Item Open Access Scalable cyclic shedulers for age of information optimization in large-scale status update systems(IEEE, 2024) Akar, Nail; Liyanaarachchi, Sahan; Ulukus, SennurWe study open-loop cyclic scheduling for generate-at-will (GAW) multi-source status update systems with heteroge-neous service times and packet drop probabilities, with the goal of minimizing the weighted sum age of information (AoI), called system AoI, or the weighted sum peak AoI (PAoI), called system PAoI. In particular, we propose an offline method to obtain a well-performing cyclic schedule, which can scale to very large number of information sources. Moreover, the proposed schedule has a very low online implementation complexity. The proposed schedules are comparatively studied against existing age-agnostic scheduling algorithms in terms of computational load and system AoI/PAoI performance, to validate their effectiveness