Age-Optimal Updates of Multiple Information Flows

Sun Y., UYSAL BIYIKOĞLU E., Kompella S.

IEEE Conference on Computer Communications (IEEE INFOCOM), Hawaii, Amerika Birleşik Devletleri, 15 - 19 Nisan 2018, ss.136-141 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Basıldığı Şehir: Hawaii
  • Basıldığı Ülke: Amerika Birleşik Devletleri
  • Sayfa Sayıları: ss.136-141
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

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.