公开(公告)号：US08477773B2

公开(公告)日：2013-07-02

申请号：US12446595

申请日：2007-11-02

Applicant: Mikael Sundström

Inventor： Mikael Sundström

IPC: H04L12/28

CPC classification number: H04L47/10 ,  H04L47/2441

Abstract: The present invention pertains to a method for performing specific data forwarding actions depending on the nature of data traffic comprising data packets, which method comprises the steps of: —receiving incoming data traffic of a specific nature, belonging to at least a specific class among a number of pre-defined classes, step 101—classifying the data traffic by determining the nature of the data traffic, step 102, provided by a process of inspecting values of one or more selected header field(s) of an address space of a data packet and selecting a first matching class from an ordered list of classes providing multi-dimensional classification, step 103.

Abstract translation: 本发明涉及一种用于根据包括数据分组的数据业务的性质来执行特定数据转发动作的方法，该方法包括以下步骤： - 接收属于至少一个特定类别的特定属性的传入数据业务， 预定义类的数量，步骤101-通过确定数据业务的性质来分类数据业务，步骤102，由检查数据的地址空间的一个或多个所选报头字段的值的过程提供 分组，并从提供多维分类的类的有序列表中选择第一匹配类，步骤103。

公开(公告)号：US20110113129A1

公开(公告)日：2011-05-12

申请号：US12446318

申请日：2007-10-19

Applicant: Mikael Sundstrom

Inventor： Mikael Sundstrom

IPC: G06F15/173

CPC classification number: H04L45/00 ,  H04L45/48 ,  H04L45/742

Abstract: The present invention relates to a method for routing in a data communications network, said method comprising the steps of: providing in a memory (102), a datagram forwarding data structure (10) provided for indicating where to forward a datagram in said network, which data structure (10) is in the form of a tree comprising at least one leaf (11) and possibly a number of nodes (13) including partial nodes, said data structure (10) having a height (h), corresponding to a number of memory accesses required for looking up a largest stored non-negative integer smaller than or equal to a query key, step 201, reducing worst storage cost by using a technique for reduction of worst case storage cost that are selectable from: partial block tree compaction, virtual blocks, bit push pulling, block aggregation or split block trees, and variations thereof, step 202, updating the layered data structure partially including by using a technique for scheduling maintenance work that are selectable from: vertical segmentation and bucket list maintenance, step 203.

Abstract translation: 本发明涉及一种在数据通信网络中路由的方法，所述方法包括以下步骤：在存储器（102）中提供数据报转发数据结构（10），用于指示在所述网络中转发数据报的位置， 所述数据结构（10）是包括至少一个叶片（11）和可能的包括部分节点的多个节点（13）的树形式，所述数据结构（10）具有高度（h），对应于 查找小于或等于查询密钥的最大存储非负整数所需的存储器访问次数，步骤201，通过使用用于减少最坏情况存储成本的技术降低最差存储成本，所述技术可从以下部分块树 压缩，虚拟块，位推拉，块聚合或分割块树及其变型，步骤202，通过使用用于调度维护工作的技术来部分地更新分层数据结构， ：垂直分割和桶列表维护，步骤203。

公开(公告)号：US20110044341A1

公开(公告)日：2011-02-24

申请号：US12989526

申请日：2009-03-25

Applicant: Mikael Sundstrom ,  Josefine Ahl

Inventor： Mikael Sundstrom ,  Josefine Ahl

IPC: H04L12/56

CPC classification number: H04L69/22

Abstract: The present invention pertains to a method for performing specific data forwarding actions depending on the nature of data traffic comprising data packets, which method comprises the steps of: —receiving incoming data traffic of a specific nature, belonging to at least a specific class among a number of pre-defined classes, step 201 —classifying the data traffic by determining the nature of the data traffic, provided by a process of inspecting values of a plurality of selected header field(s) of an address space of a data packet, said process providing an input key, step 202, and comprising the step of compressing the rules in the classifier to a list of compressed rules such that the number of bits involved in classification is reduced, step 203, further selecting a first matching class from an ordered list of n rules that identify each class, wherein each rule comprises D fields, step 204 and a preprocessing algorithm for building a decision tree based on the structure of the classifier, said preprocessing algorithm including cutting such that one cut in each dimension is performed, step 205.

Abstract translation: 本发明涉及一种用于根据包括数据分组的数据业务的性质来执行特定数据转发动作的方法，该方法包括以下步骤： - 接收属于至少一个特定类别的特定属性的传入数据业务， 预定义类的数量，步骤201-通过确定数据分组的地址空间的多个选定的报头字段的值的过程提供的确定数据业务的性质来分类数据业务，所述数据分组的地址空间的值 提供输入密钥的过程，步骤202，并且包括将分类器中的规则压缩到压缩规则列表的步骤，使得减少分类中涉及的位数，步骤203，进一步从有序的方式中选择第一匹配类 标识每个类的n个规则的列表，其中每个规则包括D个字段，步骤204和用于基于该cla的结构构建决策树的预处理算法 所述预处理算法包括切割，使得执行每个维度中的一个切割，步骤205。

公开(公告)号：US08472446B2

公开(公告)日：2013-06-25

申请号：US12989526

申请日：2009-05-25

Applicant: Mikael Sundstrom ,  Josefine Ahl

Inventor： Mikael Sundstrom ,  Josefine Ahl

IPC: H04L12/28 ,  H04L12/56

CPC classification number: H04L69/22

Abstract: The present invention pertains to a method for performing specific data forwarding actions depending on the nature of data traffic comprising data packets, which method comprises the steps of:—receiving incoming data traffic of a specific nature, belonging to at least a specific class among a number of pre-defined classes, step 201—classifying the data traffic by determining the nature of the data traffic, provided by a process of inspecting values of a plurality of selected header field(s) of an address space of a data packet, said process providing an input key, step 202, and comprising the step of compressing the rules in the classifier to a list of compressed rules such that the number of bits involved in classification is reduced, step 203, further selecting a first matching class from an ordered list of n rules that identify each class, wherein each rule comprises D fields, step 204 and a preprocessing algorithm for building a decision tree based on the structure of the classifier, said preprocessing algorithm including cutting such that one cut in each dimension is performed, step 205.

Abstract translation: 本发明涉及一种用于根据包括数据分组的数据业务的性质来执行特定数据转发动作的方法，该方法包括以下步骤： - 接收属于至少一个特定类别的特定属性的传入数据业务， 预定类别的数量，步骤201-通过确定数据分组的地址空间的多个选定的报头字段的值的过程提供的确定数据业务的性质对数据业务进行分类，所述数据分组的地址空间的值 提供输入密钥的过程，步骤202，并且包括将分类器中的规则压缩到压缩规则列表的步骤，使得减少分类中涉及的位数，步骤203，进一步从有序的方式中选择第一匹配类 标识每个类的n个规则的列表，其中每个规则包括D个字段，步骤204和用于基于分类的结构构建决策树的预处理算法 r，所述预处理算法包括切割，使得执行每个维度中的一个切割，步骤205。

公开(公告)号：US08401015B2

公开(公告)日：2013-03-19

申请号：US12446305

申请日：2007-10-19

Applicant: Mikael Sundström

Inventor： Mikael Sundström

IPC: H04L12/28

CPC classification number: H04L45/00 ,  H04L45/7457

Abstract: The present invention relates to a method for representing a partition of n w-bit intervals associated to d-bit data in a data communications network, said method comprising the steps of: providing in a memory (102), a datagram forwarding data structure (10) provided for indicating where to forward a datagram in said network, which data structure (10) is in the form of a tree comprising at least one leaf (11) and possibly a number of nodes (13) including partial nodes, said data structure (10) having a height (h), corresponding to a number of memory accesses required for looking up a largest stored non-negative integer smaller than or equal to a query key, step 201, reducing worst storage cost by using a technique for reduction of worst case storage cost that are selectable from: partial block tree compaction, virtual blocks, bit push pulling, block aggregation or split block trees, and variations thereof, step 202, updating the layered data structure partially including by using a technique for scheduling maintenance work that are selectable from: vertical segmentation and bucket list maintenance, and providing a hybrid structure by using a technique that are selectable from cluster monitoring, path compression, prefix pointer encoding to provide a static hybrid block tree, step 203.

Abstract translation: 本发明涉及一种用于表示数据通信网络中与d位数据相关联的n个w位间隔的分区的方法，所述方法包括以下步骤：在存储器（102）中提供数据报转发数据结构 10），用于指示在所述网络中转发数据报的位置，哪个数据结构（10）是包括至少一个叶（11）的树的形式，以及可能的包括部分节点的多个节点（13），所述数据 具有高度（h）的结构（10），对应于查询小于或等于查询键的最大存储非负整数所需的存储器访问次数，步骤201，通过使用技术来降低最差存储成本 减少可以从部分块树压缩，虚拟块，位推拉，块聚合或分割块树中选择的最坏情况存储成本及其变化，步骤202，通过使用tec来部分地包括更新分层数据结构 可以从垂直分割和桶列表维护中选择调度维护工作，并且通过使用可从集群监视，路径压缩，前缀指针编码提供静态混合块树的技术提供混合结构，步骤203。

公开(公告)号：US08347054B2

公开(公告)日：2013-01-01

申请号：US12746087

申请日：2008-12-02

Applicant: Mikael Sundström

Inventor： Mikael Sundström

IPC: G06F12/00

CPC classification number: G06F12/023 ,  G06F3/061 ,  G06F3/0638 ,  G06F3/0673

Abstract: A method for memory management in a mass storage device, comprising the steps of providing a managed memory area (stockling) of s blocks that can be moved and stored in two parts to prevent fragmentation; repeatedly moving each of stockpiles 1,2, . . . , i-1 one block to the right until all stockpiles to the right of stockpile i have moved si blocks, or the left part of the rightmost stockling to the end of the free area (without changing the order between the blocks); returning the contiguous si blocks area beginning where the rightmost stockling began before its leftmost part was moved; locating the rightmost stockling that is stored in one piece (it is either the rightmost stockling itself or the stockling to the left of the rightmost stockling) and moving it to the location of the stockling to be deallocated, and reversing the allocation procedure.

Abstract translation: 一种用于大容量存储设备中的存储器管理的方法，包括以下步骤：提供可以被移动和存储的两个部分的s块的托管存储区域（堆栈），以防止碎片化; 反复移动每个库存1,2。 。 。 ，i-1向右一个方向，直到库存右边的所有库存都移动了si块，或者将最右边的库存的左边部分移动到自由区域的末端（而不改变块之间的顺序）; 返回在最左侧部分移动之前开始的最右侧的开始的连续的si块区域; 将存储在一块中的最右侧的堆放物（它是最右侧的饲料本身或最右侧饲料的左侧的饲料），并将其移动到待分配的饲养场所，并扭转分配过程。

公开(公告)号：US08924623B2

公开(公告)日：2014-12-30

申请号：US13387374

申请日：2010-07-28

Applicant: Mikael Sundström

Inventor： Mikael Sundström

IPC: G06F12/02 ,  G06F12/06

CPC classification number: G06F12/0223 ,  G06F12/023 ,  G06F12/04 ,  G06F12/06 ,  G06F2212/1044

Abstract: A method for managing multi-layered data structures in a pipelined memory architecture, comprising the steps of: —providing a multi-level data structure where each level corresponds to a memory access; —storing each level in a separate memory block with respect to the other levels. In this way, a more efficient usage of memory is achieved.

Abstract translation: 一种用于在流水线存储器架构中管理多层数据结构的方法，包括以下步骤： - 提供多级数据结构，其中每个级别对应于存储器访问; - 在相对于其他级别的单独的存储块中存储每个级别。 以这种方式，实现了更有效地使用存储器。

公开(公告)号：US08364803B2

公开(公告)日：2013-01-29

申请号：US12446318

申请日：2007-10-19

Applicant: Mikael Sundström

Inventor： Mikael Sundström

IPC: G06F15/173

CPC classification number: H04L45/00 ,  H04L45/48 ,  H04L45/742

Abstract: The present invention relates to a method for routing in a data communications network, said method comprising the steps of: providing in a memory (102), a datagram forwarding data structure (10) provided for indicating where to forward a datagram in said network, which data structure (10) is in the form of a tree comprising at least one leaf (11) and possibly a number of nodes (13) including partial nodes, said data structure (10) having a height (h), corresponding to a number of memory accesses required for looking up a largest stored non-negative integer smaller than or equal to a query key, step 201, reducing worst storage cost by using a technique for reduction of worst case storage cost that are selectable from: partial block tree compaction, virtual blocks, bit push pulling, block aggregation or split block trees, and variations thereof, step 202, updating the layered data structure partially including by using a technique for scheduling maintenance work that are selectable from: vertical segmentation and bucket list maintenance, step 203.

Abstract translation: 本发明涉及一种在数据通信网络中路由的方法，所述方法包括以下步骤：在存储器（102）中提供数据报转发数据结构（10），用于指示在所述网络中转发数据报的位置， 所述数据结构（10）是包括至少一个叶片（11）和可能的包括部分节点的多个节点（13）的树形式，所述数据结构（10）具有高度（h），对应于 查找小于或等于查询密钥的最大存储非负整数所需的存储器访问次数，步骤201，通过使用用于减少最坏情况存储成本的技术降低最差存储成本，所述技术可从以下部分块树 压缩，虚拟块，位推拉，块聚合或分割块树及其变型，步骤202，通过使用用于调度维护工作的技术来部分地更新分层数据结构， ：垂直分割和桶列表维护，步骤203。

公开(公告)号：US20100238922A1

公开(公告)日：2010-09-23

申请号：US12446595

申请日：2007-11-02

Applicant: Mikael Sundström

Inventor： Mikael Sundström

IPC: H04L12/56

CPC classification number: H04L47/10 ,  H04L47/2441

Abstract: The present invention pertains to a method for performing specific data forwarding actions depending on the nature of data traffic comprising data packets, which method comprises the steps of: —receiving incoming data traffic of a specific nature, belonging to at least a specific class among a number of pre-defined classes, step 101-classifying the data traffic by determining the nature of the data traffic, step 102, provided by a process of inspecting values of one or more selected header field(s) of an address space of a data packet and selecting a first matching class from an ordered list of classes providing multi-dimensional classification, step 103.

Abstract translation: 本发明涉及一种用于根据包括数据分组的数据业务的性质来执行特定数据转发动作的方法，该方法包括以下步骤： - 接收属于至少一个特定类别的特定属性的传入数据业务， 预定义类的数量，步骤101-通过确定数据业务的性质来分类数据业务，步骤102，由检查数据的地址空间的一个或多个所选报头字段的值的过程提供 分组，并从提供多维分类的类的有序列表中选择第一匹配类，步骤103。