Establishing entry corresponding to equal-cost paths

A network device, comprising:

• a processor, and
• a non-transitory machine-readable storage medium storing machine executable instructions which are executable by the processor to:
• assign an inner label and an outer label for each of N paths configured to be equal cost with each other between the network device and a destination network device, wherein the respective inner labels corresponding to the paths are same with each other, and N is an integer more than or equal to 2;
• establish a Forward Information DataBase (FIB) entry, wherein the FIB entry comprises an address of the destination network device, the number of Equal-Cost Multi-Path Routing (ECMP) entries in an ECMP table corresponding to the paths, and the same inner label, and the number of the ECMP entries in the ECMP table is equal to a preset fixed value;
• and
• assign at least one ECMP entry for each of the paths based on the number N of the paths and the fixed value, wherein a sum of the numbers of the respective ECMP entries corresponding to the N paths is equal to the fixed value, and the at least one ECMP entry corresponding to each of the paths comprises an index of the outer label of the path,
• wherein the processor is caused by the machine-executable instructions to:
• determine a first numerical value K by rounding down a quotient obtained by dividing the fixed value by the number N of the paths;
• determine a remainder of dividing the fixed value by the number N of the paths to be a second numerical value M;
• when the second numerical value M is equal to 0,
• determine that the number of the at least one ECMP entry corresponding to each of the paths is equal to the first numerical value K;
• when the second numerical value M is more than 0,
• select M paths from the N paths,
• determine that the number of the at least one ECMP entry corresponding to each of the selected M paths is equal to the first numerical value K plus 1, and the number of the at least one ECMP entry corresponding to each of remaining paths in the N paths is equal to the first numerical value K.

A non-transitory machine-readable storage medium storing machine executable instructions which are invoked and executed by a processor of a network device to:

• assign an inner label and an outer label for each of N paths configured to be equal cost with each other between the network device and a destination network device, wherein the respective inner labels corresponding to the paths are same with each other, and N is an integer more than or equal to 2;
• establish a Forward Information DataBase (FIB) entry, wherein the FIB entry comprises an address of the destination network device, the number of Equal-Cost Multi-Path Routing (ECMP) entries in an ECMP table corresponding to the paths, and the same inner label, and the number of the ECMP entries in the ECMP table is equal to a preset fixed value;
• and
• assign at least one ECMP entry for each of the paths based on the number N of the paths and the fixed value, wherein a sum of the numbers of the respective ECMP entries corresponding to the N paths is equal to the fixed value, and the at least one ECMP entry corresponding to each of the paths comprises an index of the outer label of the path,
• wherein the processor is caused by the machine-executable instructions to:
• determine a first numerical value K by rounding down a quotient obtained by dividing the fixed value by the number N of the paths;
• determine a remainder of dividing the fixed value by the number N of the paths to be a second numerical value M;
• when the second numerical value M is equal to 0,
• determine that the number of the at least one ECMP entry corresponding to each of the paths is equal to the first numerical value K;
• when the second numerical value M is more than 0,
• select M paths from the N paths,
• determine that the number of the at least one ECMP entry corresponding to each of the selected M paths is equal to the first numerical value K plus 1, and the number of the at least one ECMP entry corresponding to each of remaining paths in the N paths is equal to the first numerical value K.