专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2005013532A2 APPARATUS AND METHOD FOR CLASSIFIER IDENTIFICATION 审中-公开
标题翻译：用于分类器识别的装置和方法
公开(公告)号：WO2005013532A2
公开(公告)日：2005-02-10
申请号：PCT/US2004/023370
申请日：2004-07-22
申请人： SANDBURST CORPORATION , HORGAN, Nick
发明人： HORGAN, Nick
IPC分类号： H04L
CPC分类号： H04L47/10 , H04L47/2441 , H04L69/16 , H04L69/161 , H04L69/22
摘要： A method for classifying an incoming packet. The method includes maintaining a database associated with patterns of fields, where the fields can be network addresses. The database can be developed by mapping each pattern to a unique numeric identifier. The number of unique numeric identifiers is equal to the number of patterns, and the size of each unique numeric identifier is substantially smaller than the field of each pattern. The database can be further developed by determining a range of one or more of the unique numeric identifiers to be associated with each pattern. The range for each pattern can be bounded by a minimum unique numeric identifier and a maximum unique numeric identifier. The method also includes using a field of the incoming packet to determine an associated identifier for that field, where the associated identifier is equal to one of the unique numeric identifiers. The associated identifier can then be matched with one or more of the ranges for the patterns, and the method can then determine how to process the incoming packet.
摘要翻译：一种用于分类传入分组的方法。该方法包括维护与字段模式相关联的数据库，其中字段可以是网络地址。可以通过将每个模式映射到唯一的数字标识符来开发数据库。唯一数字标识符的数量等于模式的数量，并且每个唯一的数字标识符的大小显着小于每个模式的字段。可以通过确定与每个模式相关联的一个或多个唯一数字标识符的范围来进一步开发数据库。每个模式的范围可以由最小唯一数字标识符和最大唯一数字标识符来界定。该方法还包括使用输入分组的字段来确定该字段的相关联的标识符，其中相关联的标识符等于唯一数字标识符之一。然后可以将相关联的标识符与模式的一个或多个范围匹配，然后该方法可以确定如何处理传入的分组。

2. 发明申请

US20040090974A1 Method and apparatus for bandwidth guarantee and overload protection in a network switch 有权
标题翻译：网络交换机带宽保障和过载保护的方法和装置
公开(公告)号：US20040090974A1
公开(公告)日：2004-05-13
申请号：US10639269
申请日：2003-08-12
申请人： Sandburst Corporation
发明人： Hari Balakrishnan , Srinivas Devadas , Arvind Mithal
IPC分类号： H04L012/28
CPC分类号： H04L47/10 , H04L47/24 , H04L47/39 , H04L47/50 , H04L47/52 , H04L47/6215 , H04L47/6255 , H04L49/101 , H04L49/254 , H04L49/30 , H04L49/3045
摘要： A method for selecting a queue for service across a shared link. The method includes classifying each queue from a group of queues within a plurality of ingresses into one tier of a number nullNnull of tiers. The number nullNnull is greater than or equal to 2. Information about allocated bandwidth is used to classify at least some of the queues into the tiers. Each tier is assigned a different priority. The method also includes matching queues to available egresses by matching queues classified within tiers with higher priorities before matching queues classified within tiers with lower priorities.
摘要翻译：一种用于通过共享链路选择服务队列的方法。该方法包括将来自多个入口内的一组队列中的每个队列分成层数“N”的一层。数字“N”大于或等于2.关于分配的带宽的信息用于将至少一些队列分类到层级中。每个层都有不同的优先级。该方法还包括通过匹配在具有较低优先级的层级中分类的队列之前匹配在具有较高优先级的层级中分类的队列来匹配队列到可用出口。

3. 发明申请

WO2005019975A2 METHOD AND APPARATUS FOR BANDWIDTH GUARANTEE AND OVERLOAD PROTECTION IN A NETWORK SWITCH 审中-公开
标题翻译：网络切换中的带宽保护和过载保护的方法和装置
公开(公告)号：WO2005019975A2
公开(公告)日：2005-03-03
申请号：PCT/US2004/023758
申请日：2004-07-22
申请人： SANDBURST CORPORATION , BALAKRISHNAN, Hari , DEVADAS, Srinivas , MITHAL, Arvand
发明人： BALAKRISHNAN, Hari , DEVADAS, Srinivas , MITHAL, Arvand
IPC分类号： G06F
CPC分类号： H04L47/10 , H04L47/24 , H04L47/39 , H04L47/50 , H04L47/52 , H04L47/6215 , H04L47/6255 , H04L49/101 , H04L49/254 , H04L49/30 , H04L49/3045
摘要： A method for selecting a queue for service across a shared link. The method includes classifying each queue from a group of queues within a plurality of ingresses into one tier of a number "N" of tiers. The number "N" is greater than or equal to 2. Information about allocated bandwidth is used to classify at least some of the queues into the tiers. Each tier is assigned a different priority. The method also includes matching queues to available egresses by matching queues classified within tiers with higher priorities before matching queues classified within tiers with lower priorities.
摘要翻译：一种用于通过共享链路选择服务的队列的方法。该方法包括将来自多个入口内的一组队列中的每个队列分成层数“N”的一个层级。数字“N”大于或等于2.关于分配的带宽的信息用于将至少一些队列分类到层级中。每个层都有不同的优先级。该方法还包括通过匹配在具有较低优先级的层级中分类的队列之前匹配在具有较高优先级的层级中分类的队列来匹配队列到可用出口。

4. 发明申请

WO2003005227A1 METHOD AND APPARATUS FOR ALLOCATING LINK BANDWIDTH 审中-公开
标题翻译：用于分配链路带宽的方法和装置
公开(公告)号：WO2003005227A1
公开(公告)日：2003-01-16
申请号：PCT/US2001/021185
申请日：2001-07-05
申请人： SANDBURST CORPORATION , DEVADAS, Srinivas , BALAKRISHNAN, Hari , ROSENBAND, Daniel, L.
发明人： DEVADAS, Srinivas , BALAKRISHNAN, Hari , ROSENBAND, Daniel, L.
IPC分类号： G06F17/00
CPC分类号： H04L47/10 , H04L47/2433 , H04L47/2458 , H04L47/30 , H04L47/39 , H04L47/50 , H04L47/521 , H04L47/6215 , H04L49/30 , H04L49/90 , Y10S707/99942
摘要： A method and apparatus for selecting a queue for service across a shared link. The method includes determining a priority for each queue (202) within a plurality of ingresses (102), wherein the priority is instantaneous for a given timeslot for data transfer, selecting a queue having a first priority for each group of queues within each ingress (104) having packets destined for a particular egress (104), selecting a queue having a second priority for each subset of queues having first priorities and having packets destined for the particular egress (104), and selecting the queue having the second priority for service across the shared link in the given timeslot.
摘要翻译：一种用于通过共享链路选择用于服务的队列的方法和装置。该方法包括确定多个入口（102）内的每个队列（202）的优先级，其中优先级对于给定的时隙用于数据传输是瞬时的，为每个入口内的每组队列选择具有第一优先级的队列（ 104），其具有去往特定出口（104）的分组，为具有第一优先级的队列的每个子集选择具有第二优先级的队列并且具有去往特定出口（104）的分组，以及选择具有第二优先级的服务的队列跨越给定时间段的共享链路。

5. 发明公开

EP1402396A1 METHOD AND APPARATUS FOR ALLOCATING LINK BANDWIDTH 审中-公开
标题翻译：方法和设备中的路由带宽ALLOCATE
公开(公告)号：EP1402396A1
公开(公告)日：2004-03-31
申请号：EP01274353.0
申请日：2001-07-05
申请人： Sandburst Corporation
发明人： DEVADAS, Srinivas , BALAKRISHNAN, Hari , ROSENBAND, Daniel L.
IPC分类号： G06F17/00
CPC分类号： H04L47/10 , H04L47/2433 , H04L47/2458 , H04L47/30 , H04L47/39 , H04L47/50 , H04L47/521 , H04L47/6215 , H04L49/30 , H04L49/90 , Y10S707/99942
摘要： A method and apparatus for selecting a queue for service across a shared link. The method includes determining a priority for each queue (202) within a plurality of ingresses (102), wherein the priority is instantaneous for a given timeslot for data transfer, selecting a queue having a first priority for each group of queues within each ingress (104) having packets destined for a particular egress (104), selecting a queue having a second priority for each subset of queues having first priorities and having packets destined for the particular egress (104), and selecting the queue having the second priority for service across the shared link in the given timeslot.

6. 发明公开

EP1656758A2 APPARATUS AND METHOD FOR CLASSIFIER IDENTIFICATION 审中-公开
标题翻译：用于分类器识别的装置和方法
公开(公告)号：EP1656758A2
公开(公告)日：2006-05-17
申请号：EP04778741.1
申请日：2004-07-22
申请人： Sandburst Corporation
发明人： HORGAN, Nick
IPC分类号： H04L1/00
CPC分类号： H04L47/10 , H04L47/2441 , H04L69/16 , H04L69/161 , H04L69/22
摘要： A method for classifying an incoming packet. The method includes maintaining a database associated with patterns of fields, where the fields can be network addresses. The database can be developed by mapping each pattern to a unique numeric identifier. The number of unique numeric identifiers is equal to the number of patterns, and the size of each unique numeric identifier is substantially smaller than the field of each pattern. The database can be further developed by determining a range of one or more of the unique numeric identifiers to be associated with each pattern. The range for each pattern can be bounded by a minimum unique numeric identifier and a maximum unique numeric identifier. The method also includes using a field of the incoming packet to determine an associated identifier for that field, where the associated identifier is equal to one of the unique numeric identifiers. The associated identifier can then be matched with one or more of the ranges for the patterns, and the method can then determine how to process the incoming packet.
摘要翻译：分类传入数据包的方法。该方法包括维护与字段模式相关联的数据库，其中字段可以是网络地址。可以通过将每个模式映射到唯一的数字标识符来开发数据库。唯一数字标识符的数量等于模式的数量，并且每个唯一数字标识符的大小远小于每个模式的字段。可以通过确定与每个模式相关联的一个或多个唯一数字标识符的范围来进一步开发数据库。每个模式的范围可以由最小唯一数字标识符和最大唯一数字标识符限定。该方法还包括使用输入分组的字段来确定该字段的关联标识符，其中关联标识符等于唯一数字标识符中的一个。然后可以将关联的标识符与模式的一个或多个范围进行匹配，然后该方法可以确定如何处理进入的分组。

7. 发明公开

EP1654616A2 METHOD AND APPARATUS FOR BANDWIDTH GUARANTEE AND OVERLOAD PROTECTION IN A NETWORK SWITCH 审中-公开
标题翻译：方法和设备的带宽保证和过载保护在网络交换机
公开(公告)号：EP1654616A2
公开(公告)日：2006-05-10
申请号：EP04779015.9
申请日：2004-07-22
申请人： Sandburst Corporation
发明人： BALAKRISHNAN, Hari , DEVADAS, Srinivas , MITHAL, Arvand
IPC分类号： G06F1/00
CPC分类号： H04L47/10 , H04L47/24 , H04L47/39 , H04L47/50 , H04L47/52 , H04L47/6215 , H04L47/6255 , H04L49/101 , H04L49/254 , H04L49/30 , H04L49/3045
摘要： A method for selecting a queue for service across a shared link. The method includes classifying each queue from a group of queues within a plurality of ingresses into one tier of a number 'N' of tiers. The number 'N' is greater than or equal to 2. Information about allocated bandwidth is used to classify at least some of the queues into the tiers. Each tier is assigned a different priority. The method also includes matching queues to available egresses by matching queues classified within tiers with higher priorities before matching queues classified within tiers with lower priorities.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式