Profit-based on-demand broadcast scheduling of real-time multi-item requests

Jingsong Lv; Victor Lee; Minming Li; Enhong Chen

doi:10.1145/1774088.1774208

Profit-based on-demand broadcast scheduling of real-time multi-item requests

Jingsong Lv^*
, Victor Lee
, Minming Li
, Enhong Chen

^*Corresponding author for this work

University of Science and Technology of China
City University of Hong Kong

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Abstract

On-demand broadcast is a widely accepted approach for dynamic and scalable wireless information dissemination systems. With the proliferation of real-time applications, minimizing the deadline miss ratio in scheduling multi-item requests becomes an emergent task in the current architecture. In this paper, we propose a profit-based scheduling algorithm, called PVC, which utilizes two new concepts "profit" of a data item and "opportunity cost" of a request. Note that, to the best of our knowledge, it is also the first time to introduce opportunity cost, which is derived from economics, into on-demand scheduling. Finally, the simulation results show the great improvement in comparison with traditional algorithms. On average, PVC has more than 5% advantage in terms of deadline miss ratio than the best of others.

Original language	English
Title of host publication	APPLIED COMPUTING 2010 - The 25th Annual ACM Symposium on Applied Computing
Pages	580-584
Number of pages	5
DOIs	https://doi.org/10.1145/1774088.1774208
State	Published - 2010
Externally published	Yes
Event	25th Annual ACM Symposium on Applied Computing, SAC 2010 - Sierre, Switzerland Duration: 22 Mar 2010 → 26 Mar 2010

Publication series

Name	Proceedings of the ACM Symposium on Applied Computing

Conference

Conference	25th Annual ACM Symposium on Applied Computing, SAC 2010
Country/Territory	Switzerland
City	Sierre
Period	22/03/10 → 26/03/10

Keywords

data dissemination
multi-item requests
on-demand broadcast
opportunity cost
real-time data scheduling

Access to Document

10.1145/1774088.1774208

Cite this

@inproceedings{c6e193d55f0744b6b7d5bbd60c9b53bc,

title = "Profit-based on-demand broadcast scheduling of real-time multi-item requests",

abstract = "On-demand broadcast is a widely accepted approach for dynamic and scalable wireless information dissemination systems. With the proliferation of real-time applications, minimizing the deadline miss ratio in scheduling multi-item requests becomes an emergent task in the current architecture. In this paper, we propose a profit-based scheduling algorithm, called PVC, which utilizes two new concepts {"}profit{"} of a data item and {"}opportunity cost{"} of a request. Note that, to the best of our knowledge, it is also the first time to introduce opportunity cost, which is derived from economics, into on-demand scheduling. Finally, the simulation results show the great improvement in comparison with traditional algorithms. On average, PVC has more than 5\% advantage in terms of deadline miss ratio than the best of others.",

keywords = "data dissemination, multi-item requests, on-demand broadcast, opportunity cost, real-time data scheduling",

author = "Jingsong Lv and Victor Lee and Minming Li and Enhong Chen",

year = "2010",

doi = "10.1145/1774088.1774208",

language = "英语",

isbn = "9781605586380",

series = "Proceedings of the ACM Symposium on Applied Computing",

pages = "580--584",

booktitle = "APPLIED COMPUTING 2010 - The 25th Annual ACM Symposium on Applied Computing",

note = "25th Annual ACM Symposium on Applied Computing, SAC 2010 ; Conference date: 22-03-2010 Through 26-03-2010",

}

Lv, J, Lee, V, Li, M & Chen, E 2010, Profit-based on-demand broadcast scheduling of real-time multi-item requests. in APPLIED COMPUTING 2010 - The 25th Annual ACM Symposium on Applied Computing. Proceedings of the ACM Symposium on Applied Computing, pp. 580-584, 25th Annual ACM Symposium on Applied Computing, SAC 2010, Sierre, Switzerland, 22/03/10. https://doi.org/10.1145/1774088.1774208

Profit-based on-demand broadcast scheduling of real-time multi-item requests. / Lv, Jingsong; Lee, Victor; Li, Minming et al.
APPLIED COMPUTING 2010 - The 25th Annual ACM Symposium on Applied Computing. 2010. p. 580-584 (Proceedings of the ACM Symposium on Applied Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Profit-based on-demand broadcast scheduling of real-time multi-item requests

AU - Lv, Jingsong

AU - Lee, Victor

AU - Li, Minming

AU - Chen, Enhong

PY - 2010

Y1 - 2010

N2 - On-demand broadcast is a widely accepted approach for dynamic and scalable wireless information dissemination systems. With the proliferation of real-time applications, minimizing the deadline miss ratio in scheduling multi-item requests becomes an emergent task in the current architecture. In this paper, we propose a profit-based scheduling algorithm, called PVC, which utilizes two new concepts "profit" of a data item and "opportunity cost" of a request. Note that, to the best of our knowledge, it is also the first time to introduce opportunity cost, which is derived from economics, into on-demand scheduling. Finally, the simulation results show the great improvement in comparison with traditional algorithms. On average, PVC has more than 5% advantage in terms of deadline miss ratio than the best of others.

AB - On-demand broadcast is a widely accepted approach for dynamic and scalable wireless information dissemination systems. With the proliferation of real-time applications, minimizing the deadline miss ratio in scheduling multi-item requests becomes an emergent task in the current architecture. In this paper, we propose a profit-based scheduling algorithm, called PVC, which utilizes two new concepts "profit" of a data item and "opportunity cost" of a request. Note that, to the best of our knowledge, it is also the first time to introduce opportunity cost, which is derived from economics, into on-demand scheduling. Finally, the simulation results show the great improvement in comparison with traditional algorithms. On average, PVC has more than 5% advantage in terms of deadline miss ratio than the best of others.

KW - data dissemination

KW - multi-item requests

KW - on-demand broadcast

KW - opportunity cost

KW - real-time data scheduling

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

U2 - 10.1145/1774088.1774208

DO - 10.1145/1774088.1774208

M3 - 会议稿件

AN - SCOPUS:77954735310

SN - 9781605586380

T3 - Proceedings of the ACM Symposium on Applied Computing

SP - 580

EP - 584

BT - APPLIED COMPUTING 2010 - The 25th Annual ACM Symposium on Applied Computing

T2 - 25th Annual ACM Symposium on Applied Computing, SAC 2010

Y2 - 22 March 2010 through 26 March 2010

ER -

Profit-based on-demand broadcast scheduling of real-time multi-item requests

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this