English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 51296/86402 (59%)
造訪人次 : 8166412      線上人數 : 82
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/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
    顯示於類別:[電機工程學系暨研究所] 期刊論文


    檔案 大小格式瀏覽次數



    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋