The Cache Based Bandwidth Request Mechanism on DOCSIS-Compliant HFC Networks

碩士 === 逢甲大學 === 資訊工程所 === 91 === With the growth of the Internet and the popularization of its applications, bandwidth demands from user are going more and more. Through evaluating these resolving plans and the current environment of Taiwan, we found that CATV network is a good resolving plan indeed...

Full description

Bibliographic Details
Main Authors: Ching-Lung Wu, 吳金龍
Other Authors: Wei-Tsong Lee
Format: Others
Language:zh-TW
Published: 2003
Online Access:http://ndltd.ncl.edu.tw/handle/9x9w4r
Description
Summary:碩士 === 逢甲大學 === 資訊工程所 === 91 === With the growth of the Internet and the popularization of its applications, bandwidth demands from user are going more and more. Through evaluating these resolving plans and the current environment of Taiwan, we found that CATV network is a good resolving plan indeed. DOCSIS is the most popular protocol in HFC architecture at present. HFC network can provide a great deal of bandwidth nowadays. However, its bandwidth request process is very inefficient and results in serious collisions. Lots of bandwidth will be wasted due to the collision and delay time as well as throughput becomes unacceptable. In order to increase throughput and reduce collisions, HFC network must provide an effective scheme to improve efficiency. We propose a novel Cache Based Bandwidth Request Mechanism in HFC network. Our mechanism can not only disperse crowded bandwidth request but also solves problem of collisions. Moreover we also compare different kinds of cache allocation rules in our mechanism. Finally we present a set of simulation scenarios which show the robustness and efficiency of our scheme in reducing collisions and delay time, and increasing bandwidth throughput. Furthermore, we also experiment on different cache allocation rules and cache spaces.