A Novel Request Minislot Allocation Mechanism Based on Temporal Locality Prediction for HFC Networks

doi:10.1080/02533839.2009.9671567

淡江大學機構典藏 > 工學院 > 電機工程學系暨研究所 > 期刊論文 > Item 987654321/54997

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/54997

題名:	A Novel Request Minislot Allocation Mechanism Based on Temporal Locality Prediction for HFC Networks
作者:	Chu, Kuo-Chih;Lee, Wei-Tsong;Wu, Ching-Lung
貢獻者:	淡江大學電機工程學系
關鍵詞:	HFC networks;cable networks;DOCSIS protocol;request minislot allocation
日期:	2009-09
上傳時間:	2013-07-11 11:57:55 (UTC+8)
出版者:	Abingdon: Taylor & Francis Ltd.
摘要:	Hybrid Fiber Coaxial (HFC) networks are emerging as the method of choice for residential networks. However, HFC networks are implemented using a shared network architecture, and hence collisions may occur in the upstream channel. In severe cases, these channel collisions can result in a significant reduction in network performance. Accordingly, this paper presents a request prediction (RP) mechanism which reduces the number of collisions by predicting the future transmission behavior of the cable modems (CMs) and reserving transmission opportunities for those CMs which are judged more likely to transmit data in the near future. Simulations are conducted to compare the performance of the RP mechanism with that of other request minislot allocation schemes. The simulation results reveal that the RP mechanism results in a lower average number of contentions, a reduced average data delay time, and a higher transmission success rate than other schemes, and is, in general, more efficient than other schemes.
關聯:	Journal of the Chinese Institute of Engineers=中國工程學刊 32(6), pp.843-852
DOI:	10.1080/02533839.2009.9671567
顯示於類別:	[電機工程學系暨研究所] 期刊論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
index.html	0Kb	HTML	190	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章

資料載入中.....