论文部分内容阅读
介绍了光弹性分组环(ORPR)节点模型,分析了ORPR网络中流量成型时光分组组装算法,提出一种适合ORPR网络的基于控制发送时间的光分组组装算法,给出了该算法的算法结构,并和传统的光分组组装算法做了比较。该算法通过分组发送间隔的调整,使得分组单位时间内的流量的自相似性被平滑,具有很好地抑制突发性的效果,同时,分组组装的时间门限可以被ORPR调度算法动态调整,可以适应缺乏缓存的ORPR网络的调度机制。
This paper introduces the node model of photoelastic packet ring (ORPR), analyzes the packet assembling algorithm of traffic shaping in ORPR network, proposes an optical packet assembly algorithm based on control sending time which is suitable for ORPR network, and presents the algorithm structure, And compared with the traditional optical packet assembly algorithm. The algorithm adjusts the interval of packet sending so that the self-similarity of traffic in packet per unit time is smoothed and has a good effect of suppressing the burst. Meanwhile, the time threshold of packet assembly can be dynamically adjusted by the ORPR scheduling algorithm. Scheduling mechanism to adapt to lack of cache ORPR network.