...
首页> 外文期刊>Journal of the Chinese Institute of Engineers. >A NOVEL REQUEST MINISLOT ALLOCATION MECHANISM BASED ON TEMPORAL LOCALITY PREDICTION FOR HFC NETWORKS
【24h】

A NOVEL REQUEST MINISLOT ALLOCATION MECHANISM BASED ON TEMPORAL LOCALITY PREDICTION FOR HFC NETWORKS

机译:基于临时位置预测的HFC网络的新请求微区分配机制

获取原文
获取原文并翻译 | 示例

摘要

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.
机译:混合光纤同轴(HFC)网络正在成为住宅网络的首选方法。但是,HFC网络是使用共享网络体系结构实现的,因此在上游通道中可能会发生冲突。在严重的情况下,这些信道冲突可能会导致网络性能显着降低。因此,本文提出了一种请求预测(RP)机制,该机制通过预测电缆调制解调器(CM)的未来传输行为并为那些被认为在不久的将来更可能传输数据的CM保留传输机会,从而减少了冲突数量。 。进行仿真以将RP机制的性能与其他请求小时隙分配方案的性能进行比较。仿真结果表明,与其他方案相比,RP机制的平均争用次数更少,平均数据延迟时间减少且传输成功率更高,并且通常比其他方案更有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号