Presentation 2002/9/13
A Request Cluster Allocation Scheme for DOCSIS CATV/HFC Netowrks
Tomoya SAITO, Kyoko KATO, Hiroshi INAI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) DOCSIS the de facto standard for data transmission on CATV/HFC networks, employs the binary back-off scheme for request cluster allocation at an upstream channel. This scheme normally allocates unnecessary large request clusters, so that delay increases under heavy load conditions. In this paper, we propose a request cluster scheme which dynamically changes the cluster size according to the load conditions. In order to evaluate performance of the proposed scheme, we build a queueing model and execute computer simulation. Simulation results shows that the proposed scheme provides smaller delay and higher effective request rate than the binary back-off scheme.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) CATV/HFC Networks / Random Reservation / Request Cluster Allocation Scheme
Paper # CQ2002-93
Date of Issue

Conference Information
Committee CQ
Conference Date 2002/9/13(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Communication Quality (CQ)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Request Cluster Allocation Scheme for DOCSIS CATV/HFC Netowrks
Sub Title (in English)
Keyword(1) CATV/HFC Networks
Keyword(2) Random Reservation
Keyword(3) Request Cluster Allocation Scheme
1st Author's Name Tomoya SAITO
1st Author's Affiliation Department. of Communication Engineering, Okayama Prefectural University()
2nd Author's Name Kyoko KATO
2nd Author's Affiliation Department. of Communication Engineering, Okayama Prefectural University
3rd Author's Name Hiroshi INAI
3rd Author's Affiliation Department. of Communication Engineering, Okayama Prefectural University
Date 2002/9/13
Paper # CQ2002-93
Volume (vol) vol.102
Number (no) 310
Page pp.pp.-
#Pages 6
Date of Issue