LanguageTerm (authority = ISO 639-3:2007); (type = text)
English
Abstract (type = abstract)
Driven by recent advances in ubiquitous connectivity and pervasive computing, real-time status updates to interested recipients have become increasingly popular in streaming applications. These status updating systems all share a common need: the recipients want their information about the sources to be as fresh as possible. This thesis aims to analyze a recently proposed information freshness/timeliness metric, age of information (AoI), in various real-time network applications, and optimize the corresponding AoI metric given the network constraints.
In this thesis, we model the real-time status updating system as source-receiver pairs connected through the networks. The first fundamental problem we consider is how timely update messages should be compressed based on the given network capacity. Different from traditional data compression techniques that shorten the average codeword length, we show that the optimal lossless compression scheme for fast message delivery depends on higher moments of the codeword length due to the queueing delay. The AoI-optimal codebook can be constructed by a recursive search algorithm based on the convex AoI penalty function.
In ultra-dense network deployments, real-time updates are expected to be distributed to massive numbers of receivers via the nearby storage nodes at the network edge. Thus, the second fundamental problem we address is how the real-time updates should be replicated and distributed to multiple edge storage nodes through multicast networks. We answer the question by evaluating the average AoI at a receiver which has access to a random number of edge storage nodes, given the distribution of the random network delay. This system model is also applicable to time-sensitive content updates in Dynamo-type distributed storage systems in which the write and read operations go to multiple storage nodes simultaneously. We derive the AoI-optimal quorum mechanism that balances the data consistency and operation latency.
Beyond the study of the two fundamental problems in AoI, we extend the similar AoI analysis to applications with resource contention and scheduling. We examine a remote cache updating system in which the local server maintains snapshots of the content at different remote sources and updates those snapshots according to a constrained rate. We compare AoI to an alternative Age of Synchronization freshness metric and evaluate the optimal rate allocation scheme for the two different age metrics. We also examine the edge cloud computational offloading system with multiple users, and investigate the scheduling policy for incoming jobs in a vision processing application at an edge server. We show that a greedy scheduling policy is optimal for a class of AoI-related penalty functions.
Subject (authority = local)
Topic
Age of information
Subject (authority = RUETD)
Topic
Electrical and Computer Engineering
RelatedItem (type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.