RYRoy D. Yates

Roy D. Yates

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Roy D. Yates has a total of 10 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Cache Updating Strategy Minimizing the Age of Information with Time-Varying Files' Popularities

    by Haoyue Tang, Philippe Ciblat, Jintao Wang, Michele Wigger, Roy D. Yates

    We consider updating strategies for a local cache which downloads time-sensitive files from a remote server through a bandwidth-constrained link. The files are requested randomly from the cache by local users according to a popularity distribution which varies over time according to a Markov chain structure. We measure the freshness of the requested time-sensitive files through their Age of Information (AoI). The goal is then to minimize the average AoI of all requested files by appropriately designing the local cache's downloading strategy. To achieve this goal, the original problem is relaxed and cast into a Constrained Markov Decision Problem (CMDP), which we solve using a Lagrangian approach and Linear Programming. Inspired by this solution for the relaxed problem, we propose a practical cache updating strategy that meets all the constraints of the original problem. Under certain assumptions, the practical updating strategy is shown to be optimal for the original problem in the asymptotic regime of a large number of files. For a finite number of files, we show the gain of our practical updating strategy over the traditional square-root-law strategy (which is optimal for fixed non time-varying file popularities) through numerical simulations.

  • Open Access

    Data Freshness in Leader-Based Replicated Storage

    by Amir Behrouzi-Far, Emina Soljanin, Roy D. Yates

    Leader-based data replication improves consistency in highly available distributed storage systems via sequential writes to the leader nodes. After a write has been committed by the leaders, follower nodes are written by a multicast mechanism and are only guaranteed to be eventually consistent. With Age of Information (AoI) as the freshness metric, we characterize how the number of leaders affects the freshness of the data retrieved by an instantaneous read query. In particular, we derive the average age of a read query for a deterministic model for the leader writing time and a probabilistic model for the follower writing time. We obtain a closed-form expression for the average age for exponentially distributed follower writing time. Our numerical results show that, depending on the relative speed of the write operation to the two groups of nodes, there exists an optimal number of leaders which minimizes the average age of the retrieved data, and that this number increases as the relative speed of writing on leaders increases.

  • Open Access

    Age of Information Aware Cache Updating with File- and Age-Dependent Update Durations

    by Haoyue Tang, Philippe Ciblat, Jintao Wang, Michele Wigger, Roy Yates

    We consider a system consisting of a library of time-varying files, a server that at all times observes the current version of all files, and a cache that at the beginning stores the current versions of all files but afterwards has to update %fresh versions of these files from the server. Unlike previous works, the update duration is not constant but depends on the file and its Age of Information (AoI), i.e., of the time elapsed since it was last updated. The goal of this work is to design an update policy that minimizes the average AoI of all files with respect to a given popularity distribution. Actually a relaxed problem, close to the original optimization problem, is solved and a practical update policy is derived. The update policy relies on the file popularity and on the functions that characterize the update durations of the files depending on their AoI. Numerical simulations show a significant improvement of this new update policy compared to the so-called square-root policy that is optimal under file-independent and constant update durations.

  • Open Access

    Status Updates Through Multicast Networks

    by Jing Zhong, Emina Soljanin, Roy D. Yates

    Using age of information as the freshness metric, we examine a multicast network in which real-time status updates are generated by the source and sent to a group of $n$ interested receivers. We show that in order to keep the information freshness at each receiver, the source should terminate the transmission of the current update and start sending a new update packet as soon as it receives the acknowledgements back from any $k$ out of $n$ nodes. As the source stopping threshold $k$ increases, a node is more likely to get the latest generated update, but the age of the most recent update is more likely to become outdated. We derive the age minimized stopping threshold $k$ that balances the likelihood of getting the latest update and the freshness of the latest update for shifted exponential link delay. Through numerical evaluations for different stopping strategies, we find that waiting for the acknowledgements from the earliest $k$ out of $n$ nodes leads to lower average age than waiting for a pre-selected group of $k$ nodes. We also observe that a properly chosen threshold $k$ can prevent information staleness for increasing number of nodes $n$ in the multicast network.

  • Open Access

    Minimizing Content Staleness in Dynamo-Style Replicated Storage Systems

    by Jing Zhong, Roy D. Yates, Emina Soljanin

    Consistency in data storage systems requires any read operation to return the most recent written version of the content. In replicated storage systems, consistency comes at the price of delay due to large-scale write and read operations. Many applications with low latency requirements tolerate data staleness in order to provide high availability and low operation latency. Using age of information as the staleness metric, we examine a data updating system in which real-time content updates are replicated and stored in a Dynamo-style quorum- based distributed system. A source sends updates to all the nodes in the system and waits for acknowledgements from the earliest subset of nodes, known as a write quorum. An interested client fetches the update from another set of nodes, defined as a read quorum. We analyze the staleness-delay tradeoff in replicated storage by varying the write quorum size. With a larger write quorum, an instantaneous read is more likely to get the latest update written by the source. However, the age of the content written to the system is more likely to become stale as the write quorum size increases. For shifted exponential distributed write delay, we derive the age optimized write quorum size that balances the likelihood of reading the latest update and the freshness of the latest update written by the source.