Hide/Show Apps

Age-Optimal Updates of Multiple Information Flows

2018-04-19
Sun, Yin
Uysal, Elif
Kompella, Sastry
Show full item record
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
1
views
0
downloads
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.
https://hdl.handle.net/11511/53048
Department of Electrical and Electronics Engineering, Conference / Seminar
METU IIS - Integrated Information Service IT Support Service
You can transmit your request, problems about services
provided by METU Computer Center, and follow the process.