公开(公告)号：US08325721B2

公开(公告)日：2012-12-04

申请号：US12511558

申请日：2009-07-29

申请人： Jun Gong ,  Chong Zhan ,  Hongfei Chen ,  Rui Hu ,  Jian Zhang ,  Hunghsiang Jonathan Chao ,  Hao Su ,  Xiaozhong Wang ,  Tuanhui Sun

发明人： Jun Gong ,  Chong Zhan ,  Hongfei Chen ,  Rui Hu ,  Jian Zhang ,  Hunghsiang Jonathan Chao ,  Hao Su ,  Xiaozhong Wang ,  Tuanhui Sun

IPC分类号： H04L12/28 ,  H04L12/56

CPC分类号： G06F17/30628 ,  H04L45/00 ,  H04L45/54 ,  H04L45/745

摘要： A method for selecting a hash function, a method for storing and searching a routing table and devices thereof are provided. The method for selecting a hash function includes: hashing data to be hashed by using a current alternative hash function; decoding a hash result; accumulating decoded results until no carry occurs during the accumulation; and selecting a current alternative hash function with no carry generated as a formal hash function. The method for storing a routing table includes: dividing the routing table into a next-level node pointer portion and a prefix portion for being stored; and selecting a hash function by using the above method for selecting a hash function. The method for searching a routing table includes: directly searching an IP address to be searched according to a directly stored length of a next-level node pointer portion for storing the routing table; and reading a prefix node according to a searched result. Thus, hash collision can be avoided, and memory resources occupied by the routing table can be effectively reduced.

摘要翻译： 提供了一种用于选择散列函数的方法，用于存储和搜索路由表的方法及其装置。 用于选择散列函数的方法包括：通过使用当前替代散列函数来散列要散列的数据; 解码哈希结果; 累积解码结果，直到在累积期间不发生进位; 并且选择当前的替代散列函数，而不产生作为形式散列函数的进位。 存储路由表的方法包括：将路由表划分为下一级节点指针部分和用于存储的前缀部分; 以及通过使用上述用于选择散列函数的方法来选择散列函数。 搜索路由表的方法包括：根据用于存储路由表的下一级节点指针部分的直接存储长度直接搜索要搜索的IP地址; 并根据搜索结果读取前缀节点。 因此，可以避免哈希冲突，并且可以有效地减少路由表占用的存储器资源。

公开(公告)号：US20120314577A1

公开(公告)日：2012-12-13

申请号：US13589890

申请日：2012-08-20

申请人： Tuanhui Sun ,  Defeng Li ,  Hao Su ,  Aijuan Cao ,  Jian Song

发明人： Tuanhui Sun ,  Defeng Li ,  Hao Su ,  Aijuan Cao ,  Jian Song

IPC分类号： H04L12/56

CPC分类号： H04L47/12 ,  H04L47/26 ,  H04L49/3027 ,  H04L49/506 ,  H04L49/552

摘要： A method for implementing flow control in a switch fabric includes: sending, by each input port, request information to a destination output port where no packet congestion occurs; according to respective back pressure information, determining, by the destination output port which receives the request information, whether to return grant information to each input port to establish a matching relationship between each input port and the destination output port which returns the grant information; according to the matching relationship, scheduling, by each input port, a cell to a destination output port that is matched with each input port. Through the embodiments of the present invention, quantity of information transmitted between an input port and an output port is reduced, the design of the switch fabric is simplified, and data processing efficiency in the switch fabric is improved.

摘要翻译： 一种用于在交换结构中实现流控制的方法，包括：通过每个输入端口将请求信息发送到不发生分组拥塞的目的地输出端口; 根据相应的背压信息，通过接收请求信息的目的地输出端口确定是否向每个输入端口返回授权信息，以建立返回授权信息的每个输入端口和目的地输出端口之间的匹配关系; 根据匹配关系，通过每个输入端口将单元调度到与每个输入端口匹配的目的地输出端口。 通过本发明的实施例，减少了在输入端口和输出端口之间传输的信息量，简化了交换结构的设计，提高了交换结构的数据处理效率。

公开(公告)号：US08797860B2

公开(公告)日：2014-08-05

申请号：US13589890

申请日：2012-08-20

申请人： Tuanhui Sun ,  Defeng Li ,  Hao Su ,  Aijuan Cao ,  Jian Song

发明人： Tuanhui Sun ,  Defeng Li ,  Hao Su ,  Aijuan Cao ,  Jian Song

IPC分类号： H04L12/26 ,  H04L12/28 ,  H04L12/56

CPC分类号： H04L47/12 ,  H04L47/26 ,  H04L49/3027 ,  H04L49/506 ,  H04L49/552

摘要： A method for implementing flow control in a switch fabric includes: sending, by each input port, request information to a destination output port where no packet congestion occurs; according to respective back pressure information, determining, by the destination output port which receives the request information, whether to return grant information to each input port to establish a matching relationship between each input port and the destination output port which returns the grant information; according to the matching relationship, scheduling, by each input port, a cell to a destination output port that is matched with each input port. Through the embodiments of the present invention, quantity of information transmitted between an input port and an output port is reduced, the design of the switch fabric is simplified, and data processing efficiency in the switch fabric is improved.

摘要翻译： 一种用于在交换结构中实现流控制的方法，包括：通过每个输入端口将请求信息发送到不发生分组拥塞的目的地输出端口; 根据相应的背压信息，通过接收请求信息的目的地输出端口确定是否向每个输入端口返回授权信息，以建立返回授权信息的每个输入端口和目的地输出端口之间的匹配关系; 根据匹配关系，通过每个输入端口将单元调度到与每个输入端口匹配的目的地输出端口。 通过本发明的实施例，减少了在输入端口和输出端口之间传输的信息量，简化了交换结构的设计，提高了交换结构的数据处理效率。

公开(公告)号：US20100058027A1

公开(公告)日：2010-03-04

申请号：US12511558

申请日：2009-07-29

申请人： Jun Gong ,  Chong Zhan ,  Hongfei Chen ,  Rui Hu ,  Jian Zhang ,  Hunghsiang Jonathan Chao ,  Hao Su ,  Xiaozhong Wang ,  Tuanhui Sun

发明人： Jun Gong ,  Chong Zhan ,  Hongfei Chen ,  Rui Hu ,  Jian Zhang ,  Hunghsiang Jonathan Chao ,  Hao Su ,  Xiaozhong Wang ,  Tuanhui Sun

IPC分类号： G06F12/08

CPC分类号： G06F17/30628 ,  H04L45/00 ,  H04L45/54 ,  H04L45/745

摘要： A method for selecting a hash function, a method for storing and searching a routing table and devices thereof are provided. The method for selecting a hash function includes: hashing data to be hashed by using a current alternative hash function; decoding a hash result; accumulating decoded results until no carry occurs during the accumulation; and selecting a current alternative hash function with no carry generated as a formal hash function. The method for storing a routing table includes: dividing the routing table into a next-level node pointer portion and a prefix portion for being stored; and selecting a hash function by using the above method for selecting a hash function. The method for searching a routing table includes: directly searching an IP address to be searched according to a directly stored length of a next-level node pointer portion for storing the routing table; and reading a prefix node according to a searched result. Thus, hash collision can be avoided, and memory resources occupied by the routing table can be effectively reduced.

摘要翻译： 提供了一种用于选择散列函数的方法，用于存储和搜索路由表的方法及其装置。 用于选择散列函数的方法包括：通过使用当前替代散列函数来散列要散列的数据; 解码哈希结果; 累积解码结果，直到在累积期间不发生进位; 并且选择当前的替代散列函数，而不产生作为形式散列函数的进位。 存储路由表的方法包括：将路由表划分为下一级节点指针部分和用于存储的前缀部分; 以及通过使用上述用于选择散列函数的方法来选择散列函数。 搜索路由表的方法包括：根据用于存储路由表的下一级节点指针部分的直接存储长度直接搜索要搜索的IP地址; 并根据搜索结果读取前缀节点。 因此，可以避免哈希冲突，并且可以有效地减少路由表占用的存储器资源。