Method for implementing a consistent hashing in a communication network
A method for use in a communication network is provided. The method comprises the steps of: (i) providing a plurality of network processing units (NPU's) comprised in the communication network; (ii) establishing a replication of at least one of the NPU's; (iii) virtually arranging the NPU's and the replication(s) in a ring configuration; (iv) associating a unique primary virtual identification and a corresponding unique backup virtual identification with each active and available entity selected from among the plurality of NPU's and replication(s); (v) establishing a list of hash values, each associated with the primary virtual identification or the backup virtual identification of a corresponding active and available entity; (vi) implementing a ring consistent hashing algorithm for carrying out a search resolution for a consistent hashing; and (vii) in a case of a change in an active and available entity having a certain primary virtual identification, using the corresponding backup virtual identification to maintain the ring continuity.
1. A method for use in a communication network, wherein said method comprises the steps of:
(i) providing a plurality of network processing units (NPU's) comprised in said communication network;
(ii) establishing a replication of at least one of said plurality of network processing units;
(iii) virtually arranging the plurality of network processing units and the at least one replication, in a ring configuration;
(iv) associating a unique primary virtual identification and a corresponding unique backup virtual identification with each active and available entity selected from among said plurality of network processing units and the at least one replication;
(v) establishing a list of hash values, each associated with the primary virtual identification or with the backup virtual identification of a corresponding active and available entity;
(vi) implementing a ring consistent hashing algorithm for carrying out a search resolution for a consistent hashing; and
(vii) in a case of a change in at least one of the active and available entities having a certain unique primary virtual identification, using the corresponding backup virtual identification to maintain the ring continuity.
2. The method according to claim 1 , wherein the search resolution for a consistent hashing is conducted based on searching for a packet destination ID using a key built from said packet's meta-data.
3. The method according to claim 2 , wherein packet's meta-data is derived from the packet's networking headers.
4. The method according to claim 2 , wherein the search resolution for a consistent hashing is done by retrieving a respective destination ID while using a Ternary Content-Addressable Memory (TCAM) algorithm.
5. The method according to claim 2 , wherein further comprising a step of composing a route space of the networking subnets and/or prefixes, and wherein the search function is based on a Longest Prefix Match (LPM) algorithm.
6. The method according to claim 5 , wherein the same search function (LPM) is preserved, and the space is built by using possible virtual identifications as prefixes.
7. A method for use in a communication network, wherein said method comprises the steps of:
(i) providing a plurality of network processing units (NPU's) comprised in said communication network;
(ii) establishing a replication of at least one of said plurality of network processing units;
(iii) virtually arranging the plurality of network processing units and the at least one replication, in a ring configuration;
(iv) associating a unique primary virtual identification and a corresponding unique backup virtual identification with each active and available entity selected from among said plurality of network processing units and the at least one replication;
(v) establishing a list of hash values, each associated with the primary virtual identification or with the backup virtual identification of a corresponding active and available entity;
(vi) implementing a ring consistent hashing algorithm for carrying out a search resolution for a consistent hashing; and
(vii) in a case of a change in at least one of the active and available entities having a certain unique primary virtual identification, using the corresponding backup virtual identification to maintain the ring continuity,
wherein the search resolution for a consistent hashing is conducted based on searching for a packet destination ID using a key built from said packet's meta-data,
wherein said method further comprises a step of composing a route space of the networking subnets and/or prefixes, and wherein the search function is based on a Longest Prefix Match (LPM) algorithm, and
wherein said method further comprises a step of utilizing different load-balancing groups as VRF (Virtual Routing and Forwarding) tables, which in turn are used as parameters while carrying out the LPM algorithm searches, thereby enabling generation of a dedicated consistent hashing space for use as a route space for conveying traffic in the communication network.