Enum InternalRange.AllocationStrategy (1.69.0)

public enum InternalRange.AllocationStrategy extends Enum<InternalRange.AllocationStrategy> implements ProtocolMessageEnum

Enumeration of range auto-allocation strategies

Protobuf enum google.cloud.networkconnectivity.v1.InternalRange.AllocationStrategy

Implements

ProtocolMessageEnum

Static Fields

Name Description
ALLOCATION_STRATEGY_UNSPECIFIED

Unspecified is the only valid option when the range is specified explicitly by ip_cidr_range field. Otherwise unspefified means using the default strategy.

ALLOCATION_STRATEGY_UNSPECIFIED = 0;

ALLOCATION_STRATEGY_UNSPECIFIED_VALUE

Unspecified is the only valid option when the range is specified explicitly by ip_cidr_range field. Otherwise unspefified means using the default strategy.

ALLOCATION_STRATEGY_UNSPECIFIED = 0;

FIRST_AVAILABLE

Pick the first available address range. This strategy is deterministic and the result is easy to predict.

FIRST_AVAILABLE = 2;

FIRST_AVAILABLE_VALUE

Pick the first available address range. This strategy is deterministic and the result is easy to predict.

FIRST_AVAILABLE = 2;

FIRST_SMALLEST_FITTING

Pick the smallest but fitting available range. This deterministic strategy minimizes fragmentation of the address space.

FIRST_SMALLEST_FITTING = 4;

FIRST_SMALLEST_FITTING_VALUE

Pick the smallest but fitting available range. This deterministic strategy minimizes fragmentation of the address space.

FIRST_SMALLEST_FITTING = 4;

RANDOM

Random strategy, the legacy algorithm, used for backwards compatibility. This allocation strategy remains efficient in the case of concurrent allocation requests in the same peered network space and doesn't require providing the level of concurrency in an explicit parameter, but it is prone to fragmenting available address space.

RANDOM = 1;

RANDOM_FIRST_N_AVAILABLE

Pick an arbitrary range out of the first N available ones. The N will be set in the first_available_ranges_lookup_size field. This strategy should be used when concurrent allocation requests are made in the same space of peered networks while the fragmentation of the addrress space is reduced.

RANDOM_FIRST_N_AVAILABLE = 3;

RANDOM_FIRST_N_AVAILABLE_VALUE

Pick an arbitrary range out of the first N available ones. The N will be set in the first_available_ranges_lookup_size field. This strategy should be used when concurrent allocation requests are made in the same space of peered networks while the fragmentation of the addrress space is reduced.

RANDOM_FIRST_N_AVAILABLE = 3;

RANDOM_VALUE

Random strategy, the legacy algorithm, used for backwards compatibility. This allocation strategy remains efficient in the case of concurrent allocation requests in the same peered network space and doesn't require providing the level of concurrency in an explicit parameter, but it is prone to fragmenting available address space.

RANDOM = 1;

UNRECOGNIZED

Static Methods

Name Description
forNumber(int value)
getDescriptor()
internalGetValueMap()
valueOf(Descriptors.EnumValueDescriptor desc)
valueOf(int value)

Deprecated. Use #forNumber(int) instead.

valueOf(String name)
values()

Methods

Name Description
getDescriptorForType()
getNumber()
getValueDescriptor()