Design of Broadcast Delivery Schedules for Multiple Channels

Yiu-Wing LEUNG

Design of Broadcast Delivery Schedules for Multiple Channels

Yiu-Wing LEUNG

Full Text Views

0

Cite this

Summary :

Datacycle is an information delivery system designed in Bellcore . It uses broadcast delivery and multiple channels of an optical fiber to provide a large volume of information to many users. In this system, the mean access time depends on the broadcast delivery schedule because different information items (called pages) may have different popularity and there are multiple channels for concurrent broadcast delivery. In this paper, we design broadcast delivery schedules for M channels where M 2 and our objective is to minimize the mean access time. We show that this design problem can be divided into two subproblems: (1) divide the pages into M partitions such that the pages of each partition are broadcast in a distinct channel and (2) determine a broadcast schedule for the pages of each partition. We analyze and solve these subproblems, and we demonstrate that the schedules found can nearly reach a lower bound on the minimal mean access time.

Publication: IEICE TRANSACTIONS on Communications Vol.E86-B No.4 pp.1391-1398

Publication Date: 2003/04/01

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Broadcast Systems

Cite this

Copy

Yiu-Wing LEUNG, "Design of Broadcast Delivery Schedules for Multiple Channels" in IEICE TRANSACTIONS on Communications, vol. E86-B, no. 4, pp. 1391-1398, April 2003, doi: .
Abstract: Datacycle is an information delivery system designed in Bellcore . It uses broadcast delivery and multiple channels of an optical fiber to provide a large volume of information to many users. In this system, the mean access time depends on the broadcast delivery schedule because different information items (called pages) may have different popularity and there are multiple channels for concurrent broadcast delivery. In this paper, we design broadcast delivery schedules for M channels where M 2 and our objective is to minimize the mean access time. We show that this design problem can be divided into two subproblems: (1) divide the pages into M partitions such that the pages of each partition are broadcast in a distinct channel and (2) determine a broadcast schedule for the pages of each partition. We analyze and solve these subproblems, and we demonstrate that the schedules found can nearly reach a lower bound on the minimal mean access time.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e86-b_4_1391/_p

Copy

@ARTICLE{e86-b_4_1391,
author={Yiu-Wing LEUNG, },
journal={IEICE TRANSACTIONS on Communications},
title={Design of Broadcast Delivery Schedules for Multiple Channels},
year={2003},
volume={E86-B},
number={4},
pages={1391-1398},
abstract={Datacycle is an information delivery system designed in Bellcore . It uses broadcast delivery and multiple channels of an optical fiber to provide a large volume of information to many users. In this system, the mean access time depends on the broadcast delivery schedule because different information items (called pages) may have different popularity and there are multiple channels for concurrent broadcast delivery. In this paper, we design broadcast delivery schedules for M channels where M 2 and our objective is to minimize the mean access time. We show that this design problem can be divided into two subproblems: (1) divide the pages into M partitions such that the pages of each partition are broadcast in a distinct channel and (2) determine a broadcast schedule for the pages of each partition. We analyze and solve these subproblems, and we demonstrate that the schedules found can nearly reach a lower bound on the minimal mean access time.},
keywords={},
doi={},
ISSN={},
month={April},}

Copy

TY - JOUR
TI - Design of Broadcast Delivery Schedules for Multiple Channels
T2 - IEICE TRANSACTIONS on Communications
SP - 1391
EP - 1398
AU - Yiu-Wing LEUNG
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E86-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2003
AB - Datacycle is an information delivery system designed in Bellcore . It uses broadcast delivery and multiple channels of an optical fiber to provide a large volume of information to many users. In this system, the mean access time depends on the broadcast delivery schedule because different information items (called pages) may have different popularity and there are multiple channels for concurrent broadcast delivery. In this paper, we design broadcast delivery schedules for M channels where M 2 and our objective is to minimize the mean access time. We show that this design problem can be divided into two subproblems: (1) divide the pages into M partitions such that the pages of each partition are broadcast in a distinct channel and (2) determine a broadcast schedule for the pages of each partition. We analyze and solve these subproblems, and we demonstrate that the schedules found can nearly reach a lower bound on the minimal mean access time.
ER -