SYSTEMS AND METHODS FOR DETERMINING A GOOD RSS KEY
First Claim
Patent Images
1. A method for identifying a random key to use in a distribution of packet flows among a plurality of cores in a multi-core system, the method comprising:
- receiving, by a flow distributor executing on a multi-core system, a first random number key for a hash function;
creating, by the flow distributor, a first n-rowed matrix from the first random number key, a first row of the first matrix comprising m-bits of the first random number key starting from a first position, and each successive row comprising m-bits of the first random number key starting from a position shifted from a previous position by a predetermined value;
identifying, by the flow distributor, a rank of the first matrix;
determining, by the flow distributor, that the rank of the first matrix is less than the number n of rows of the first matrix; and
requesting, by the flow distributor and responsive to the determination, a second random number key for the hash function.
8 Assignments
0 Petitions
Accused Products
Abstract
The present application is directed towards systems and methods for ensuring equal distribution of packet flows among a plurality of cores in a multi-core system by identifying a rank of a matrix created from a hash key. If the rank of the matrix is equal to or greater than a divisor of a modulo operation applied to the results of the hash function, then the hash key may be used to ensure equal distribution of packet flows.
-
Citations
20 Claims
-
1. A method for identifying a random key to use in a distribution of packet flows among a plurality of cores in a multi-core system, the method comprising:
-
receiving, by a flow distributor executing on a multi-core system, a first random number key for a hash function; creating, by the flow distributor, a first n-rowed matrix from the first random number key, a first row of the first matrix comprising m-bits of the first random number key starting from a first position, and each successive row comprising m-bits of the first random number key starting from a position shifted from a previous position by a predetermined value; identifying, by the flow distributor, a rank of the first matrix; determining, by the flow distributor, that the rank of the first matrix is less than the number n of rows of the first matrix; and requesting, by the flow distributor and responsive to the determination, a second random number key for the hash function. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A system for identifying a random key to use in a distribution of packet flows among a plurality of cores in a multi-core system, the system comprising:
a flow distributor executing on a multi-core system, the flow distributor comprising; means for receiving a first random number key for a hash function; means for creating a first n-rowed matrix from the first random number key, wherein a first row of the first matrix comprises m-bits of the first random number key starting from a first position, and each successive row comprises m-bits of the first random number key starting from a position shifted from a previous position by a predetermined value; means for identifying a rank of the first matrix; means for determining that the rank of the first matrix is less than the number n of rows of the first matrix; and means for requesting, responsive to the determination, a second random number key for the hash function. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
Specification