摘要
通过分析传统的通信量整形算法中由数据缓冲引入的延迟抖动问题,提出了一种基于抖动约束的通信量整形算法。在整形过程中,延迟是由数据缓冲的充满程度和令牌输出速率决定的。通过在线检测数据缓冲的充满程度和令牌的输出速率,计算出数据包的延迟和延迟抖动,然后根据延迟抖动约束动态调整整形器的参数,使数据分组在整形过程中经历的延迟抖动保持在约束范围之内。实验结果表明,该算法不仅可以平滑突发数据流,而且可以有效地降低由数据缓冲造成的延迟抖动。
A jitter-constrained traffic shaping algorithm was proposed by analyzing the delay jitter problem of traditional traffic shaping algorithm. In traffic shaping, the delay was determined by length of data buffer and the input rate of the token. This algorithm estimates and computes the delay and the delay jitter of traffic on-line by monitoring the variety of data buffer＇s length and the rate of token. It updates the parameters of traffic shaper depending on the delay jitter of traffic so as to provide lower jitter stream. The experiments show that the algorithm can smooth the traffic and lower the delay jitter arisen from traffic shaper.
出处
《计算机科学》
CSCD
北大核心
2009年第2期85-89,共5页
Computer Science
基金
国家“863”项目MSR城域网实用化项目(项目编号:2005AA121411)
新一代光纤通信技术和网络国家重点实验室的资助
关键词
延迟抖动
通信量整形
令牌桶
Delay jitter,Traffic shaping,Token bucket
