公开(公告)号：US07564790B2

公开(公告)日：2009-07-21

申请号：US11069738

申请日：2005-02-28

申请人： Barry S. Burns ,  Brian Hiltscher ,  Mohammed Ismael Tatar ,  Tim Webster

发明人： Barry S. Burns ,  Brian Hiltscher ,  Mohammed Ismael Tatar ,  Tim Webster

IPC分类号： G01R31/08

CPC分类号： H04L49/90 ,  H04L47/10 ,  H04L47/215 ,  H04L47/50 ,  H04L47/60 ,  H04L47/6215 ,  H04L49/9047

摘要： A method and system for shaping traffic in a multi-level queuing hierarchy are disclosed. The hierarchy includes a high priority channel and a low priority channel, wherein traffic on the low priority channel is fragmented and interleaved with traffic from the high priority channel and traffic combined from the high priority and low priority channels has a maximum shape rate. The method includes linking a high priority token bucket to a low priority token bucket, transmitting data from the high priority channel, and decrementing the low priority token bucket by an amount corresponding to the data transmitted. Data is transmitted from the low priority channel only if the low priority bucket has available tokens.

摘要翻译： 公开了一种用于整形多级排队层次中的业务的方法和系统。 该层级包括高优先级信道和低优先级信道，其中低优先级信道上的业务被分段并与来自高优先级信道的业务交织，并且从高优先级和低优先级信道组合的流量具有最大形状速率。 该方法包括将高优先级令牌桶与低优先级令牌桶相连，从高优先级信道发送数据，并将低优先级令牌桶减少与发送的数据相对应的量。 仅当低优先级桶具有可用令牌时才从低优先级信道发送数据。

公开(公告)号：US20060193256A1

公开(公告)日：2006-08-31

申请号：US11069738

申请日：2005-02-28

申请人： Barry Burns ,  Brian Hiltscher ,  Mohammed Tatar ,  Tim Webster

发明人： Barry Burns ,  Brian Hiltscher ,  Mohammed Tatar ,  Tim Webster

IPC分类号： G01R31/08

CPC分类号： H04L49/90 ,  H04L47/10 ,  H04L47/215 ,  H04L47/50 ,  H04L47/60 ,  H04L47/6215 ,  H04L49/9047

摘要： A method and system for shaping traffic in a multi-level queuing hierarchy are disclosed. The hierarchy includes a high priority channel and a low priority channel, wherein traffic on the low priority channel is fragmented and interleaved with traffic from the high priority channel and traffic combined from the high priority and low priority channels has a maximum shape rate. The method includes linking a high priority token bucket to a low priority token bucket, transmitting data from the high priority channel, and decrementing the low priority token bucket by an amount corresponding to the data transmitted. Data is transmitted from the low priority channel only if the low priority bucket has available tokens.