Transmission rate scheduling and stopping time for time-sensitive multicast stream traffic in cellular networks

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Opportunistic multicast schemes for time-sensitive stream traffic are studied for cellular networks where erasure coded packets are transmitted over discrete-time quasi-static forward-link fading channels. Assume that to successfully decode a transmitted stream fragment, it suffices that one receives k packets from the fragment. Two important issues are thus raised on when to stop transmitting a fragment and how to minimize the stopping time (ST) through transmission rate scheduling. Based on available channel state information and scheduled history, we tackle them particularly for small k required for short latency. If the distribution of IID channel states is available, the scheme is to compute and use the optimal constant transmission rate and minimum fixed ST subject to a reliability constraint. We show that the minimum ST grows with the logarithm of multicast group size. If channel state information is available, we propose to minimize random ST through selecting each optimal instantaneous transmission rate for a utility function. The utility function is specifically designed to exploit system transient states and dynamics. Results show that the scheme with an exponential weighted residual work achieves the least mean ST but the scheme maximizing instantaneous effective sum throughput has an edge of low complexity.

Original languageEnglish
Article number6760607
Pages (from-to)1754-1765
Number of pages12
JournalIEEE Transactions on Wireless Communications
Volume13
Issue number4
DOIs
Publication statusPublished - 2014 Jan 1

Fingerprint

Stopping Time
Multicast
Cellular Networks
Scheduling
Channel state information
Traffic
Fragment
Channel State Information
Utility Function
Instantaneous
Fading channels
Telecommunication links
Minimise
Optimal Constants
Transient Dynamics
Throughput
Transient State
Decode
Fading Channels
Logarithm

Keywords

  • Opportunistic multicast
  • cellular networks
  • erasure code
  • stopping time
  • time-sensitive

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

@article{0d4363ab4abb4003b565e0eff26e78d0,
title = "Transmission rate scheduling and stopping time for time-sensitive multicast stream traffic in cellular networks",
abstract = "Opportunistic multicast schemes for time-sensitive stream traffic are studied for cellular networks where erasure coded packets are transmitted over discrete-time quasi-static forward-link fading channels. Assume that to successfully decode a transmitted stream fragment, it suffices that one receives k packets from the fragment. Two important issues are thus raised on when to stop transmitting a fragment and how to minimize the stopping time (ST) through transmission rate scheduling. Based on available channel state information and scheduled history, we tackle them particularly for small k required for short latency. If the distribution of IID channel states is available, the scheme is to compute and use the optimal constant transmission rate and minimum fixed ST subject to a reliability constraint. We show that the minimum ST grows with the logarithm of multicast group size. If channel state information is available, we propose to minimize random ST through selecting each optimal instantaneous transmission rate for a utility function. The utility function is specifically designed to exploit system transient states and dynamics. Results show that the scheme with an exponential weighted residual work achieves the least mean ST but the scheme maximizing instantaneous effective sum throughput has an edge of low complexity.",
keywords = "Opportunistic multicast, cellular networks, erasure code, stopping time, time-sensitive",
author = "Jung-Tsung Tsai",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/TWC.2014.030514.121555",
language = "English",
volume = "13",
pages = "1754--1765",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Transmission rate scheduling and stopping time for time-sensitive multicast stream traffic in cellular networks

AU - Tsai, Jung-Tsung

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Opportunistic multicast schemes for time-sensitive stream traffic are studied for cellular networks where erasure coded packets are transmitted over discrete-time quasi-static forward-link fading channels. Assume that to successfully decode a transmitted stream fragment, it suffices that one receives k packets from the fragment. Two important issues are thus raised on when to stop transmitting a fragment and how to minimize the stopping time (ST) through transmission rate scheduling. Based on available channel state information and scheduled history, we tackle them particularly for small k required for short latency. If the distribution of IID channel states is available, the scheme is to compute and use the optimal constant transmission rate and minimum fixed ST subject to a reliability constraint. We show that the minimum ST grows with the logarithm of multicast group size. If channel state information is available, we propose to minimize random ST through selecting each optimal instantaneous transmission rate for a utility function. The utility function is specifically designed to exploit system transient states and dynamics. Results show that the scheme with an exponential weighted residual work achieves the least mean ST but the scheme maximizing instantaneous effective sum throughput has an edge of low complexity.

AB - Opportunistic multicast schemes for time-sensitive stream traffic are studied for cellular networks where erasure coded packets are transmitted over discrete-time quasi-static forward-link fading channels. Assume that to successfully decode a transmitted stream fragment, it suffices that one receives k packets from the fragment. Two important issues are thus raised on when to stop transmitting a fragment and how to minimize the stopping time (ST) through transmission rate scheduling. Based on available channel state information and scheduled history, we tackle them particularly for small k required for short latency. If the distribution of IID channel states is available, the scheme is to compute and use the optimal constant transmission rate and minimum fixed ST subject to a reliability constraint. We show that the minimum ST grows with the logarithm of multicast group size. If channel state information is available, we propose to minimize random ST through selecting each optimal instantaneous transmission rate for a utility function. The utility function is specifically designed to exploit system transient states and dynamics. Results show that the scheme with an exponential weighted residual work achieves the least mean ST but the scheme maximizing instantaneous effective sum throughput has an edge of low complexity.

KW - Opportunistic multicast

KW - cellular networks

KW - erasure code

KW - stopping time

KW - time-sensitive

UR - http://www.scopus.com/inward/record.url?scp=84899986509&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84899986509&partnerID=8YFLogxK

U2 - 10.1109/TWC.2014.030514.121555

DO - 10.1109/TWC.2014.030514.121555

M3 - Article

AN - SCOPUS:84899986509

VL - 13

SP - 1754

EP - 1765

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 4

M1 - 6760607

ER -