【摘要】 提出了一种改进的单速率三色标记算法.该算法用两个上三角矩阵表示标记器之间的令牌借用关系,在某一个标记器对应的数据流(或者聚合流)空闲时,能够把多余的令牌按照一定的概率借用给需要令牌的数据流;在某个数据流繁忙时,若发现自己目前的令牌不足,就向原来借用自己令牌的数据流索还一定的令牌.该算法能在区分服务环境下对确保传输的分组丢弃优先级进行标记.仿真结果表明,相对于原来的单速率三色标记算法,该算法能够提供较高的吞吐量.更多还原

【Abstract】 An improved SrTCM (single rate three color marker) algorithm in which the borrow relation between two upper triangle matrices’ markers is applied is proposed for marking packets in DiffServ network. When the data flow(or aggregated flows) of a corresponding marker is idle, it permits to lend it’s superfluous tokens to other busy flows according to certain probability. When the data flow is busy, if it found itself that the tokens are not enough, it can take back some of tokens that has been lent to the other flows before. This algorithm can be used to drop the priority of the mark to assure forwarding packets in DiffServ network. The simulation results indicate that the proposed algorithm provides higher throughput than the original SrTCM.更多还原