- 1.71.0 (latest)
- 1.69.0
- 1.67.0
- 1.66.0
- 1.63.0
- 1.62.0
- 1.61.0
- 1.59.0
- 1.58.0
- 1.57.0
- 1.56.0
- 1.55.0
- 1.54.0
- 1.53.0
- 1.52.0
- 1.51.0
- 1.50.0
- 1.48.0
- 1.47.0
- 1.46.0
- 1.45.0
- 1.44.0
- 1.43.0
- 1.42.0
- 1.41.0
- 1.40.0
- 1.39.0
- 1.38.0
- 1.36.0
- 1.35.0
- 1.34.0
- 1.33.0
- 1.32.0
- 1.31.0
- 1.30.0
- 1.29.0
- 1.28.0
- 1.27.0
- 1.26.0
- 1.23.0
- 1.22.0
- 1.21.0
- 1.20.0
- 1.19.0
- 1.18.0
- 1.17.0
- 1.16.0
- 1.15.0
- 1.14.0
- 1.13.0
- 1.12.0
- 1.11.0
- 1.10.0
- 1.8.0
- 1.7.0
- 1.6.0
- 1.5.0
- 1.4.0
- 1.3.0
- 1.2.9
- 1.1.1
- 1.0.0
- 0.5.0
public enum InternalRange.AllocationStrategy extends Enum<InternalRange.AllocationStrategy> implements ProtocolMessageEnumEnumeration of range auto-allocation strategies
Protobuf enum google.cloud.networkconnectivity.v1.InternalRange.AllocationStrategy
Implements
ProtocolMessageEnumStatic 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_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. |
FIRST_AVAILABLE |
Pick the first available address range. This strategy is deterministic and the result is easy to predict. |
FIRST_AVAILABLE_VALUE |
Pick the first available address range. This strategy is deterministic and the result is easy to predict. |
FIRST_SMALLEST_FITTING |
Pick the smallest but fitting available range. This deterministic strategy minimizes fragmentation of the address space. |
FIRST_SMALLEST_FITTING_VALUE |
Pick the smallest but fitting available range. This deterministic strategy minimizes fragmentation of the address space. |
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_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_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_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. |
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() |
|