An opportunistic video scheduling algorithm over shared wireless downlink

Junhua Tang; Liren Zhang; Chee Kheong Siew

doi:10.1016/j.comcom.2005.10.021

An opportunistic video scheduling algorithm over shared wireless downlink

Junhua Tang
, Liren Zhang
, Chee Kheong Siew

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

This paper presents a novel video scheduling algorithm for streaming MPEG video over multi-user shared wireless link, in which video sessions are scheduled based on both location-dependent channel condition and instantaneous frame delay. This algorithm also employs a pro-active frame discard mechanism to discard potential problematic frames. The numerical results show that the proposed algorithm is able to significantly improve link throughput and guarantee long-term fairness.

Original language	English
Pages (from-to)	1917-1926
Number of pages	10
Journal	Computer Communications
Volume	29
Issue number	11
DOIs	https://doi.org/10.1016/j.comcom.2005.10.021
Publication status	Published - Jul 26 2006
Externally published	Yes

Keywords

Opportunistic scheduling
Video streaming
Wireless downlink

ASJC Scopus subject areas

Computer Networks and Communications

Access to Document

10.1016/j.comcom.2005.10.021

Cite this

@article{8a0d1e4937ec44f5a4b3c9ab9bce75d6,

title = "An opportunistic video scheduling algorithm over shared wireless downlink",

abstract = "This paper presents a novel video scheduling algorithm for streaming MPEG video over multi-user shared wireless link, in which video sessions are scheduled based on both location-dependent channel condition and instantaneous frame delay. This algorithm also employs a pro-active frame discard mechanism to discard potential problematic frames. The numerical results show that the proposed algorithm is able to significantly improve link throughput and guarantee long-term fairness.",

keywords = "Opportunistic scheduling, Video streaming, Wireless downlink",

author = "Junhua Tang and Liren Zhang and Siew, \{Chee Kheong\}",

year = "2006",

month = jul,

day = "26",

doi = "10.1016/j.comcom.2005.10.021",

language = "English",

volume = "29",

pages = "1917--1926",

journal = "Computer Communications",

issn = "0140-3664",

publisher = "Elsevier B.V.",

number = "11",

}

TY - JOUR

T1 - An opportunistic video scheduling algorithm over shared wireless downlink

AU - Tang, Junhua

AU - Zhang, Liren

AU - Siew, Chee Kheong

PY - 2006/7/26

Y1 - 2006/7/26

N2 - This paper presents a novel video scheduling algorithm for streaming MPEG video over multi-user shared wireless link, in which video sessions are scheduled based on both location-dependent channel condition and instantaneous frame delay. This algorithm also employs a pro-active frame discard mechanism to discard potential problematic frames. The numerical results show that the proposed algorithm is able to significantly improve link throughput and guarantee long-term fairness.

AB - This paper presents a novel video scheduling algorithm for streaming MPEG video over multi-user shared wireless link, in which video sessions are scheduled based on both location-dependent channel condition and instantaneous frame delay. This algorithm also employs a pro-active frame discard mechanism to discard potential problematic frames. The numerical results show that the proposed algorithm is able to significantly improve link throughput and guarantee long-term fairness.

KW - Opportunistic scheduling

KW - Video streaming

KW - Wireless downlink

UR - https://www.scopus.com/pages/publications/33745712122

UR - https://www.scopus.com/pages/publications/33745712122#tab=citedBy

U2 - 10.1016/j.comcom.2005.10.021

DO - 10.1016/j.comcom.2005.10.021

M3 - Article

AN - SCOPUS:33745712122

SN - 0140-3664

VL - 29

SP - 1917

EP - 1926

JO - Computer Communications

JF - Computer Communications

IS - 11

ER -

An opportunistic video scheduling algorithm over shared wireless downlink

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this