Scheduling Delay Minimization for Non-UGS Data in Multi-Channel HFC Network

Wei-Tsong LEE; Kuo-Chi CHU; Kun-Chen CHUNG; Jen-Yi PAN; Pau-Choo CHUNG

doi:10.1093/ietcom/e88-b.2.623

Scheduling Delay Minimization for Non-UGS Data in Multi-Channel HFC Network

Wei-Tsong LEE, Kuo-Chi CHU, Kun-Chen CHUNG, Jen-Yi PAN, Pau-Choo CHUNG

Full Text Views

0

Share
Cite this

Summary :

The multi-channel Hybrid Fiber Coaxial (HFC) network is essentially a shared medium with multi-channels. Its operation requires the use of a scheduling algorithm to manage the data transmission within each channel. The Data-Over-Cable Service Interface Specification (DOCSIS) protocol is an important standard for HFC networks. Since this protocol does not explicitly specify the scheduling algorithm to be used, many alternative algorithms have been proposed. However, none of these algorithms are applicable to the scheduling of non-Unsolicited Grant Service (UGS) data in multi-channel HFC networks. Accordingly, the present study develops a multi-channel scheduling algorithm which optimizes the scheduling delay time of each transmitted non-UGS request. This algorithm manages the amount of data transmission in each upstream channel according to the overall network load and the bandwidth available in each channel. This study constructs a mathematical model of the algorithm and then uses this model as the basis for a series of simulations in which the performance of the scheduling algorithm is evaluated.

Publication: IEICE TRANSACTIONS on Communications Vol.E88-B No.2 pp.623-631

Publication Date: 2005/02/01

Publicized

Online ISSN

DOI: 10.1093/ietcom/e88-b.2.623

Type of Manuscript: PAPER

Category: Fiber-Optic Transmission for Communications

Cite this

Copy

Wei-Tsong LEE, Kuo-Chi CHU, Kun-Chen CHUNG, Jen-Yi PAN, Pau-Choo CHUNG, "Scheduling Delay Minimization for Non-UGS Data in Multi-Channel HFC Network" in IEICE TRANSACTIONS on Communications, vol. E88-B, no. 2, pp. 623-631, February 2005, doi: 10.1093/ietcom/e88-b.2.623.
Abstract: The multi-channel Hybrid Fiber Coaxial (HFC) network is essentially a shared medium with multi-channels. Its operation requires the use of a scheduling algorithm to manage the data transmission within each channel. The Data-Over-Cable Service Interface Specification (DOCSIS) protocol is an important standard for HFC networks. Since this protocol does not explicitly specify the scheduling algorithm to be used, many alternative algorithms have been proposed. However, none of these algorithms are applicable to the scheduling of non-Unsolicited Grant Service (UGS) data in multi-channel HFC networks. Accordingly, the present study develops a multi-channel scheduling algorithm which optimizes the scheduling delay time of each transmitted non-UGS request. This algorithm manages the amount of data transmission in each upstream channel according to the overall network load and the bandwidth available in each channel. This study constructs a mathematical model of the algorithm and then uses this model as the basis for a series of simulations in which the performance of the scheduling algorithm is evaluated.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.2.623/_p

Copy

@ARTICLE{e88-b_2_623,
author={Wei-Tsong LEE, Kuo-Chi CHU, Kun-Chen CHUNG, Jen-Yi PAN, Pau-Choo CHUNG, },
journal={IEICE TRANSACTIONS on Communications},
title={Scheduling Delay Minimization for Non-UGS Data in Multi-Channel HFC Network},
year={2005},
volume={E88-B},
number={2},
pages={623-631},
abstract={The multi-channel Hybrid Fiber Coaxial (HFC) network is essentially a shared medium with multi-channels. Its operation requires the use of a scheduling algorithm to manage the data transmission within each channel. The Data-Over-Cable Service Interface Specification (DOCSIS) protocol is an important standard for HFC networks. Since this protocol does not explicitly specify the scheduling algorithm to be used, many alternative algorithms have been proposed. However, none of these algorithms are applicable to the scheduling of non-Unsolicited Grant Service (UGS) data in multi-channel HFC networks. Accordingly, the present study develops a multi-channel scheduling algorithm which optimizes the scheduling delay time of each transmitted non-UGS request. This algorithm manages the amount of data transmission in each upstream channel according to the overall network load and the bandwidth available in each channel. This study constructs a mathematical model of the algorithm and then uses this model as the basis for a series of simulations in which the performance of the scheduling algorithm is evaluated.},
keywords={},
doi={10.1093/ietcom/e88-b.2.623},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - Scheduling Delay Minimization for Non-UGS Data in Multi-Channel HFC Network
T2 - IEICE TRANSACTIONS on Communications
SP - 623
EP - 631
AU - Wei-Tsong LEE
AU - Kuo-Chi CHU
AU - Kun-Chen CHUNG
AU - Jen-Yi PAN
AU - Pau-Choo CHUNG
PY - 2005
DO - 10.1093/ietcom/e88-b.2.623
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2005
AB - The multi-channel Hybrid Fiber Coaxial (HFC) network is essentially a shared medium with multi-channels. Its operation requires the use of a scheduling algorithm to manage the data transmission within each channel. The Data-Over-Cable Service Interface Specification (DOCSIS) protocol is an important standard for HFC networks. Since this protocol does not explicitly specify the scheduling algorithm to be used, many alternative algorithms have been proposed. However, none of these algorithms are applicable to the scheduling of non-Unsolicited Grant Service (UGS) data in multi-channel HFC networks. Accordingly, the present study develops a multi-channel scheduling algorithm which optimizes the scheduling delay time of each transmitted non-UGS request. This algorithm manages the amount of data transmission in each upstream channel according to the overall network load and the bandwidth available in each channel. This study constructs a mathematical model of the algorithm and then uses this model as the basis for a series of simulations in which the performance of the scheduling algorithm is evaluated.
ER -