Work

Age-optimal updates of multiple information flows

Year: 2018

Type: conference-paper

Abstract: In this paper, we study an age of information minimization problem, where multiple flows of update packets are sent over multiple servers to their destinations. Two online scheduling policies are proposed. When the packet generation and arrival times are synchronized across the flows, the proposed policies are shown to be (near) optimal for minimizing any time-dependent, symmetric, and non-decreasing penalty function of the ages of the flows over time in a stochastic ordering sense.

Source: IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)

DOI: 10.1109/infcomw.2018.8406945

Authors: Yin Sun, Eiif Uysal-Biyikoglu, Sastry Kompella

Institutions: Auburn University, Middle East Technical University, United States Naval Research Laboratory, Naval Research Laboratory Information Technology Division

Language: English

Topic: Age of Information Optimization

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2963028458

FWCI: 15.29

Cites: 29

Cited by: 133

Related to: 10