Novel Bandwidth Scheduling Algorithm for DOCSIS 3.0 Based Multiple Upstream Channels 


Vol. 34,  No. 11, pp. 1142-1150, Nov.  2009


PDF
  Abstract

In this paper, we propose an novel bandwidth scheduling algorithm for the MAC protocol employed by the Data Over Cable Service Interface Specifications (DOCSIS) 3.0 compliant cable networks. The proposed algorithm statistically improves the chances of request piggybacking to minimize the access delay. It utilizes the piggyback request feature of the segment packets that has been newly specified in DCOSIS 3.0. In DOCSIS 3.0, a bandwidth request can be granted to several upstream channels within an upstream bonding group. The grant on each individual channel is treated as a segment packet. We find the optimal segment placement to minimize the access delay in the proposed algorithm. We also use a self-similar traffic model for simulation and analysis to evaluate the performance of the proposed algorithm.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Jung and J. Ahn, "Novel Bandwidth Scheduling Algorithm for DOCSIS 3.0 Based Multiple Upstream Channels," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 11, pp. 1142-1150, 2009. DOI: .

[ACM Style]

Joon-Young Jung and Jae-Min Ahn. 2009. Novel Bandwidth Scheduling Algorithm for DOCSIS 3.0 Based Multiple Upstream Channels. The Journal of Korean Institute of Communications and Information Sciences, 34, 11, (2009), 1142-1150. DOI: .

[KICS Style]

Joon-Young Jung and Jae-Min Ahn, "Novel Bandwidth Scheduling Algorithm for DOCSIS 3.0 Based Multiple Upstream Channels," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 11, pp. 1142-1150, 11. 2009.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880